SHAPE — The Structural-Form Root (Deep Root 3 of 3)

Honest status: DECLARED POSIT — selector-minimal, NOT the unique minimum. Inside a declared, frozen search category, under a pre-declared Occam funnel, the frozen 13D active branch is the lexicographically-minimal complete survivor and no Tier-1 competitor currently beats it — but this SELECTS the geometry, it does not DERIVE it (selection ≠ derivation). Realization-minimality has 5 OPEN sub-lemmas; a generative no-alternative (“forcing”) theorem has LOW odds (a universal negative); and the selection bottoms out on E (the SM chiral content), which no known principle forces. This dossier is the full SHAPE_R2 certificate suite; the published MINIMAL_SHAPE suite is its synthesis. No status was ever upgraded.

What this document is. A faithful, concatenated consolidation of the source files behind this deep root — assembled (not summarized) so every line can be checked against the corpus. Frozen branch dcc66f1b2685 / a5b1e6f9d951 READ-ONLY. Date: 2026-06-24.

Source files consolidated here

• SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_SELECTOR_MINIMALITY_CERTIFICATE_THEOREM.md
• SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_FUNCTIONAL_ROLE_NECESSITY_THEOREM.md
• SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_TIER1_COMPETITOR_ELIMINATION_THEOREM.md
• SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_REALIZATION_MINIMALITY_THEOREM.md
• SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_ABSOLUTE_IRREDUCIBILITY_FORK_THEOREM.md
• SHAPE_R2_CERTIFICATE_SUITE/SHAPE_COMPETITOR_AUDIT_MATRIX.md

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_SELECTOR_MINIMALITY_CERTIFICATE_THEOREM.md

T_SHAPE_SELECTOR_MINIMALITY_CERTIFICATE_THEOREM.md

Target: R2 Shape refinement — prove the frozen three-layer active branch is selector-minimal inside the declared scoped-GUT search category
Date: 2026-06-23
Document class: Category-relative irreducibility / selector-minimality theorem
Status: CONDITIONAL CERTIFICATE THEOREM; READY FOR REVIEW
No status was ever upgraded. This theorem does not derive Shape from cost-floor, scale, or first principles. It upgrades Shape from “selected” to “selector-minimal inside the declared search category,” conditional on the selector, layer-subset exhaustion, term-level necessity, gate certificates, and no preferred admissible competitor.

0. Executive verdict

We should not try to prove:

\[ {\rm Scale}+{\rm Granularity}\Rightarrow{\rm Shape}. \]

That is too strong and is not currently supported.

The theorem we can honestly target is:

\[ \boxed{ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B) } \]

where \(B_{\rm active}\) is the full three-layer frozen geometry:

\[ \boxed{ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. } \]

This gives R2 a real certificate:

R2 Shape is selector-minimal inside the declared search category.

It does not give:

R2 Shape is absolutely derived from cost-floor or scale.

The right status is:

CATEGORY-RELATIVE CERTIFIED
not
ABSOLUTELY IRREDUCIBLE

1. Source anchors

Use these source anchors as READ-ONLY authority.

1.1 Full active branch / three-layer geometry

The GUT manuscript defines the active branch as a three-layer object:

\[ \mathfrak B_{\rm active} = [\mathcal M_4 \times K_6 \times S^2 \times S_Y^{\,1}]_{(\times)} \oplus [F^+_{\rm finite} \oplus \mathcal C_{\rm admiss}]_{(\oplus)} \otimes [\mathcal E_{\rm matter}\oplus\mathcal E_{\rm gauge}\oplus\mathcal E_{\rm Higgs}\oplus\mathcal E_{\rm proton}]_{(\otimes)}. \]

The \(\times\)-layer is the base / metric geometry.
The \(\oplus\)-layer is finite chamber / admissibility / claim-control data.
The \(\otimes\)-layer is field / bundle / Hilbert / operator structure.

1.2 Selector / Occam authority

Appendix B1 is the selector authority. It defines:

• declared search category;
• constraint set \(\mathcal C_{\rm GUT}\);
• selector \(\mathcal S\);
• Occam / lex-min ranking \(\mathfrak R\);
• freeze-before-compare rule \(\mathcal F\);
• eliminated-branch ledger;
• no-smuggling rules;
• reopen conditions.

The substantive reopen condition is:

a new admissible candidate inside the declared search category
that satisfies the constraints and is strictly preferred under the ranking.

1.3 Layer necessity authority

Appendix B2 proves three-layer necessity at layer level:

× + ⊕ + ⊗ is the first layer-class capable of full scoped-GUT closure.

It also states that the theorem is category-relative, not a proof that no other mathematical architecture exists outside the declared search category.

1.4 Term necessity authority

Appendix C proves term-level necessity for the active branch. It gives ten term authority cards, one for each named load-bearing term, and records:

• formal object;
• layer assignment;
• gates served;
• first required gate;
• failure-if-removed table;
• freeze record.

1.5 Z₆ reduction authority

The Z₆ derivation shows why the full three-layer object must be carried unflattened:

\[ Z_6=\ker(Z(G_0)\to{\rm Aut}(E)). \]

The result lands on the actor layer \(E\) plus a faithfulness / maximal-trivially-acting principle. Anomaly admissibility shapes \(E\) one layer upstream in \(C_{\rm admiss}\). The result explicitly does not follow from cost-floor alone.

2. Definitions

2.1 Search category

Let \(\mathfrak B_{\rm search}\) be the declared scoped-GUT search category.

A candidate \(B\in\mathfrak B_{\rm search}\) may use:

• compact-factor geometries;
• bundle data;
• orbifold quotients;
• projectors;
• chamber operators;
• structural layer moves enumerated by the selector formalism.

It may not shrink the search category after the fact.

2.2 Constraint set

Let \(\mathcal C_{\rm GUT}\) be the required scoped-GUT constraint vector:

\[ \mathcal C_{\rm GUT} = (C_1,\ldots,C_{10}) \]

where the constraints correspond to Gates 1–10:

1. geometry specification;
2. Standard Model gauge recovery;
3. hypercharge and electric charge recovery;
4. chirality / no mirrors / three families;
5. anomaly cancellation;
6. stabilization of used compact moduli;
7. threshold unification;
8. Higgs protection;
9. flavor closure;
10. proton safety.

Gate 11 is the claim-boundary discipline and is treated as a governance guard, not as a shape-output constraint.

2.3 Admissible candidate set

Define:

\[ {\rm Adm}(\mathfrak B_{\rm search}) = \{ B\in\mathfrak B_{\rm search}: B\models\mathcal C_{\rm GUT}, B\text{ obeys freeze-before-compare}, B\text{ obeys no-smuggling} \}. \]

2.4 Simplicity / Occam ranking

Let:

\[ \mathfrak R_{\rm Occam} \]

be the declared lexicographic ranking from Appendix B1.

The ranking is constrained by completeness binding:

Completeness outranks simplicity.

A candidate may be simpler only after it satisfies all required constraints.

2.5 Selector

Define the selector:

\[ \mathcal S(B) = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B). \]

The theorem target is:

\[ \mathcal S(B)=B_{\rm active}. \]

3. Main theorem

Theorem — Selector-Minimal Shape Certificate Theorem

Assume:

1. the declared search category \(\mathfrak B_{\rm search}\) is accepted;
2. the constraint set \(\mathcal C_{\rm GUT}\) is accepted;
3. the Occam / lex-min ranking \(\mathfrak R_{\rm Occam}\) is accepted;
4. the freeze-before-compare rule is satisfied;
5. the no-smuggling rules are satisfied;
6. Appendix B2 correctly shows that every proper layer subset fails at least one required gate;
7. Appendix C correctly shows that every named term of \(B_{\rm active}\) is load-bearing;
8. Gates 1–10 are certificate-complete under their declared assumptions;
9. no candidate \(B'\in\mathfrak B_{\rm search}\) is known such that

\[ B'\models\mathcal C_{\rm GUT} \quad\text{and}\quad B'\prec_{\mathfrak R}B_{\rm active}. \]

Then:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B). \]

Therefore R2 Local Structural Form is category-relative certified:

R2 is selector-minimal inside the declared scoped-GUT search category.

4. Proof

Step 1 — Completeness filters the candidate set

By definition,

\[ B\in{\rm Adm}(\mathfrak B_{\rm search}) \]

only if

\[ B\models\mathcal C_{\rm GUT}. \]

Therefore no candidate is eligible for Occam comparison unless it passes all required scoped-GUT constraints.

This prevents the main smuggling error:

simpler but incomplete ≠ preferred.

Step 2 — Proper layer subsets are inadmissible

Let

\[ \Lambda=\{\times,\oplus,\otimes\} \]

be the three-layer set.

For a proper subset

\[ L\subsetneq\Lambda, \]

define

\[ \mathfrak B_L = \{ B\in\mathfrak B_{\rm search}: B\text{ uses only layers in }L \}. \]

Appendix B2’s layer-subset exhaustion asserts:

\[ \forall L\subsetneq\Lambda, \qquad \mathfrak B_L\cap{\rm Adm}(\mathfrak B_{\rm search})=\varnothing. \]

So no proper layer subset can be the selected shape.

This proves that the \(\times/\oplus/\otimes\) split is not mere bookkeeping under the declared search category.

Step 3 — The active branch is admissible

The active branch

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)} \]

has claimed certificate closure for Gates 1–10 under declared assumptions.

Thus:

\[ B_{\rm active}\in{\rm Adm}(\mathfrak B_{\rm search}). \]

Step 4 — Term-level removal fails

Appendix C gives a term authority card for every named term in the active branch.

Let \(t\) be any named term in \(B_{\rm active}\). Appendix C asserts that removing \(t\) causes at least one required gate to fail.

Therefore:

