math.RA — Rings and Algebras
Contributed by Jesus Vilela Jato
Substitute octonions for the letters of a word w. Each bracketing of w is a polynomial map, and bracketings giving the same map form a kernel class inside the associahedron Kn (edges: flips (AB)C↔A(BC)).
Theorem. Every kernel class is flip-connected iff w has at most two distinct letters or every letter occupies one contiguous run. Hence for n≥1, exactly Bell(n)−2n+n words of length n, up to renaming, have a disconnected class (0,0,0,3,25,145,756,…).
Ideas. In-class flips must have letter-count matrix of rank ≤2: for any nonzero 3×3 minor d and M=2∣d∣+1, an integer witness gives [A,B,C]≡2dM3e7(modM4). For interval words, the rank-≤2 components are separated by octonion moments that recover an explicit component invariant. For other words, “caterpillar” certificates give two Moufang-equivalent bracketings that no rank-≤2 path joins.
Formalization. The main theorem, the canonical-word correspondence and the count are proved in core Lean 4 (no Mathlib): MainThm.main, Canon.canonical, Count.count_disconnected. That is 9,252 lines in lean/Caterpillar/, no sorry, standard axioms only. The one informal step is that polynomial identities over Z8 and over R8 agree.
Disclosure. The formal proofs and much of the exposition were developed with Claude (Anthropic) under my direction. An AI referee round was done before posting (paper/REVIEW.md). I’m posting for independent human judgement, especially on Proposition T, which the paper proves via the formalization. I’d also like to know whether the associative-spectrum corollary sn(G)=Cn−1 (Catalan numbers) is already in the literature. The paper’s two-line proof gives it for every non-associative magma with a two-sided identity, in particular for O.
Repository: https://github.com/Dojo-1/Lemma-W-count-determinant-witness-
Primarily AI-generated textHuman understanding: all partsmath.RA math.CO lean-formalized octonions associahedron