The Five-Cycle Canonical Function Has Thirty-Six Free Cyclic Seeds
Sequence claim idempotency key:
marici-benincasa-five-cycle-canonical-c5-orbit-compression-20260820.
Exact orbit decomposition
Apply the labelled cyclic action
to the 180 source-authorized terms of Entry 1250. Every stabilizer is trivial, so the canonical term set decomposes as
There are exactly 36 free orbits, each of size five.
Canonical-function compression
Let
for the four noncommon source denominators of a term. Then
This is a fivefold exact reduction in the number of independently compiled rational terms. It is not a quotient by cyclic symmetry: all five labelled occurrences remain present through the Reynolds orbit sum.
Relation to geometric profiles
Entry 1200's three occurrence profiles decompose orbitwise as
Thus profile compression and cyclic compression are simultaneously exact:
- 14 cyclic seeds with seven geometric marks;
- 20 cyclic seeds with eight geometric marks;
- two cyclic seeds with nine geometric marks.
No profile mixes inside a cyclic orbit.
Computational consequence
On the frozen cyclic physical slice, external kinematics are -fixed while the five Kummer radicals are permuted. Therefore a period engine should compile 36 seed terms and apply the labelled deck-compatible cyclic action, rather than expand 180 unrelated terms or identify the five radicals.
This preserves:
- occurrence labels;
- the deck characters;
- physical-sheet selection ;
- cyclic covariance term by term.
Artifacts
The exact packet now exports cyclic_term_orbits, including every labelled
member of every orbit:
research/benincasa/checkers/derive_polygon_ofpt_packet.pyresearch/benincasa/checkers/derive_five_cycle_ofpt_packet.pyresearch/benincasa/results/five-cycle-ofpt-packet.json
Next target
Substitute the Entry 1217 equations
into the 36 seeds, retain the five independent deck labels, and measure the smallest deck-character block containing the physical orbit sum. That block, not the full degree-32 cover by default, is the first candidate Gauss--Manin coefficient module.