Pith. sign in
module module moderate

IndisputableMonolith.Gravity.SevenGaps.RegulatorRemovalNoGo

show as:
view Lean formalization →

Finite-group infrastructure for the full relabeling gauge group on exact-complexity shells at signature (v, e, t): independent permutations of vertices, edges, and tetrahedra. It supplies orbit-cardinality, torsor, and Burnside-style counting lemmas used when attacking naive removal of the Gaussian UV regulator. Downstream signature-blocker and continuum-cutoff modules import this algebra. Content is group actions and finite counting, not analytic estimates.

claimAt fixed signature $(v,e,t)$, the relabeling gauge group is $S_v\times S_e\times S_t$, acting by independent permutations of the vertex, edge, and tetrahedron index sets on exact complexes and $\sigma$-configurations. The module records the induced actions, the orbit/torsor equivalences, and the identity that the sum of orbit cardinalities equals the Burnside count of labeled configurations in each exact shell.

background

In the Seven Gaps gravity stack, path-sum configuration space is organized into exact complexity shells (no size caps in the shell definition). The parent module ExactShellGaugeUV proves that the shell-resummed path sum with Gaussian UV weight $\exp(-\rho\cdot n^2)$ converges for every regulator strength $\rho>0$.

Configurations at a combinatorial signature $(v,e,t)$ still carry a large discrete redundancy: one may independently permute vertex, edge, and tetrahedron labels. The full relabeling gauge group is the product of the three symmetric groups on those index sets. Quotienting by this action is the natural route from labeled complexes to gauge-invariant path-sum weights.

This module packages that group, its action on exact complexes and $\sigma$-data, and the elementary finite-group facts (orbit cards, torsor equivalences, summed-orbit identities) needed before any asymptotic or continuum argument about removing $\rho$ or a complexity cutoff.

proof idea

Definition-heavy module with standard finite-group lemmas, not a single deep theorem.

It introduces the relabel triple (the product of three symmetric groups), the action maps on exact complexes and on $\sigma$-configurations, and extensionality lemmas for those actions. From there it builds the relabeling equivalence on $\sigma$-data, finiteness of the exact-relabel type, and a torsor equivalence relating stabilizers to orbits.

Orbit cardinality and the summed-card identities are then elementary consequences: counting orbits via the group order and relating the sum of orbit sizes to the Burnside-weighted count of labeled shells. No analytic estimates or regulator limits are proved here; the module stops at exact combinatorial equalities.

why it matters in Recognition Science

Regulator removal and continuum limits in the Seven Gaps program cannot be honest without controlling gauge redundancy on each exact shell. This module is the shared algebraic substrate for those attacks.

It is imported by the Gap-2 signature-blocker attack, whose doc-comment records that uniform single-signature mass concentration for large shells is refuted as an asymptotic strategy under the banked Burnside identity. The orbit-sum lemmas here are exactly the counting input to that diagnosis.

It is also imported by the phased-quotient continuum blocker (P2-a), which isolates the Cauchy criterion for removing the complexity cutoff from the phased quotient path sum. Gauge-fixed shell counts enter any comparison of finite quotient sums along a cutoff sequence.

Within the broader RS gravity story, this sits downstream of exact-shell UV regularization and upstream of no-go or stall results on taking $\rho\to 0$ or sending cutoffs to infinity without additional structure.

scope and limits

used by (2)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (29)