Context
The preceding bounded census left exactly the common-letter unary family as possible ordinary quotients.
Hypotheses and scope
- Both words are finite and nonempty.
- The quotient uses existential block transitions.
Proof or evidence
Necessity: any mismatched position pair creates a grid location with two incoming labels. Sufficiency: an explicit projection sends the APOS boundary and interior grid onto the cyclic mn-state prefix core, with the initial and final states preserved.
Verification notes
Independent code checks all 4,923 ordered word pairs over {a,b,c} with total length at most six and verifies the quotient formula for all 1,024 pairs 1≤m,n≤32, including the unit boundaries.
Limitations
- The theorem classifies ordinary existential quotients; FPRD-SH-T06 separately classifies left-invariant quotients.
- Specialist review and literature comparison remain open; no priority claim is made.