\[ B_{\rm active}\setminus\{t\}\notin{\rm Adm}(\mathfrak B_{\rm search}) \]

for every load-bearing term \(t\).

So the active branch is term-minimal among its own retained terms.

Step 5 — No preferred admissible competitor is currently known

The substantive reopen condition is exactly:

\[ \exists B'\in\mathfrak B_{\rm search} \quad B'\models\mathcal C_{\rm GUT} \quad \text{and} \quad B'\prec_{\mathfrak R}B_{\rm active}. \]

No such \(B'\) is currently supplied inside the declared search category.

Therefore, conditional on the selector formalism and certificate stack, the selected branch is:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B). \]

QED.

5. What this theorem proves

It proves:

R2 Shape is category-relative selector-minimal.

More formally:

\[ {\rm Cert}_{\rm selector}(R2) = \left( \mathfrak B_{\rm search}, \mathcal C_{\rm GUT}, \mathfrak R_{\rm Occam}, {\rm B2}, {\rm C}, {\rm D-L}, {\rm R0} \right). \]

This is an earned certificate, not a vibe.

6. What this theorem does not prove

It does not prove:

\[ {\rm Scale}+{\rm Granularity}\Rightarrow{\rm Shape}. \]

It does not prove:

\[ {\rm CostFloor}\Rightarrow [M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2]. \]

It does not prove absolute uniqueness outside the declared search category.

It does not derive the numerical anchors.

It does not close:

• Gap 02;
• Born A1/A2 beyond R5-Strong adoption;
• BG-10;
• \(\Lambda\);
• \(a_6\);
• R4 / \(S_{13}\);
• c_loop;
• CMB/LSS likelihood.

7. Status upgrade for R2

Before this theorem:

R2 — Local Structural Form
Status: selected / open irreducibility / weak link.

After this theorem, if accepted:

R2 — Local Structural Form
Status: category-relative selector-minimal certificate.

This is stronger than selection.

It is weaker than absolute irreducibility.

The honest final wording is:

Shape is not yet derived from Scale + Granularity.
But inside the declared scoped-GUT search category,
the frozen three-layer active branch is the selector-minimal survivor.

8. Relationship to the minimal-certified-basis program

The minimal-certified-basis program asks for:

\[ B_{\min} = \operatorname*{argmin}_{B} ( {\rm uncertified}(B), |B|, {\rm itemizedDoF}(B), {\rm complexity}(B) ). \]

This theorem reduces the uncertified status of Shape:

\[ {\rm Shape}: {\rm selected} \to {\rm category\text{-}relative\ certified}. \]

But it does not remove Shape from the basis.

The deep-residue posture becomes:

Therefore the candidate residue remains:

\[ B_3^{?} = \{ {\rm Scale}, {\rm Granularity}, {\rm Shape} \}, \]

but Shape now carries a stronger certificate.

9. Why the full three-layer object is essential

Flattening the geometry would invalidate the theorem.

The Z₆ result already demonstrates why:

\[ Z_6=\ker(Z(G_0)\to{\rm Aut}(E)) \]

lands on the actor layer \(E\), while anomaly admissibility shapes \(E\) one layer upstream in \(C_{\rm admiss}\).

Thus:

× alone cannot compute Z6.
⊕ alone has rules but no stage/actors.
⊗ alone has actors but no metric arena/rulebook.
× + ⊗ lacks the finite admissibility firewall.
× + ⊕ lacks physical actor bundles.
⊕ + ⊗ lacks the compact metric carrier.

The full object is:

\[ (\times)\oplus(\oplus)\otimes(\otimes), \]

not a decorative notation.

10. Falsifiers

This theorem is falsified or downgraded if any of the following happens.

F1 — Search-category rejection

A reviewer shows that the declared search category excludes a natural competitor without justification.

Effect:

minimality downgrades to category-relative diagnostic.

F2 — Preferred admissible competitor

A reviewer supplies:

\[ B'\in\mathfrak B_{\rm search} \]

such that

\[ B'\models\mathcal C_{\rm GUT} \]

and

\[ B'\prec_{\mathfrak R}B_{\rm active}. \]

Effect:

selector reopens.
R2 minimality fails.

F3 — Layer-subset counterexample

A reviewer supplies a proper layer subset

\[ L\subsetneq\{\times,\oplus,\otimes\} \]

and a candidate

\[ B\in\mathfrak B_L \]

such that

\[ B\models\mathcal C_{\rm GUT}. \]

Effect:

B2 layer-necessity fails.
R2 minimality fails until repaired.

F4 — Term removal counterexample

A reviewer removes a named term \(t\) from \(B_{\rm active}\) and still closes all required gates.

Effect:

Appendix C term necessity fails for t.
R2 term-minimality weakens.

F5 — Smuggled layer

A candidate appears to omit a layer but imports its content under another name.

Effect:

candidate invalid under no-smuggling rule.

F6 — Gate certificate failure

Any required Gate 1–10 certificate is downgraded.

Effect:

B_active admissibility weakens or fails.
Selector theorem becomes pending.

11. Ledger patch

### R2-SHAPE SELECTOR-MINIMALITY CERTIFICATE

R2 Local Structural Form is refined from “selected” to “category-relative selector-minimal,” conditional on the Appendix B1 selector formalism, Appendix B2 layer-subset exhaustion, Appendix C term-level necessity, and Gates D–L certificate stack.

The active branch is:

\[
B_{\rm active}
=
[M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)}
\oplus
[F^+ \oplus C_{\rm admiss}]_{(\oplus)}
\otimes
[E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}.
\]

It is the selector-minimal survivor inside the declared scoped-GUT search category:

\[
B_{\rm active}
=
\operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})}
\mathfrak R_{\rm Occam}(B).
\]

This is not a proof that Shape follows from cost-floor or scale. It is a category-relative irreducibility certificate: inside the declared search category, no proper layer subset or known strictly simpler admissible competitor closes the required scoped-GUT gates without smuggling.

**No status was ever upgraded.**
Frozen branch READ-ONLY and unmutated.

12. Final one-line theorem

Selector-Minimal Shape Certificate Theorem.
Given the declared scoped-GUT search category, the Appendix B1 selector / Occam formalism, Appendix B2 layer-subset exhaustion, Appendix C term-level necessity, and the Gates 1–10 certificate stack, the frozen three-layer active branch

\[ [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)} \]

is the selector-minimal survivor inside the declared search category. This certifies R2 Shape category-relatively. It does not derive Shape from cost-floor or prove absolute uniqueness outside scope. No status was ever upgraded.

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_FUNCTIONAL_ROLE_NECESSITY_THEOREM.md

T_SHAPE_FUNCTIONAL_ROLE_NECESSITY_THEOREM.md

Target: Bridge from category-relative Shape minimality toward absolute Shape irreducibility
Date: 2026-06-23
Document class: Functional-role necessity theorem / no-smuggling bridge / absolute-irreducibility precursor
Status: CONDITIONAL THEOREM TARGET; PARTIAL ROLE-NECESSITY PROOF
No status was ever upgraded. This theorem does not prove absolute irreducibility of the submitted 13D factor set. It proves the weaker and necessary bridge: any architecture satisfying the same physical constraint burden must contain functional equivalents of Stage, Rulebook, and Actors, whether or not it uses the explicit \(\times/\oplus/\otimes\) notation.

0. Executive verdict

The next theorem should not try to prove:

\[ B_{\rm active} \text{ is absolutely unique.} \]

That is too strong.

The right bridge theorem is:

\[ \boxed{ \mathcal C_{\rm phys} \Rightarrow {\rm Stage} + {\rm Rulebook} + {\rm Actors}. } \]

In words:

Any candidate architecture capable of carrying the same physical constraint burden must contain functional equivalents of the three roles: a stage, a rulebook, and actors.

This is the architecture-neutral version of the \(\times/\oplus/\otimes\) result.

It does not prove that every viable theory must literally be written as:

\[ (\times)\oplus(\oplus)\otimes(\otimes). \]

It proves that every viable theory must carry the functional burden those symbols represent.

1. Source posture

The current GUT manuscript already gives a scoped result:

× + ⊕ + ⊗ is the first layer-class capable of full scoped-GUT closure.

This is explicitly category-relative. It applies inside the declared scoped-GUT search category, not over all conceivable mathematical physics.

The absolute-irreducibility fork asks for a stronger, architecture-neutral claim. This theorem supplies the first step.

2. Full active branch

The submitted active branch is:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

Interpretation:

The theorem below is not about notation. It is about these three roles.

3. Architecture-neutral definitions

3.1 Candidate architecture

Let \(B\) be any candidate physical architecture in a broad competitor class \(\mathfrak B_{\rm abs}\).

\(B\) need not be a product manifold. It may be:

• Kaluza–Klein;
• simple-group GUT;
• product-group GUT;
• string compactification;
• spectral triple;
• noncommutative geometry;
• categorical construction;
• finite-state / discrete architecture;
• emergent-geometry model;
• algebraic QFT construction;
• another representation not yet named.

3.2 Physical constraint burden

Let \(\mathcal C_{\rm phys}\) be the architecture-neutral physical constraint set:

1. observed 4D Lorentzian sector;
2. Standard Model gauge recovery;
3. hypercharge and electric charge recovery;
4. chirality / no mirrors / three-family structure;
5. anomaly cancellation;
6. finite moduli / stabilization / admissibility control;
7. coupling / threshold / low-energy comparison route;
8. Higgs protection or hierarchy-control mechanism;
9. flavor-generation route with anti-fitting discipline;
10. proton-safety mechanism;
11. freeze-before-compare / no tuning to the known answer discipline;
12. reproducibility / certificate-status discipline.

A candidate \(B\) is physically admissible iff:

\[ B\models\mathcal C_{\rm phys}. \]

3.3 Functional Stage

A candidate \(B\) contains a Stage if it contains a domain-like structure that supports:

