On braid words and irreflexivity (Q1315328): Difference between revisions

A left-distributive algebra is a set \({\mathcal B}\) equipped with a binary operation such that \(a(bc)= (ab)(ac)\) for all \(a,b,c\in {\mathcal B}\). The free left-distributive algebra on \(n\) generators is denoted \({\mathcal A}_ n\), and we write \({\mathcal A}\) for \({\mathcal A}_ 1\). if \(P,Q\in {\mathcal B}\) write \(P<_ L Q\) iff one can write \(P\) as a strict prefix of \(Q\), i.e., \(Q= ((PQ_ 1)\dots)Q_ k\) for some \(Q_ 1,\dots, Q_ k\), \(k\geq 1\). Then a proof that \(<_ L\) is irreflexive (that is, that \(P\neq ((PQ_ 1)\dots)Q_ k\) for all \(P\), \(Q_ 1,\dots,Q_ k\in{\mathcal A})\) on \({\mathcal A}\) was found by \textit{R. Laver} [Adv. Math. 91, 209-231 (1992)], under large cardinal assumptions, as part of a theorem that \({\mathcal A}\) is isomorphic to a certain algebra of elementary embeddings from set theory. It was also proved by Laver [loc. cit.] that \(<_ L\) linearly orders \({\mathcal A}\), the part that for all \(P,Q\in {\mathcal A}\) at least one of \(P<_ L Q\), \(P=Q\), \(Q<_ L P\) holds being proved independently and by a different method by \textit{P. Dehornoy} [J. Pure Appl. Algebra 61, No. 2, 123-146 (1989; Zbl 0686.20041); C. R. Acad. Sci., Paris, Sér. I 309, No. 3, 143-148 (1989; Zbl 0688.20038)]. The linear ordering of \({\mathcal A}\) gives left cancellation, the solvability of the word problem, and other consequences. Left open was whether irreflexivity, and hence the linear ordering, can be proved in ZFC. Recently, \textit{P. Dehornoy} [``Braid groups and left distributive structures'', Preprint (1992)] has found such a proof, involving an extension of the infinite braid group but without invoking axioms extending ZFC. The purpose of this note is to prove the result without the additional machinery of this extended group, and at shorter length.