Quotient-Scar Programme

Within the wider dynatology ontology, this programme governs the realization, observation, scar and recovery coordinates \((\rho,L,D,I,R)\). It does not by itself supply the ambient carrier, admissibility predicate or objective provenance \((X,A,J)\).

This lane is the machine-readable and human-readable matrix of reductions uncovered by the frontier investigations.

The canonical comparison table is quotientscarregister_v1.json. Its entries do not assert that the listed carriers are physically equivalent. They force each comparison to declare:

• the resolved parent;
• the reduction map;
• what is killed;
• what survives and in which category;
• whether effective dynamics closes;
• whether available detectors are sufficient;
• the evidential status; and
• the decisive falsifier.

The conceptual foundation is the quotient-scar calculus. The exact memory theorem is wave 7.1, and the complete-erasure boundary is wave 7.2.

Composition laws are developed in wave 7.3, and the resulting matrix/data model is specified in wave 7.4.

The relation between noncommuting constraints, selection, principal angles and conditional holonomy is developed in wave 7.5.

The separation and recombination of selection, coherent rotation and hidden-state memory is given in wave 7.6. The register now also contains typed relations between entries, so shared actions are not silently promoted to shared physical carriers.

The first reflexive extension is wave 7.7: two evolving rails contract their mismatch but retain a neutral common symmetry mode. An independent boundary or historical record removes that mode, while an oriented lift remains necessary for the sign of a quarter turn.

The spatial completion is wave 7.8. It shows exactly how a metastable record becomes a wall, and why the wall changes topology only relative to the declared space of admissible gapped interpolations.

The first exact toy feedback loop is wave 7.9: a kink-localized response supplies an independently retained projector, and its fluctuation determinant generates a positive selector Hessian and contractive return map. The same calculation proves that this projective feedback remains blind to oriented quarter-turn sign.

The complete two-projector invariant boundary is wave 7.10. The overlap \(t=\operatorname{Tr}(PY)\) generates the unoriented scalar data, while the pseudoscalar \(\chi\) requires an orientation tensor; a paired equilibrium determinant necessarily loses its sign.

The operational discriminator is wave 7.11. It jointly records the even selector response, odd orientation response and branch populations, with deliberate detector-label randomization as the erasure control.

The first equilibrium oriented selector is wave 7.12. A physical wall orientation supplies the additional pseudoscalar needed to make \(w\chi(P,Y)\) a reflection-invariant scalar; opposite wall histories select opposite lifts while retaining the same overlap and minimum energy.

The coefficient-provenance audit is wave 7.13. It separates exact-zero factorized routes, the Peirce-to-sterile no-go, symmetry-allowed but freely renormalized wall couplings and empirically matchable conventional interfaces. The successful effective selector is not promoted to a fundamental coefficient.

The register's present total of 27 relations is frozen and tested in wave 7.14. The count matches the exceptional Jordan/E6 dimension and even admits a superficial \(3+24\) taxonomy split, but the graph presently supplies neither an \(E_6\) action nor an invariant cubic, Peirce decomposition or \(E_8\) bracket.

The sharper typed signature is audited in wave 7.15. Its \(7+5+5+5+3+2\) counts produce a semantic \(12+15\) split matching the graph's topological dimensions, while the cycle space refines exactly as \(2+8+2\) across constructive, mixed-interface and guardrail sectors.

The Leech/Jordan interpretation of the other exact partition is audited in wave 7.16. It connects \(J_3(\mathbb O)=\mathbb R^3\oplus\mathbb O^3\) to the explicit Leech carrier \(\Lambda_{24}\subset\mathbb O^3\), while proving that the graph's own three distinguished relations contribute one component bridge and two cycle closures over its 24-edge backbone. The graph is not itself a Leech lattice without new integral Gram and gluing data.

The first Gram-level test is wave 7.17. The canonical form \(2I+B^TB\) on the 24-edge backbone is integral, even, positive definite and rootless with minimum norm four, but its determinant has odd 2-adic valuation. It therefore admits no integral unimodular finite-index completion at fixed form and cannot be converted into the Leech lattice by ordinary gluing.

The direct Golay-glue test is wave 7.18. Projecting the graph's 12-dimensional binary cycle space injectively onto its 24-edge backbone produces a canonical \([24,12,2]\) code, not the doubly-even self-dual \([24,12,8]\) extended Golay code. Its two weight-two words identify the short triality-mediated return paths that obstruct direct Golay glue.

The resulting shape-of-bounds atlas shows that the local admissibility zone is a stratified fibered object: continuous positivity cones and Morse–Bott orbits meet linear cycle/incidence strata, discrete arithmetic cliffs, contraction basins, orientation double covers, detector folds, topological walls and missing translation arrows. Its twelve boundary types are frozen in a machine-readable register.

The first source-native pairing tranche is wave 7.20. Collapsing the 24-edge backbone only by its five remaining semantic types gives a canonical five-space whose constructive/guardrail polarity has signature \((2,3)\). The graph's eleven triangles induce a cubic with exactly the rules-out direction in its type-level radical, while its common continuous stabilizer with the quadratic form is zero.

The parameter-free arithmetic bridge is wave 7.21. Symmetrized directed two-step composability compresses to a full-rank five-type form of signature \((3,2)\), determinant 64 and cyclic discriminant group. Its unique order-eight glue subgroup produces the odd unimodular lattice \(I_{3,2}\), or \(I_{2,3}\) after overall sign, while leaving operator, dynamical and detector admission open.

The pairing search closes in wave 7.22, with a machine-readable ledger. It records the exact filled five-dimensional lattice, the full carrier's QR-003 common radical, and every positivity, discriminant, code-distance, cubic, translation, dynamical, detector and exceptional reopen gate.