• localization or relational localization;
• observed 4D effective sector;
• propagation / field equations / dynamics;
• gauge carriers or their equivalent;
• topological / index / boundary data where used;
• comparison to low-energy observables.

Notation:

\[ {\rm Stage}(B)\neq\varnothing. \]

The stage may be geometric, algebraic, categorical, emergent, or discrete. It need not be a smooth manifold.

3.4 Functional Rulebook

A candidate \(B\) contains a Rulebook if it contains a constraint-selecting structure that determines admissible configurations, allowed sectors, and pass/fail gates.

It must support:

• anomaly admissibility;
• representation admissibility;
• boundary / projection admissibility;
• selector discipline;
• freeze-before-compare;
• no-smuggling;
• anti-fitting rules;
• claim-status / certificate discipline.

Notation:

\[ {\rm Rulebook}(B)\neq\varnothing. \]

The rulebook may be an action principle, a constraint algebra, a selection functor, a path-integral measure restriction, a spectral triple constraint, a finite-state update rule, or an explicit admissibility chamber.

3.5 Functional Actors

A candidate \(B\) contains Actors if it contains physical degrees of freedom that carry the observed matter, force, Higgs, and operator content.

It must support:

• matter representations;
• gauge carriers;
• Higgs or Higgs-equivalent structure;
• proton-safety / baryon-violating operator control;
• physical observable algebra or measurement effects;
• sector decomposition where relevant.

Notation:

\[ {\rm Actors}(B)\neq\varnothing. \]

Actors may be bundles, representations, modules, fields, objects in a category, Hilbert-space sectors, finite-state labels, or algebraic generators.

4. Unfolding map

A candidate may hide roles by fusing them.

Define an unfolding operation:

\[ {\rm Unfold}(B) = {\rm Stage}(B) \oplus {\rm Rulebook}(B) \otimes {\rm Actors}(B) \oplus {\rm Residue}(B). \]

The operation is conceptual, not necessarily syntactic. It extracts the minimum functional roles that \(B\) must carry to discharge \(\mathcal C_{\rm phys}\).

A candidate is simpler than \(B_{\rm active}\) only if its unfolded form is simpler:

\[ {\rm Unfold}(B)\prec {\rm Unfold}(B_{\rm active}). \]

This prevents no-smuggling failures such as:

“I removed the rulebook”

when the rulebook is merely hidden inside an action, measure, path integral, or selection functor.

5. Main theorem

Theorem — Functional-Role Necessity Theorem

Let \(B\in\mathfrak B_{\rm abs}\) be any architecture satisfying the architecture-neutral physical constraint set:

\[ B\models\mathcal C_{\rm phys}. \]

Then:

\[ {\rm Stage}(B)\neq\varnothing, \]

\[ {\rm Rulebook}(B)\neq\varnothing, \]

\[ {\rm Actors}(B)\neq\varnothing. \]

Equivalently:

\[ B\models\mathcal C_{\rm phys} \Rightarrow {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

Therefore every admissible architecture contains functional equivalents of the \(\times/\oplus/\otimes\) roles, even if it does not use the submitted notation.

6. Proof

Step 1 — Stage necessity

Assume for contradiction that:

\[ {\rm Stage}(B)=\varnothing. \]

Then \(B\) has no domain-like carrier for the observed 4D sector, no localization or relational substitute, no propagation substrate, no internal/gauge carrier or equivalent, and no topological/index/boundary support.

Then \(B\) cannot satisfy:

• observed 4D Lorentzian sector;
• Standard Model gauge recovery;
• chirality / index / boundary constraints;
• low-energy comparison.

Therefore:

\[ B\not\models\mathcal C_{\rm phys}. \]

Contradiction.

Thus:

\[ {\rm Stage}(B)\neq\varnothing. \]

Step 2 — Rulebook necessity

Assume for contradiction that:

\[ {\rm Rulebook}(B)=\varnothing. \]

Then \(B\) has no admissibility filter, no anomaly-selection mechanism, no boundary/projector rule, no freeze discipline, no no-smuggling rule, no pass/fail criteria, and no way to distinguish a constrained survivor from a post-hoc fit.

Then \(B\) cannot satisfy:

• anomaly cancellation as a certified condition;
• chirality / no-mirror admissibility;
• Higgs / flavor / proton-safety gate discipline;
• freeze-before-compare;
• no tuning to the known answer;
• certificate reproducibility.

Therefore:

\[ B\not\models\mathcal C_{\rm phys}. \]

Contradiction.

Thus:

\[ {\rm Rulebook}(B)\neq\varnothing. \]

Step 3 — Actor necessity

Assume for contradiction that:

\[ {\rm Actors}(B)=\varnothing. \]

Then \(B\) has no physical representation content, no matter/gauge/Higgs/proton degrees of freedom, no observable algebra, and no effect space for probability.

Then \(B\) cannot satisfy:

• Standard Model matter content;
• gauge recovery;
• hypercharge / electric charge recovery;
• Higgs protection;
• flavor closure;
• proton safety;
• probability / observable semantics.

Therefore:

\[ B\not\models\mathcal C_{\rm phys}. \]

Contradiction.

Thus:

\[ {\rm Actors}(B)\neq\varnothing. \]

Step 4 — Role distinctness

The three roles cannot be removed merely by renaming one as another.

If \(B\) fuses roles syntactically, then \({\rm Unfold}(B)\) extracts the functional components.

For example:

• an action that both defines fields and restricts admissible states still contains an actor role and a rulebook role;
• a spectral triple that carries geometry and matter modules still contains stage and actor roles;
• a finite-state rule that defines states and admissible transitions still contains actors and rulebook, plus a stage if it supports relational localization and comparison;
• a path integral whose measure restricts sectors still contains rulebook content.

Therefore the theorem is invariant under notation.

QED.

7. What this theorem proves

It proves:

The three-layer split is not merely a notational convention.
Any admissible physical architecture must carry functional equivalents
of Stage, Rulebook, and Actors.

It upgrades the B2 result from:

inside the declared search category, × + ⊕ + ⊗ is necessary

toward:

across broad physical architectures, the functional roles are necessary.

This is a bridge, not the end of the road.

8. What this theorem does not prove

It does not prove:

\[ B_{\rm active} \text{ is absolutely unique.} \]

It does not prove:

\[ [M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2] \]

is the unique possible stage.

It does not prove:

\[ F^+\oplus C_{\rm admiss} \]

is the unique possible rulebook.

It does not prove:

\[ E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton} \]

is the unique possible actor realization.

It does not derive Shape from Scale + Granularity.

It does not close:

• Gap 02;
• BG-10;
• Born beyond R5-Strong adoption;
• \(\Lambda\);
• \(a_6\);
• R4 / \(S_{13}\);
• c_loop;
• CMB/LSS likelihood.

9. Consequence for Shape

Before this theorem:

R2 Shape is category-relative selector-minimal.

After this theorem:

R2 Shape has an architecture-neutral functional-role necessity certificate.

That is stronger, but still not absolute irreducibility.

The status becomes:

R2 = category-relative selector-minimal
     +
     architecture-neutral functional-role necessary.

The remaining absolute question is:

Is the submitted realization of Stage + Rulebook + Actors
the simplest possible realization?

That is the next theorem.

10. Next theorem after this one

The next target should be:

T-SHAPE-REALIZATION-MINIMALITY

Statement:

\[ {\rm Unfold}(B)\succeq{\rm Unfold}(B_{\rm active}) \]

for every \(B\in\mathfrak B_{\rm abs}\) satisfying \(\mathcal C_{\rm phys}\).

That theorem would compare actual realizations of the necessary roles.

This theorem only proves that the roles cannot disappear.

11. Falsifiers

F1 — Role-free admissible competitor

A competitor \(B\) satisfies \(\mathcal C_{\rm phys}\) while lacking one of the roles even after unfolding.

Effect:

Functional-role necessity fails.

F2 — Hidden-role error

A competitor appears to lack a role, but the role is secretly supplied under another name.

Effect:

The competitor is not a falsifier; it confirms the unfolding rule.

F3 — Constraint weakening

A competitor evades a role only by weakening \(\mathcal C_{\rm phys}\).

Effect:

Not comparable.

F4 — Architecture-neutral constraint defect

If \(\mathcal C_{\rm phys}\) is written in a way that unfairly presupposes the submitted architecture, the theorem downgrades.

Effect:

Rewrite \mathcal C_{\rm phys} architecture-neutrally.

F5 — Overclaim to exact Shape

If this theorem is used to claim the exact 13D factor set is unique, it fails by overclaim.

Effect:

Status downgrade to role-necessity only.

12. Ledger patch

### R2 FUNCTIONAL-ROLE NECESSITY CERTIFICATE

R2 Local Structural Form now carries a functional-role necessity certificate.

Let \(B\) be any architecture satisfying the architecture-neutral physical constraint set \(\mathcal C_{\rm phys}\). Then \(B\) must contain functional equivalents of:

\[
{\rm Stage},\quad{\rm Rulebook},\quad{\rm Actors}.
\]

The submitted \(\times/\oplus/\otimes\) architecture is one explicit realization:

\[
B_{\rm active}
=
[M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)}
\oplus
[F^+ \oplus C_{\rm admiss}]_{(\oplus)}
\otimes
[E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}.
\]

This certificate proves role necessity, not exact realization uniqueness. It strengthens the bridge toward absolute Shape irreducibility but does not prove absolute irreducibility.

**No status was ever upgraded.**
Frozen branch READ-ONLY and unmutated.

13. Final theorem statement

