Golden Character Quotient
Abstract
The quadratic character modulo five gives a binary quotient of unramified prime words.
Theorem 1.1 (Golden character quotient specification).
Proof. Machine-checked in Lean as D5/S3/Observer/AgencyHolonomy/GoldenCharacterQuotient.golden_character_quotient_spec (✓ std3). ∎
Source. Repository-derived.
Commentary.
Restrict every letter to a rational prime different from five. The Legendre symbol modulo five then takes values in the two integer units, and its product defines a homomorphism from the free monoid of prime words to this binary group.
Concatenation becomes multiplication, permutations do not change the value, and the value is negative one raised to the number of inert letters. The words [2, 3] and [2, 11] witness both quotient values.
The source passage does not define the full holonomy, observer rapidity, or commutator holonomy. No formal claim about forgetting those data is made here.
References
- Truth anchor:
D5/S3/Observer/AgencyHolonomy/GoldenCharacterQuotient.golden_character_quotient_spec - Dependency: D5/S3/Arith/Lattices/RamifiedFiveBoundarySelection