The remaining operator gate is executed in wave 7.23. Matrix units on the sixteen-node formal carrier recover the path pairing exactly, but no nonzero modality product closes in the five-space; adjoint closure gives \(\mathfrak{sl}_{14}\oplus\mathfrak{sl}_2\), while promotion of the three shared-action seams gives \(\mathfrak{sl}_{16}\).

The terminal physical-bridge audit is wave 7.24. It proves that the natural positive/split metric pairs on the relation and link carriers admit no simultaneous intertwiner, supplies the unique extra direct detector channel required to resolve QR-003, and shows that ordinary Hermitian completion reverses the directed wall-null prediction.

The distinctions between formal and physical operators, natural and imported dynamics, abstract and laboratory detectors, and emulator versus fundamental tests are frozen in the physical bridge stage ledger.

The first device-level continuation is wave 7.25, with an executable emulator specification. It proves the reciprocal-leakage law \(s_{\min}=4|\epsilon|\), the persistence of the QR-003 null under arbitrary directed gain disorder, the unique first-order QR-002 seam contaminant and a conservative active-network stability bound.

The minimal acquisition design is wave 7.26, with its frozen 24-channel schedule. Twenty-three path/triangle records span the composition-visible subspace and one direct QR-003 record completes it. The response matrix is unimodular and has condition number about 9.27. A broader basis challenge also rules out the tempting determinant-eight seed as a detector-side counterpart of the genuine index-eight five-type lattice.

The reconstruction and precision geometry is wave 7.27, with a machine-readable redundancy ledger. The inverse uses only 44 coefficients, all \(0,\pm1\). Eight targeted redundant channels lower the worst equal-noise variance factor from 8 to about 4.78, while the full observable pool shows that QR-001 remains the intrinsically weakest direction of the current path/triangle detector family.

An external computational instance is classified in wave 7.28, with a machine-readable arithmetic ledger. Capping fifteen Lean-expression coordinates at the Monster-order exponents produces the 424,488,960-element divisor lattice of \(|\mathbb M|\), a commutative saturated opcode monoid and an exact recoverability boundary. It is a genuine Monster-derived admissibility carrier, but no Monster action, Hecke relation, modular trace or physical dynamics has yet been supplied.

The box's filled/unfilled geometry is developed in wave 7.29, with a frontier ledger. The address space factors as a six-coordinate graded box times a nine-cube and forms a symmetric 96-level tower. The reported 908 addresses occupy only about \(2.14\times10^{-6}\) of the formal box; the next problem is to distinguish constructibly reachable, structurally forbidden, encoding-unstable and semantically collided regions.

The first exact reachability cut is wave 7.30, with a structural-sieve ledger. Kernel closure, the rooted-tree arity identity, basic de Bruijn scoping and logical-flag incidence exclude 84.5688% of the formal Monster box, leaving 65,503,764 addresses as a necessary-condition upper bound. The remaining gap to the reported 908 cells belongs to typing, environment reachability, representation policy and semantic stability.

The semantic-invariance gate is tested in wave 7.31, with five machine-readable witness pairs. Metadata erasure, beta reduction, zeta reduction and literal expansion preserve Lean meaning but change the raw Monster address; alpha-renaming is the invariant control. The fold is therefore a representation-sensitive diagnostic until a normalization policy and stability theorem are supplied.

The normalization repair is executed in wave 7.32, with a 32-expression Lean 4.35.0 atlas. Recursive kernel weak-head normalization contracts fourteen raw addresses to seven and stabilizes all eight tested multi-presentation equivalence families. It simultaneously proves a name-blind no-go: thirteen semantic classes collide into those seven cells because constant names and universe arguments are discarded. The fold is therefore a canonical constructor-shape signature, not a semantic identifier; the next admissible enrichment is constant incidence or dependency-coloured local structure.

The first detector enrichment is executed in wave 7.33, with a 16-object adversarial ladder. A stable leaf-label digest reduces twenty collision pairs to four; role-labelled local transitions reduce them to two; rooted role paths resolve this finite benchmark. Explicit surviving pairs prove that name, order and nonlocal correlation are separate detector resources. The result recommends adaptive scar enrichment inside impure address fibres, while withholding any claim that a fixed local radius identifies arbitrary expression trees.

The locality boundary is made exact in wave 7.34, with an infinite counterexample construction. For every positive radius, two distinct closed right-associated Lean types share their Monster address, both depth-radius anchors and every labelled local-window multiset through that radius, while first differing one level deeper. Fixed local depth can improve finite-corpus purity but cannot be universally identifying; depth must adapt to the unresolved fibre or end at a recursively complete representation.

The adaptive cost is measured in wave 7.35, with an exhaustive 32,766-object census. For all binary arrow chains through length fourteen, the observed globally injective radius is \(\max(1,\lfloor n/2\rfloor)\). At length fourteen the uniform ceiling is seven, but fibre-wise stopping averages 4.083 levels and saves 41.67% of linear depth work; only 36 of 16,384 objects require the ceiling.

The first dynamically transported arithmetic scar is Mystery Atlas 16. An index-two embedding selects one of the three parity sublattices of \(\mathbb Z^2\), while the golden matrix rotates those sublattices in a \(C_3\) orbit. The scar is therefore stationary only for the third-iterate return map. This adds scar transport to the programme: a reduction condition may close under a return map because one-step dynamics permutes a finite family of admissibility sectors.

The corresponding boundary test is Mystery Atlas 17. It proves a detector factorization no-go: oriented Penrose mismatch data varies within a fixed girih count fibre, so neither count reduction nor its parity scar can recover boundary defects. This adds a sharp recovery criterion: a scar can constrain a lifted detector only if an explicit map from the retained quotient data to the detector-sensitive collared carrier is supplied.

Run:

node verification/verify/verify_quotient_scar_register.mjs