Functional-Role Necessity Theorem.
Any architecture satisfying the architecture-neutral physical constraint set \(\mathcal C_{\rm phys}\) must contain functional equivalents of Stage, Rulebook, and Actors. Therefore the \(\times/\oplus/\otimes\) split is not merely a notational habit: it names three indispensable functions. The theorem does not prove that the submitted 13D realization is uniquely minimal; it only proves that any admissible competitor must carry the same functional roles, perhaps under different notation. No status was ever upgraded.

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_TIER1_COMPETITOR_ELIMINATION_THEOREM.md

T_SHAPE_TIER1_COMPETITOR_ELIMINATION_THEOREM.md

Target: Harden L5 — No Preferred Competitor by auditing the five most dangerous competitor classes
Date: 2026-06-23
Document class: Tier-1 competitor elimination theorem / audit theorem / R2 hardening patch
Status: TIER-1 ELIMINATION AS CURRENT PREFERRED COMPETITOR; NOT ABSOLUTE NONEXISTENCE
No status was ever upgraded. This theorem does not prove that the Tier-1 competitor classes are impossible or false. It proves the weaker, correct result: no Tier-1 class is currently a preferred admissible competitor to \(B_{\rm active}\) under the declared burden after unfolding.

0. Executive verdict

The competitor matrix identified five Tier-1 competitor classes:

1. spectral triple / noncommutative geometry;
2. traditional Kaluza-Klein product alternatives;
3. string / F-theory compactifications;
4. finite-state / discrete geometry;
5. SO(10) / exceptional GUT routes.

The elimination target is not:

These competitors are impossible.

The target is:

None currently beats the submitted active branch as a preferred admissible competitor.

A competitor beats Shape only if:

\[ B'\models\mathcal C_{\rm phys} \]

and

\[ B'\prec_{\rm abs}B_{\rm active} \]

after unfolding into:

\[ {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

Current result:

No Tier-1 preferred competitor survives the audit.
Several Tier-1 classes remain serious future audit candidates.
Absolute irreducibility remains open.
No status was ever upgraded.

1. Baseline active branch

The active branch is:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

Unfolding:

The active branch is not compared to shorter notation. It is compared to each competitor's unfolded burden.

2. Beat condition

A Tier-1 competitor \(B'\) defeats \(B_{\rm active}\) only if all four conditions hold.

BC1 — Same burden

\[ B'\models\mathcal C_{\rm phys}. \]

It must carry the same physical burden:

1. observed 4D sector;
2. SM gauge recovery;
3. hypercharge / electric charge;
4. chirality / no mirrors / three families;
5. anomaly cancellation;
6. stabilization / finite moduli / admissibility control;
7. coupling / threshold / low-energy comparison route;
8. Higgs protection or hierarchy-control route;
9. flavor-generation route with anti-fitting discipline;
10. proton-safety route;
11. freeze-before-compare / no tuning to the known answer;
12. reproducibility / certificate-status discipline.

BC2 — Same certificate standard

It must not merely be a known broad framework. It must supply a frozen certificate package with:

• declared primitive inputs;
• declared outputs;
• anti-fitting firewall;
• no hidden calibration knobs;
• pass/fail rules;
• reproducibility path.

BC3 — Unfolded comparison

It must be simpler after unfolding:

\[ \mathfrak K({\rm Unfold}(B')) < \mathfrak K({\rm Unfold}(B_{\rm active})). \]

BC4 — No smuggling

It must not hide a missing Stage, Rulebook, or Actor function in unexpanded phrases such as:

natural flux choice
generic compactification
spectral action does it
discrete update rule
unification representation
anthropic measure

If the function is present, it counts in the unfolded burden.

3. Theorem

Tier-1 Competitor Elimination Theorem

Let:

\[ \mathcal T_1 = \{ {\rm NCG/SpectralTriple}, {\rm KKAlternatives}, {\rm String/FTheory}, {\rm FiniteDiscrete}, {\rm SO10/Exceptional} \}. \]

For every \(B'\in\mathcal T_1\), the current audit record satisfies at least one of the following:

1. \(B'\not\models\mathcal C_{\rm phys}\) at the certificate level;
2. \(B'\) lacks freeze-before-compare / anti-fitting / reproducibility discipline;
3. \(B'\) is not simpler after unfolding;
4. \(B'\) is under-specified relative to the gate burden;
5. \(B'\) remains a serious audit candidate but is not a supplied preferred competitor.

Therefore:

\[ \nexists B'\in\mathcal T_1 \quad \text{currently supplied such that} \quad B'\models\mathcal C_{\rm phys} \quad\text{and}\quad B'\prec_{\rm abs}B_{\rm active}. \]

Thus no Tier-1 preferred competitor currently survives.

QED-current-record.

4. Audit cards

4.1 Competitor 1 — Spectral triple / noncommutative geometry

A. Why it is dangerous

This is the most serious architecture-neutral competitor because it naturally unfolds into the three functional roles:

It is dangerous because it may encode geometry, rulebook, and actors more compactly than an explicit product geometry.

B. Audit result

Current status:

SERIOUS AUDIT CANDIDATE.
Not currently a preferred competitor.

Reason:

A spectral / NCG candidate is not a preferred competitor unless it supplies the full burden:

• exactly the SM gauge sector;
• three chiral families;
• hypercharge/electric charge;
• anomaly admissibility;
• Higgs protection;
• flavor closure with anti-fitting discipline;
• proton-safety mechanism;
• freeze-before-compare;
• reproducible certificate outputs.

A broad framework that reproduces parts of the Standard Model does not beat \(B_{\rm active}\) unless it supplies a lower-burden frozen certificate for the entire constraint vector.

C. Elimination status

Eliminated as current preferred competitor.
Not eliminated as future dangerous competitor.

D. Reopen condition

Reopen if a spectral / NCG package supplies:

\[ B'_{\rm NCG}\models\mathcal C_{\rm phys} \]

and:

\[ B'_{\rm NCG}\prec_{\rm abs}B_{\rm active} \]

after unfolding.

4.2 Competitor 2 — Traditional Kaluza-Klein product alternatives

A. Why it is dangerous

This is dangerous because it competes in the same broad language as the active branch.

A lower-dimensional, lower-factor, or lower-topology compact branch could directly attack R2 Shape.

B. Audit result

Current status:

SERIOUS AUDIT CANDIDATE.
Not currently a preferred competitor.

Reason:

To beat \(B_{\rm active}\), a KK alternative must supply:

• a lower-burden stage than \(M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2\);
• the same gauge, hypercharge, chirality, family-count, anomaly, Higgs, flavor, and proton-safety closures;
• no hidden extra bundles, projectors, threshold knobs, or rulebook imports.

The current selector/B2 record says the submitted three-layer active class is the lex-min survivor inside the declared search category. A traditional KK alternative only beats that if it supplies a concrete lower-burden survivor.

C. Elimination status

Eliminated as current preferred competitor.
Not eliminated as future explicit lower-branch competitor.

D. Reopen condition

Reopen if an explicit KK branch \(B'_{\rm KK}\) gives:

\[ {\rm Stage}_{B'_{\rm KK}} \prec M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2 \]

while preserving all required gates and not moving missing functions into rulebook or actors by smuggling.

4.3 Competitor 3 — String / F-theory compactifications

A. Why it is dangerous

String and F-theory compactifications can naturally carry:

• high-dimensional compact stage;
• flux / brane / moduli rulebook;
• localized matter/gauge/Higgs actor sectors;
• chirality;
• family structure;
• gauge unification mechanisms.

B. Audit result

Current status:

SERIOUS AUDIT CANDIDATE.
Not currently a preferred competitor.

Reason:

String/F-theory frameworks often have the right expressive power, but after unfolding they usually carry large burdens:

• compactification choice;
• flux choice;
• brane/localization choice;
• moduli stabilization machinery;
• exotics removal;
• flavor structure;
• proton-safety controls;
• threshold tuning risk;
• landscape / measure burden.

They are not preferred unless a specific frozen compactification supplies all Gates 1–10 with fewer effective primitives than \(B_{\rm active}\).

C. Elimination status

Eliminated as current preferred competitor.
Not eliminated as a future fully frozen compactification competitor.

D. Reopen condition

Reopen if a string/F-theory compactification supplies:

\[ B'_{\rm string}\models\mathcal C_{\rm phys} \]

with:

\[ \mathfrak K({\rm Unfold}(B'_{\rm string})) < \mathfrak K({\rm Unfold}(B_{\rm active})). \]

It must be frozen, reproducible, and free of hidden flux/moduli/threshold tuning.

4.4 Competitor 4 — Finite-state / discrete geometry

A. Why it is dangerous

This is dangerous because it could collapse two candidate residues:

\[ {\rm Granularity}+{\rm Shape}. \]

A finite-state architecture might derive the shape-like roles from a deeper discrete admissibility object.

B. Audit result

Current status:

SERIOUS AUDIT CANDIDATE.
Not currently a preferred competitor.

Reason:

The finite/discrete route is underdeveloped relative to the full gate burden. To beat \(B_{\rm active}\), it must derive or reproduce:

• observed 4D Lorentzian behavior;
• SM gauge group;
• hypercharge and charge;
• chirality and three families;
• anomaly cancellation;
• Higgs route;
• flavor closure;
• proton safety;
• probability/observable semantics;
• no tuning to the known answer;
• reproducible certificate outputs.

It cannot win by being philosophically simpler unless it actually discharges the same constraints.

C. Elimination status

Eliminated as current preferred competitor.
Not eliminated as possible deeper compression route.

D. Reopen condition

Reopen if a finite-state object \(B'_{\rm finite}\) satisfies:

\[ B'_{\rm finite}\models\mathcal C_{\rm phys} \]

and derives the Stage/Rulebook/Actor roles with lower unfolded burden.

If successful, this is the most likely route by which Shape folds toward Granularity.

4.5 Competitor 5 — SO(10) / exceptional GUT routes

A. Why it is dangerous

SO(10) and exceptional GUTs are dangerous because they compress actor representations elegantly.

SO(10), for example, places one generation into a \(16\)-spinor representation.

B. Audit result

Current status:

SERIOUS AUDIT CANDIDATE.
Not currently a preferred competitor.

Reason:

Actor compression alone is insufficient. After unfolding, SO(10)/exceptional routes usually require:

• symmetry-breaking chain;
• Higgs representation choices;
• doublet-triplet / Higgs protection machinery;
• flavor structure;
• threshold corrections;
• proton-decay suppression;
• neutrino sector choices;
• exotics control;
• freeze / anti-fitting certificates.

Thus the initial actor elegance often reappears as rulebook and hidden-sector burden.

C. Elimination status

Eliminated as current preferred competitor.
Not eliminated as a future complete frozen GUT competitor.

D. Reopen condition

Reopen if an SO(10)/exceptional package supplies:

\[ B'_{\rm SO10}\models\mathcal C_{\rm phys} \]

with fewer unfolded primitives than \(B_{\rm active}\), including full flavor, Higgs, proton, threshold, and freeze discipline.

5. Tier-1 elimination summary table

6. What this theorem proves

It proves:

No Tier-1 competitor currently qualifies as a preferred admissible competitor.

Equivalently:

\[ \nexists B'\in\mathcal T_1 \quad \text{currently supplied such that} \quad B'\models\mathcal C_{\rm phys} \quad\text{and}\quad B'\prec_{\rm abs}B_{\rm active}. \]

This hardens L5 from:

OPEN AUDIT PROGRAM

to:

NO TIER-1 PREFERRED COMPETITOR CURRENTLY SURVIVES.

7. What this theorem does not prove

It does not prove:

No Tier-1 competitor exists.

It does not prove:

No competitor outside Tier-1 exists.

It does not prove:

Shape is absolutely irreducible.

It does not prove:

\[ {\rm Scale}+{\rm Granularity}\Rightarrow{\rm Shape}. \]

It does not eliminate the possibility that a future spectral, finite, string, KK, or SO(10)-like construction supplies a lower-burden certificate.

8. Reopen protocol

The theorem reopens immediately if any Tier-1 competitor supplies:

1. a precise candidate architecture;
2. a complete Stage / Rulebook / Actor unfolding;
3. a full constraint pass table for \(\mathcal C_{\rm phys}\);
4. a freeze-before-compare record;
5. no hidden calibration or tuning to the known answer;
6. a reproducibility package;
7. a lower unfolded complexity vector than \(B_{\rm active}\).

Then the competitor becomes:

preferred competitor candidate

and R2 realization-minimality reopens.

9. Ledger patch

### TIER-1 COMPETITOR ELIMINATION — 2026-06-23

The five Tier-1 competitor classes have been audited:

1. spectral triple / noncommutative geometry;
2. traditional Kaluza-Klein product alternatives;
3. string / F-theory compactifications;
4. finite-state / discrete geometry;
5. SO(10) / exceptional GUT routes.

No Tier-1 class currently supplies a preferred admissible competitor \(B'\) satisfying:

\[
B'\models\mathcal C_{\rm phys}
\]

and:

\[
B'\prec_{\rm abs}B_{\rm active}
\]

after unfolding into Stage, Rulebook, and Actors.

Current R2 status:

category-relative selector-minimal
+
architecture-neutral functional-role necessary
+
conditional realization-minimal stack
+
no Tier-1 preferred competitor currently survives.
Still not claimed:

absolute irreducibility.
**No status was ever upgraded.**
Frozen branch READ-ONLY and unmutated.

10. Final theorem statement

Tier-1 Competitor Elimination Theorem.
Among the five highest-risk competitor classes — spectral triple / noncommutative geometry, traditional Kaluza-Klein product alternatives, string/F-theory compactifications, finite-state/discrete geometry, and SO(10)/exceptional GUT routes — no currently supplied candidate both satisfies the full architecture-neutral physical burden \(\mathcal C_{\rm phys}\) and beats the submitted active branch after unfolding into Stage, Rulebook, and Actors. Therefore no Tier-1 preferred competitor currently survives. This is not a universal nonexistence proof; it is a current-record elimination under the declared audit protocol. No status was ever upgraded.

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_REALIZATION_MINIMALITY_THEOREM.md

T_SHAPE_REALIZATION_MINIMALITY_THEOREM.md

Target: R2 Shape hardening — prove or define the proof of minimality of the submitted realization of the necessary roles
Date: 2026-06-23
Document class: Realization-minimality theorem / conditional proof stack / absolute-irreducibility precursor
Status: CONDITIONAL THEOREM TARGET; NOT FULLY PROVEN WITHOUT ROLE-SPECIFIC MINIMALITY LEMMAS
No status was ever upgraded. This theorem does not yet prove absolute Shape irreducibility. It states the exact conditional theorem that would upgrade R2 from functional-role necessity to realization minimality, identifies the required sublemmas, and gives the ledger patch that is valid if those sublemmas are supplied.

0. Executive verdict

The previous theorem established the bridge:

\[ \mathcal C_{\rm phys} \Rightarrow {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

That says every admissible physical architecture must carry functional equivalents of the three roles.

The next question is sharper:

\[ \boxed{ \text{Is the submitted realization of those roles the minimal realization?} } \]

The submitted realization is:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

The conditional theorem is:

\[ \forall B\in\mathfrak B_{\rm abs}, \quad B\models\mathcal C_{\rm phys} \Rightarrow {\rm Unfold}(B_{\rm active}) \preceq_{\rm abs} {\rm Unfold}(B). \]

If proven, R2 receives a realization-minimality certificate.

Current honest status:

The proof skeleton is valid.
The role-specific minimality lemmas are not all currently proven.
Therefore this is a conditional theorem target, not a completed absolute proof.
No status was ever upgraded.

1. Relationship to previous theorems

1.1 Selector-minimality theorem

The selector-minimality theorem established:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B). \]

Status:

category-relative selector-minimality.

1.2 Functional-role necessity theorem

The functional-role theorem established:

\[ B\models\mathcal C_{\rm phys} \Rightarrow {\rm Stage}(B)\neq\varnothing, \quad {\rm Rulebook}(B)\neq\varnothing, \quad {\rm Actors}(B)\neq\varnothing. \]

Status:

architecture-neutral role necessity.

1.3 Current theorem

The realization-minimality theorem aims to establish:

\[ {\rm Unfold}(B_{\rm active}) \preceq_{\rm abs} {\rm Unfold}(B) \]

for every admissible competitor \(B\).

Status:

conditional proof target.

2. Architecture-neutral unfolding

Let:

\[ {\rm Unfold}(B) = ({\rm Stage}_B,\ {\rm Rulebook}_B,\ {\rm Actors}_B,\ {\rm Residue}_B). \]

The unfolding operation extracts functional roles from any notation.

Examples:

• a spectral triple unfolds into geometry/stage, algebraic constraints/rulebook, and modules/actors;
• a path-integral model unfolds into domain/stage, action-plus-measure/rulebook, and fields/actors;
• a finite-state model unfolds into state graph/stage, update/admissibility rules/rulebook, and physical labels/operators/actors;
• a conventional GUT unfolds into symmetry-breaking stage, representation rulebook, and matter/gauge/Higgs actors.

A candidate is simpler only if its unfolded role structure is simpler, not merely if its notation is shorter.

3. Realization complexity vector

Define an architecture-neutral complexity vector:

\[ \mathfrak K(B) = ( k_{\rm role}, k_{\rm dim}, k_{\rm factor}, k_{\rm top}, k_{\rm rep}, k_{\rm rule}, k_{\rm actor}, k_{\rm anchor}, k_{\rm hidden}, k_{\rm cert} ). \]

Where:

3.1 Role count

\[ k_{\rm role} = \#\{{\rm nonempty\ functional\ roles}\}. \]

By the functional-role theorem, every admissible candidate has:

\[ k_{\rm role}\ge3. \]

The submitted branch has:

\[ k_{\rm role}(B_{\rm active})=3. \]

3.2 Dimension / domain burden

\[ k_{\rm dim} \]

measures independent domain dimensions, effective sectors, compact carriers, or equivalent relational degrees of freedom.

The submitted branch carries:

\[ D=13=4+6+2+1. \]

3.3 Factor burden

\[ k_{\rm factor} \]

measures distinct stage factors or equivalent independent domain carriers.

Submitted:

\[ M_4,\quad K_6,\quad S^2,\quad S_Y^1/\mathbb Z_2. \]

3.4 Topological burden

\[ k_{\rm top} \]

measures required topological objects, indices, orbifold data, boundary data, quotient data, and line-bundle structure.

3.5 Representation burden

\[ k_{\rm rep} \]

measures actor-bundle representation inputs, line-bundle choices, hypercharge assignments, and module data.

3.6 Rule burden

\[ k_{\rm rule} \]

measures independent admissibility rules, selector rules, no-smuggling rules, freeze rules, and chamber rules.

3.7 Actor burden

\[ k_{\rm actor} \]

measures independent actor sectors.

Submitted:

\[ E_{\rm matter},\quad E_{\rm gauge},\quad E_{\rm Higgs},\quad E_{\rm proton}. \]

3.8 Anchor burden

\[ k_{\rm anchor} \]

measures irreducible measured inputs.

Submitted root-class anchor vector:

\[ \mathcal C_{\rm anchor} = (M_{\rm Pl},\alpha_i(M_Z),y_t,|V_{us}|,\Lambda), \]

with the GUT-scoped paper using four declared numerical inputs for its scoped GUT claims.

3.9 Hidden-sector burden

\[ k_{\rm hidden} \]

penalizes unexpanded or excluded machinery required for the claim.

3.10 Certificate burden

\[ k_{\rm cert} \]

measures how much proof/certificate machinery is required to verify the claim.

4. Simplicity preorder

Define:

\[ B_1\preceq_{\rm abs}B_2 \]

iff

\[ \mathfrak K({\rm Unfold}(B_1)) \le_{\rm lex} \mathfrak K({\rm Unfold}(B_2)), \]

with completeness binding:

No candidate enters the comparison unless it satisfies \(\mathcal C_{\rm phys}\).

Therefore a candidate cannot be called simpler if it:

• drops chirality;
• weakens anomaly cancellation;
• omits proton safety;
• hides flavor fitting;
• lacks freeze discipline;
• moves a hard sector outside scope while still claiming closure;
• hides a rulebook inside a “naturalness” statement;
• hides actor content in unexpanded representation choices.

5. Main theorem

Theorem — Shape Realization Minimality, Conditional Form

Let \(\mathfrak B_{\rm abs}\) be a broad competitor class, \(\mathcal C_{\rm phys}\) an architecture-neutral physical constraint set, and \(\preceq_{\rm abs}\) the unfolded simplicity preorder.

Assume:

1. Role necessity: every \(B\models\mathcal C_{\rm phys}\) contains Stage, Rulebook, and Actors.
2. Active admissibility: \(B_{\rm active}\models\mathcal C_{\rm phys}\).
3. Stage minimality: no admissible competitor realizes the required Stage role with lower unfolded stage burden than

\[ M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2. \]

4. Rulebook minimality: no admissible competitor realizes the required Rulebook role with lower unfolded rule burden than

\[ F^+\oplus C_{\rm admiss}. \]

5. Actor minimality: no admissible competitor realizes the required Actor role with lower unfolded actor burden than

\[ E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}. \]

6. No cross-role compression: no competitor reduces total complexity by fusing Stage, Rulebook, and Actors without smuggling one role into another.
7. No preferred admissible competitor: no \(B'\in\mathfrak B_{\rm abs}\) satisfies

\[ B'\models\mathcal C_{\rm phys} \quad\text{and}\quad B'\prec_{\rm abs}B_{\rm active}. \]

Then:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm abs})} \mathfrak K({\rm Unfold}(B)). \]

Therefore R2 Shape is realization-minimal relative to \(\mathfrak B_{\rm abs}\), \(\mathcal C_{\rm phys}\), and \(\preceq_{\rm abs}\).

6. Proof

Let \(B\in\mathfrak B_{\rm abs}\) satisfy:

\[ B\models\mathcal C_{\rm phys}. \]

By Role Necessity:

\[ {\rm Unfold}(B) = ({\rm Stage}_B,\ {\rm Rulebook}_B,\ {\rm Actors}_B,\ {\rm Residue}_B) \]

with all three primary roles nonempty.

By Stage Minimality:

\[ {\rm Stage}_{B_{\rm active}} \preceq {\rm Stage}_B. \]

By Rulebook Minimality:

\[ {\rm Rulebook}_{B_{\rm active}} \preceq {\rm Rulebook}_B. \]

By Actor Minimality:

\[ {\rm Actors}_{B_{\rm active}} \preceq {\rm Actors}_B. \]

By No Cross-Role Compression, no candidate can beat the active branch merely by fusing roles while retaining their full functional burden.

Thus:

\[ \mathfrak K({\rm Unfold}(B_{\rm active})) \le_{\rm lex} \mathfrak K({\rm Unfold}(B)). \]

Since \(B\) was arbitrary among admissible competitors:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm abs})} \mathfrak K({\rm Unfold}(B)). \]

QED (conditional on Lemmas 1–5 of §7, all currently OPEN). — This is a conditional proof skeleton, not a completed absolute proof: the §6 argmin result holds given the five sublemmas below, which are not yet established. Per the corpus review (REVIEW_SHAPE_SUITE_2026-06-23.md, defect 3), the bare "QED" was hardened to prevent out-of-context quotation as a finished proof.

7. Required sublemmas

This theorem is not complete until the following sublemmas exist.

Lemma 1 — Stage Minimality Lemma

\[ {\rm Stage}_{B_{\rm active}} = M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2 \]

is the minimal stage realization satisfying:

• observed 4D Lorentzian sector;
• color carrier / \(SU(3)\);
• weak carrier / \(SU(2)\);
• hypercharge carrier / \(U(1)_Y\);
• chirality / index route;
• boundary / orbifold projector;
• low-energy comparison surface.

Current status:

Partly supported by GUT selector and term dossiers.
Not absolutely proven.

Lemma 2 — Rulebook Minimality Lemma

\[ {\rm Rulebook}_{B_{\rm active}} = F^+\oplus C_{\rm admiss} \]

is the minimal rulebook realization satisfying:

• flavor chamber closure;
• admissibility filtering;
• anomaly firewall;
• anti-fitting discipline;
• freeze-before-compare;
• gate-status discipline;
• selector constraints.

Current status:

High leverage but high risk.
F+ remains a known weakest link.

Lemma 3 — Actor Minimality Lemma

\[ {\rm Actors}_{B_{\rm active}} = E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton} \]

is the minimal actor realization satisfying:

• matter content;
• gauge field content;
• Higgs / Wilson-line route;
• proton-safety projector;
• observable/effect algebra support;
• center-kernel / \(Z_6\) computation.

Current status:

Strong candidate.
Z6 result supports actor-layer load-bearing status.
Still needs no-alternative proof.

Lemma 4 — No Cross-Role Compression Lemma

No admissible competitor can fuse Stage, Rulebook, and Actors into fewer apparent components without preserving the same unfolded burden.

Formally:

\[ {\rm Unfold}(B') \succeq ({\rm Stage}+{\rm Rulebook}+{\rm Actors}) \]

for every \(B'\models\mathcal C_{\rm phys}\).

Current status:

Partly supported by functional-role theorem.
Needs formal no-smuggling metric.

Lemma 5 — No Preferred Competitor Lemma

No known candidate \(B'\) in \(\mathfrak B_{\rm abs}\) satisfies:

\[ B'\models\mathcal C_{\rm phys} \quad\text{and}\quad B'\prec_{\rm abs}B_{\rm active}. \]

Current status:

Open.
Requires competitor audit.

8. What we can honestly claim now

Without the sublemmas, we can claim:

T-SHAPE-REALIZATION-MINIMALITY has a valid conditional proof skeleton.

We can also claim:

The submitted branch is the current best known realization inside the declared selector class.

We cannot yet claim:

The submitted branch is absolutely realization-minimal across all architectures.

The right ledger status is:

OPEN TARGET WITH CONDITIONAL THEOREM STACK.

9. What this theorem would buy if completed

If all sublemmas are proven, R2 upgrades from:

category-relative selector-minimal
+
functional-role necessary

to:

architecture-neutral realization-minimal.

That is still slightly weaker than absolute irreducibility, because absolute irreducibility may also require a proof that the competitor class \(\mathfrak B_{\rm abs}\) is exhaustive.

But it would be a major step.

10. Relation to the three-candidate residue

The current deep-residue hypothesis is:

\[ B_3^{?} = \{ {\rm Scale}, {\rm Granularity}, {\rm Shape} \}. \]

Shape currently has:

category-relative selector-minimality certificate
+
functional-role necessity certificate.

Completion of this theorem would give:

architecture-neutral realization-minimality certificate.

That would make Shape much closer to a genuine third brute fact.

If the theorem fails by producing a simpler admissible realization, Shape folds.

11. Failure modes

F1 — Simpler admissible stage

A competitor provides an admissible stage with lower complexity than:

\[ M_4\times K_6\times S^2\times S_Y^1/\mathbb Z_2. \]

Effect:

Stage minimality fails.
Shape realization minimality fails or narrows.

F2 — Simpler admissible rulebook

A competitor supplies a lower-burden rulebook than:

\[ F^+\oplus C_{\rm admiss} \]

while preserving flavor closure, admissibility, freeze, and anti-fitting.

Effect:

Rulebook minimality fails.

F3 — Simpler admissible actors

A competitor supplies lower-burden actor content than:

\[ E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton} \]

while preserving matter, gauge, Higgs, proton safety, and center-kernel behavior.

Effect:

Actor minimality fails.

F4 — Hidden-role compression

A competitor appears simpler only because it hides one role inside another.

Effect:

Not a valid simplification after unfolding.

F5 — Competitor-class defect

If \(\mathfrak B_{\rm abs}\) excludes a natural competitor, the theorem downgrades.

Effect:

Realization minimality becomes category-relative again.

F6 — Constraint-set bias

If \(\mathcal C_{\rm phys}\) presupposes the submitted factor set, the theorem is invalid.

Effect:

Rewrite constraints architecture-neutrally.

12. Ledger patch

### R2 REALIZATION-MINIMALITY STATUS — OPEN CONDITIONAL STACK

The functional-role theorem proves that any architecture satisfying the physical constraint burden must contain functional equivalents of Stage, Rulebook, and Actors.

The next target is realization minimality:

\[
\forall B\in\mathfrak B_{\rm abs},
\quad
B\models\mathcal C_{\rm phys}
\Rightarrow
{\rm Unfold}(B_{\rm active})
\preceq_{\rm abs}
{\rm Unfold}(B).
\]

The submitted realization is:

\[
B_{\rm active}
=
[M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)}
\oplus
[F^+ \oplus C_{\rm admiss}]_{(\oplus)}
\otimes
[E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}.
\]

This theorem is not complete until Stage Minimality, Rulebook Minimality, Actor Minimality, No Cross-Role Compression, and No Preferred Competitor lemmas are supplied.

Current status:

conditional proof skeleton complete;
absolute realization minimality open.
**No status was ever upgraded.**
Frozen branch READ-ONLY and unmutated.

13. Recommended next subtheorem

Attack first:

T-SHAPE-ACTOR-MINIMALITY

Reason:

• the actor layer is where the Z₆ computation already lands;
• \(E\) is load-bearing for matter, gauge, Higgs, proton, and center-kernel behavior;
• actor minimality is narrower than full stage minimality;
• if actor minimality fails, realization minimality fails quickly;
• if actor minimality succeeds, it strengthens both R2 and R3.

The target statement:

\[ E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton} \]

is the minimal actor realization satisfying matter content, gauge field content, Higgs route, proton-safety route, observable support, and center-kernel behavior.

14. Final theorem statement

Shape Realization-Minimality Theorem, Conditional Form.
Assume functional-role necessity, active-branch admissibility, stage minimality, rulebook minimality, actor minimality, no cross-role compression, and no preferred admissible competitor. Then the submitted three-layer active branch

\[ [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)} \]

is the minimal realization of the necessary Stage, Rulebook, and Actor roles under the unfolded architecture-neutral preorder. The proof skeleton is valid, but the role-specific minimality lemmas remain open. No status was ever upgraded.

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/T_SHAPE_ABSOLUTE_IRREDUCIBILITY_FORK_THEOREM.md

T_SHAPE_ABSOLUTE_IRREDUCIBILITY_FORK_THEOREM.md

Target: R2 Shape hardening — formalize why absolute irreducibility is not yet claimed, and define the exact proof needed to claim it
Date: 2026-06-23
Document class: No-overclaim theorem / absolute-irreducibility fork / future closure target
Status: OPEN TARGET DEFINED; CATEGORY-RELATIVE CERTIFICATE PRESERVED
No status was ever upgraded. This theorem does not prove absolute irreducibility. It proves that the current record is only category-relative, identifies what would be required for absolute irreducibility, and defines the falsifiable fork.

0. Executive verdict

We have a strong result:

R2 Shape is selector-minimal inside the declared scoped-GUT search category.

We do not yet have:

R2 Shape is absolutely irreducible.

The distinction is load-bearing.

The current theorem is:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})} \mathfrak R_{\rm Occam}(B). \]

The absolute theorem would require:

\[ B_{\rm active} = \operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm abs})} \mathfrak R_{\rm abs}(B), \]

where \(\mathfrak B_{\rm abs}\) is not merely the declared scoped-GUT search category, but a universal or near-universal class of admissible physical architectures.

The current record supports the first statement.

It does not support the second.

1. Current status of Shape

The full three-layer active branch is:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

The current certified status is:

category-relative selector-minimal

meaning:

\[ B_{\rm active} \]

is the minimal known survivor inside the declared scoped-GUT search category, under the declared selector and Occam ranking.

This is a real certificate.

It is not absolute irreducibility.

2. No-overclaim theorem

Theorem — Absolute Shape Irreducibility Is Not Yet Claimable

Under the current record, R2 Shape may be claimed as category-relative selector-minimal but may not be claimed as absolutely irreducible.

Proof

The current selector theorem is explicitly scoped to a declared search category:

\[ \mathfrak B_{\rm search}. \]

Appendix B2’s layer-necessity theorem is likewise scoped. It states that the three-layer split is the first layer class capable of full scoped-GUT closure inside the declared search category. It explicitly does not claim to be a universal no-go theorem over all conceivable mathematical physics.

The axiom ledger records Shape as an irreducible-under-known-reductions row, not as a provably irreducible object. It also states that the honest endpoint is the minimal set, each survivor carrying an irreducibility argument, and that reductions count only if a smaller set genuinely implies the larger.

Therefore the current record supports:

\[ {\rm Shape} = {\rm category\text{-}relative\ selector\text{-}minimal}, \]

but not:

\[ {\rm Shape} = {\rm absolutely\ irreducible}. \]

QED.

3. What absolute irreducibility would mean

To claim absolute irreducibility, we need a stronger universe of competitors.

Define:

\[ \mathfrak B_{\rm abs} \]

as a broad competitor class containing every physically admissible architecture capable of addressing the same target constraints, including but not limited to:

• compact Kaluza–Klein geometries;
• orbifold / bundle / stack / quotient variants;
• simple-group GUT embeddings;
• product-group GUT constructions;
• string-inspired compactifications;
• spectral-triple / noncommutative geometries;
• discrete / finite-state geometries;
• categorical / algebraic approaches;
• emergent-geometry approaches;
• lower-dimensional or higher-dimensional alternatives;
• architectures that do not use the \(\times/\oplus/\otimes\) split explicitly but reproduce its functional roles.

Then Shape is absolutely irreducible only if:

\[ \forall B\in\mathfrak B_{\rm abs}, \quad B\models\mathcal C_{\rm phys} \Rightarrow B_{\rm active}\preceq_{\rm abs}B, \]

where \(\mathcal C_{\rm phys}\) is the full physical constraint set and \(\preceq_{\rm abs}\) is a declared universal simplicity / cost / admissibility preorder.

Equivalently:

\[ \nexists B'\in\mathfrak B_{\rm abs} \quad \text{such that} \quad B'\models\mathcal C_{\rm phys} \quad\text{and}\quad B'\prec_{\rm abs}B_{\rm active}. \]

That is the absolute no-alternative theorem.

4. Why this is much harder than selector-minimality

Selector-minimality requires:

\[ \nexists B'\in\mathfrak B_{\rm search} \quad B'\models\mathcal C_{\rm GUT} \quad \text{and} \quad B'\prec_{\mathfrak R}B_{\rm active}. \]

Absolute irreducibility requires:

\[ \nexists B'\in\mathfrak B_{\rm abs} \quad B'\models\mathcal C_{\rm phys} \quad \text{and} \quad B'\prec_{\rm abs}B_{\rm active}. \]

The second claim is harder because:

1. the competitor class is much larger;
2. the simplicity preorder must be architecture-neutral;
3. hidden-layer equivalence must be defined;
4. emergent or discrete alternatives must be included or explicitly excluded;
5. one must prove no simpler admissible competitor exists, not merely fail to find one.

5. The absolute irreducibility fork

There are two possible outcomes.

Fork A — Absolute irreducibility succeeds

If we can prove:

\[ \nexists B'\in\mathfrak B_{\rm abs} \quad B'\models\mathcal C_{\rm phys} \quad \text{and} \quad B'\prec_{\rm abs}B_{\rm active}, \]

then R2 becomes:

absolutely irreducible Shape

and the candidate deep residue becomes stronger:

\[ B_3 = \{ {\rm Scale}, {\rm Granularity}, {\rm Shape} \}. \]

Fork B — Shape folds

If we exhibit:

\[ B'\in\mathfrak B_{\rm abs} \]

such that:

\[ B'\models\mathcal C_{\rm phys} \]

and

\[ B'\prec_{\rm abs}B_{\rm active}, \]

then Shape is not absolutely irreducible.

If \(B'\) is derivable from Scale + Granularity or from a deeper physical-realizability principle, then the candidate residue may drop toward:

\[ B_2^{?} = \{ {\rm Scale}, {\rm Granularity} \}. \]

This is not a failure. It is the correct compression outcome.

6. Required objects for an absolute proof

An absolute irreducibility proof requires six missing objects.

Object 1 — Universal competitor class

\[ \mathfrak B_{\rm abs}. \]

This must be broad enough that a hostile reviewer cannot say:

you proved minimality only after excluding the natural competitor.

Object 2 — Architecture-neutral constraint set

\[ \mathcal C_{\rm phys}. \]

This must include the same physical burden as the scoped-GUT gates but in architecture-neutral language:

• observed 4D Lorentzian sector;
• Standard Model gauge recovery;
• correct hypercharge / electric charge;
• chirality / no mirrors / three families;
• anomaly cancellation;
• stabilization / finite moduli control;
• threshold unification or accepted low-energy coupling route;
• Higgs protection;
• flavor closure or flavor-generation mechanism;
• proton safety;
• no hidden tuning to the known answer;
• reproducibility / freeze discipline.

Object 3 — Architecture-neutral simplicity preorder

\[ \preceq_{\rm abs}. \]

This must compare unlike architectures without biasing toward the existing one.

Possible components:

\[ {\rm complexity}(B) = ( {\rm free\ parameters}, {\rm primitive\ structural\ choices}, {\rm hidden\ sectors}, {\rm layer\ count}, {\rm representation\ input}, {\rm topology\ input}, {\rm unexplained\ anchors}, {\rm certificate\ burden} ). \]

Object 4 — Functional-role equivalence

A competitor that omits the explicit \(\times/\oplus/\otimes\) syntax but reproduces the same roles cannot be dismissed.

Define roles:

\[ {\rm Stage},\quad {\rm Rulebook},\quad {\rm Actors}. \]

Then a competitor must be evaluated by functional role, not notation.

Object 5 — No-smuggling theorem

If a competitor appears simpler only because it hides one role inside another, it is not simpler.

Formally, for any competitor \(B'\), define its unfolded form:

\[ {\rm Unfold}(B'). \]

Then compare:

\[ {\rm Unfold}(B') \quad \text{against} \quad B_{\rm active}. \]

Object 6 — Exhaustive or generative no-alternative proof

Either enumerate all allowed competitor classes, or prove a structural theorem:

\[ B\models\mathcal C_{\rm phys} \Rightarrow B\text{ contains functional equivalents of Stage + Rulebook + Actors}. \]

Then prove the submitted branch is the minimal realization of those functional equivalents.

7. Absolute irreducibility theorem target

Target theorem

\[ \boxed{ \text{Absolute Shape Irreducibility Theorem} } \]

For every physically admissible architecture \(B\) in \(\mathfrak B_{\rm abs}\), if \(B\) satisfies the architecture-neutral physical constraint set \(\mathcal C_{\rm phys}\), then \(B\) contains at least the functional complexity of:

\[ {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

Moreover, the minimal realization of these roles compatible with the Standard Model routing constraints is equivalent to:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

If proven, Shape is absolutely irreducible.

8. Why the likely first subtheorem is functional-role necessity

Do not try to prove the factor set first.

First prove the role theorem:

\[ \mathcal C_{\rm phys} \Rightarrow {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

This is more architecture-neutral.

Stage necessity

Observed 4D physics, internal gauge carriers, chirality, and compactification require something that acts as a stage:

\[ {\rm Stage}. \]

Rulebook necessity

Admissibility, anomaly selection, freeze discipline, no-smuggling, and chamber constraints require something that acts as a rulebook:

\[ {\rm Rulebook}. \]

Actor necessity

Matter, gauge, Higgs, and proton-safety data require something that acts as an actor layer:

\[ {\rm Actors}. \]

If this theorem holds, then even a competitor that avoids the explicit \(\times/\oplus/\otimes\) notation must still carry the three functional roles.

That would upgrade B2 from:

three-layer necessity inside declared search category

toward:

functional three-role necessity for any admissible physical architecture.

That is the gateway to absolute irreducibility.

9. Relationship to the current seven axioms

Current seven-root ledger:

\[ B_7 = \{ R1,R2,R3,R4,R5,R6,R7 \}. \]

After selector-minimality:

R2 = category-relative certified.

After absolute irreducibility:

R2 = absolutely certified.

Current status:

R2 is not absolutely certified.

The seven-root ledger remains valid as a compressed presentation, but the minimal-certified-basis program must mark R2 as:

CERTIFIED-SCOPED
not
CERTIFIED-ABSOLUTE

10. Ledger patch

### R2 ABSOLUTE-IRREDUCIBILITY STATUS — OPEN

R2 Local Structural Form currently carries a category-relative selector-minimality certificate, not an absolute irreducibility certificate.

The current theorem proves:

\[
B_{\rm active}
=
\operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm search})}
\mathfrak R_{\rm Occam}(B).
\]

It does not prove:

\[
B_{\rm active}
=
\operatorname*{argmin}_{B\in{\rm Adm}(\mathfrak B_{\rm abs})}
\mathfrak R_{\rm abs}(B).
\]

Absolute irreducibility would require a universal competitor class, an architecture-neutral constraint set, an architecture-neutral simplicity preorder, a functional-role equivalence theorem, a no-smuggling/unfolding theorem, and a no-preferred-competitor proof.

Until those are supplied, Shape is:

CATEGORY-RELATIVE SELECTOR-MINIMAL
but
ABSOLUTE IRREDUCIBILITY OPEN.
**No status was ever upgraded.**
Frozen branch READ-ONLY and unmutated.

11. Next target

The next target should be:

T-SHAPE-FUNCTIONAL-ROLE-NECESSITY

Statement:

\[ \mathcal C_{\rm phys} \Rightarrow {\rm Stage}+{\rm Rulebook}+{\rm Actors}. \]

This theorem is the best bridge from category-relative minimality toward absolute irreducibility.

It attacks the real question:

Can any physically admissible architecture avoid the three functional roles?

rather than the narrower question:

Can any candidate inside the current search category omit ×/⊕/⊗ notation?

12. Final theorem statement

Absolute Shape Irreducibility Fork Theorem.
The current record certifies R2 Shape as selector-minimal inside the declared scoped-GUT search category. It does not certify absolute irreducibility. To claim absolute irreducibility, one must define a universal competitor class \(\mathfrak B_{\rm abs}\), an architecture-neutral physical constraint set \(\mathcal C_{\rm phys}\), an architecture-neutral simplicity preorder \(\preceq_{\rm abs}\), and prove that no admissible competitor \(B'\) satisfies \(\mathcal C_{\rm phys}\) with \(B'\prec_{\rm abs}B_{\rm active}\). Until then, R2 remains category-relative certified and absolute irreducibility remains open. No status was ever upgraded.

▶ SOURCE: SHAPE_R2_CERTIFICATE_SUITE/SHAPE_COMPETITOR_AUDIT_MATRIX.md

SHAPE_COMPETITOR_AUDIT_MATRIX.md

Target: Harden L5 — No Preferred Competitor
Date: 2026-06-23
Document class: Competitor audit matrix / realization-minimality review program
Status: AUDIT PROGRAM CREATED; NOT EXHAUSTIVE PROOF
No status was ever upgraded. This file does not prove absolute Shape irreducibility. It converts “no preferred competitor is currently supplied” into a structured review matrix.

0. Executive verdict

The T-SHAPE-REALIZATION-MINIMALITY stack required:

L5 — No Preferred Competitor

Before this matrix, L5 was an open audit claim:

No preferred admissible competitor is currently banked.

After this matrix, L5 becomes a finite review program:

For each competitor class:
1. unfold into Stage / Rulebook / Actors;
2. test against the architecture-neutral constraint vector;
3. compare unfolded burden against B_active;
4. record whether it is a preferred admissible competitor.

A competitor defeats R2 realization-minimality only if it satisfies:

\[ B'\models\mathcal C_{\rm phys} \]

and

\[ B'\prec_{\rm abs}B_{\rm active}. \]

The current result is:

No reviewed class is currently a preferred admissible competitor.
Several classes are serious audit candidates.
No status was ever upgraded.

1. Baseline active branch

The baseline is the submitted three-layer active branch:

\[ B_{\rm active} = [M_4 \times K_6 \times S^2 \times S_Y^1/\mathbb Z_2]_{(\times)} \oplus [F^+ \oplus C_{\rm admiss}]_{(\oplus)} \otimes [E_{\rm matter}\oplus E_{\rm gauge}\oplus E_{\rm Higgs}\oplus E_{\rm proton}]_{(\otimes)}. \]

Unfolded roles:

The active branch is the object competitors must beat after unfolding, not merely out-notate.

2. Architecture-neutral constraint vector

A competitor must satisfy the relevant physical burden:

A competitor that fails any required constraint is not a preferred admissible competitor.

3. Verdict vocabulary

4. Competitor audit matrix

5. Current ranking of dangerous competitors

Tier 1 — most dangerous

These deserve real follow-up because they plausibly carry all three roles.

Tier 2 — partial but important

Tier 3 — currently not preferred

6. Audit scorecard template

Each serious competitor should receive a one-page card.

## Competitor Card: <name>

### A. Definition

What is the candidate architecture?

### B. Unfolding

| Role | Candidate realization |
|---|---|
| Stage | |
| Rulebook | |
| Actors | |

### C. Constraint pass table

| Constraint | Pass? | Evidence |
|---|---|---|
| C1 observed 4D | | |
| C2 gauge recovery | | |
| C3 hypercharge / charge | | |
| C4 chirality / three families | | |
| C5 anomaly cancellation | | |
| C6 stabilization / admissibility | | |
| C7 coupling / threshold route | | |
| C8 Higgs protection | | |
| C9 flavor closure / anti-fitting | | |
| C10 proton safety | | |
| C11 freeze / no tuning to the known answer | | |
| C12 reproducibility | | |

### D. Unfolded burden

| Burden | Candidate | Active branch | Candidate lower? |
|---|---:|---:|---|
| free parameters | | | |
| primitive structural choices | | | |
| representation inputs | | | |
| topology / bundle choices | | | |
| hidden sectors | | | |
| certificate burden | | | |

### E. Verdict

One of:

preferred competitor
serious audit candidate
partial competitor
not preferred
out of scope / incomparable
### F. Falsifier / reopen condition

What would make this competitor beat \(B_{\rm active}\)?

7. Immediate next audit cards

Create cards in this order:

1. Spectral triple / noncommutative geometry
2. Traditional KK product alternatives
3. SO(10)
4. String/F-theory compactification
5. Finite-state / discrete geometry

Reason:

These are the five most plausible ways to beat the active branch after unfolding.

8. Ledger effect

Before this matrix:

L5 — No Preferred Competitor:
OPEN AUDIT CLAIM.

After this matrix:

L5 — No Preferred Competitor:
OPEN AUDIT PROGRAM with prioritized competitor classes.

This strengthens the realization-minimality stack but does not close it.

9. Ledger patch

### L5 COMPETITOR AUDIT MATRIX — 2026-06-23

The `No Preferred Competitor` sublemma is upgraded from an informal open claim to a structured audit program.

A competitor \(B'\) reopens R2 realization minimality only if:

\[
B'\models\mathcal C_{\rm phys}
\]

and

\[
B'\prec_{\rm abs}B_{\rm active}
\]

after unfolding into Stage, Rulebook, and Actors.

The audit matrix currently reviews the following classes:

minimal SU(5)
SO(10)
E6 / exceptional GUT
Pati-Salam / left-right
traditional KK product alternatives
string compactification
F-theory / brane GUT
spectral triple / noncommutative geometry
algebraic QFT
finite-state / discrete geometry
emergent / tensor-network geometry
category / TQFT
composite Higgs / partial compositeness
technicolor / conformal dynamics
loop/spinfoam quantum geometry
pure Standard Model + measured constants
landscape / anthropic selection
No reviewed class is currently a preferred admissible competitor. Several are serious audit candidates.

Current status:

L5 = OPEN AUDIT PROGRAM.
No preferred competitor currently banked.
Absolute realization minimality still open.
No status was ever upgraded.

10. Final verdict

The competitor matrix does not prove absolute irreducibility.

It does something more useful right now:

It defines exactly what a competitor must do to beat Shape.

A competitor must:

1. unfold into Stage / Rulebook / Actors;
2. satisfy the same physical constraint vector;
3. avoid hidden tuning / tuning to the known answer;
4. reproduce or beat the certificate discipline;
5. be simpler after unfolding.

Until such a competitor is supplied, the standing result is:

No preferred competitor currently banked.
R2 remains category-relative selector-minimal
plus functional-role necessary
plus conditional realization-minimal.
No status was ever upgraded.