On multiplicative equivalences that are totally incompatible with division (Q2314982)

Let \(X\) be a set containing at least two different elements \(x,y\). Suppose that \(F(X)\) is a free loop with a base \(X\). Consider the least equivalence relation with is a congruence \(\sim\) with respect to multiplication in \(F(X)\) which contains the pair \((x,y)\). Then \(a\sim b\ \&\ a\ne b\) implies \(u\backslash a\nsim u\backslash b\) and \(a\diagup u \nsim b\diagup u\) for all \(a,b,u\in F(X)\).