IndisputableMonolith.Gravity.SevenGaps.Gap2PoissonCoarea
Defines tet-free, serially named cell complexes at a fixed cap B as the bare state space for the first C16 kill test in Gap 2. No automorphism, orbit, or gauge quotient is built in. Gravity measure work cites it as the combinatorial substrate on which posting moves, arrival counts, and erasure weights act. The module is definitional scaffolding: named types and bookkeeping lemmas, not a closed theorem.
claimAt cap $B$, the state space consists of tet-free serially named complexes (no Aut/orbit/gauge). On that space one tracks unused vertices, posted vertices and edges, LIFO unpost maxima, move rates, sort-respecting arrival counts, and order-erasure weights, with dimension bookkeeping $n_V$ and $n_E$ after each post.
background
Gap 2 in the gravity stack aims to fix the three free rates left by posting-plus-gluing. Upstream, Gap2JEhrhartSpan sets the route: define recognition cost $J$ of a letter from the ledger's imbalance structure and read rates off a census span test, after aggregate linearity by kind (FixedKindTotals) has already reduced the measure.
This module supplies the combinatorial arena for the C16 process-side test. A tet-free serially named complex at cap $B$ is a finite named cell complex with no tetrahedral cells and with serial naming of cells; the definition deliberately omits automorphism, orbit, and gauge structure so that discrimination can be stated on raw named data.
Sibling constructions record the LIFO posting dynamics on that space: which vertices remain unused, how vertices and edges are posted or unposted at the current maximum, the instantaneous move rate, sort-respecting arrival counts, and the order-erasure weight that will feed the Jacobian side of the measure.
proof idea
This is a definition module with supporting bookkeeping lemmas, not a single closed proof. It introduces the tet-free named-complex type and empty initial state, then defines the posting and unposting operations on vertices and edges, the move-rate and arrival-count functionals, and the order-erasure weight. Small lemmas relate posted vertex and edge counts to $n_V$ and $n_E$. No Aut quotient or gauge identification is proved or assumed here.
why it matters in Recognition Science
Downstream, Gap2MeasureDerivation assembles the measure-substrate blocker for the class mass of the Gibbs weight from the C4 erasure Jacobian and C17 fugacity elimination, naming the C16 LIFO process as the process-side discrimination premise. This module is the named state space on which that LIFO process runs.
In the Gap 2 chain it sits after the $J$-from-imbalance and Ehrhart-span setup and before the assembled measure derivation. It keeps the C16 kill test honest: rates and erasure weights are computed on bare tet-free named complexes, so any later gauge or orbit counting must be added explicitly rather than smuggled into the state type. It does not itself flip the measure flag; that remains deferred in the assembly module.
scope and limits
- Does not quotient by Aut, orbits, or gauge; state space is bare named complexes.
- Does not prove the C16 kill or fix the three posting rates.
- Does not derive the Gibbs class mass or flip the measure-substrate flag.
- Does not import or depend on FullTheoryLedger.
- Does not assert Poisson or coarea identities as theorems; it only stages the named complex substrate.
used by (1)
depends on (1)
declarations in this module (82)
-
structure
TetFree -
def
emptyTF -
def
vertexUnused -
def
postVertex -
def
unpostMaxVertex -
def
postEdge -
def
unpostMaxEdge -
def
moveRate -
def
sortRespectingArrivalCount -
def
orderErasureWeight -
theorem
postVertex_nV -
theorem
postEdge_nE -
theorem
unpostMaxEdge_nE -
theorem
postEdge_unpost_nE -
theorem
moveRate_symm_lifo_vertex -
theorem
moveRate_symm_lifo_edge -
def
uniformNamed -
theorem
uniform_detailed_balance_of_rate_symm -
theorem
moveRate_symm -
theorem
uniform_detailed_balance -
structure
Cap3Tally -
def
measuredCap3 -
theorem
measuredCap3_nStates -
theorem
measuredCap3_irreducible -
theorem
measuredCap3_symmetric -
theorem
measuredCap3_pi -
theorem
measuredCap3_small_ge -
theorem
measuredCap3_decoy -
theorem
measuredCap3_sj_decoy -
theorem
cap3_stationary_is_uniform -
def
pathPlusIsolated -
theorem
pathPlusIsolated_counts -
theorem
twoEdge_counts -
def
edgeCommOK -
def
twoEdgeEV -
def
pathPlusEV -
def
twoEdgeAutCount -
def
pathPlusAutCount -
theorem
twoEdge_autCount_eq_two -
theorem
pathPlus_autCount_eq_one -
def
inFibre -
def
twoEdgeFibre -
def
pathPlusFibre -
theorem
twoEdge_fibre_card -
theorem
pathPlus_fibre_card -
abbrev
NamedPi -
def
classMassPi -
def
uniformPi -
theorem
classMassPi_of_uniform -
def
classMassRatioPi -
def
UniformNamedPremise -
theorem
classMassRatioPi_of_uniform_eq_fibre_ratio -
theorem
classMassRatioPi_of_uniform_eq_half -
def
classMassRatio_420 -
theorem
classMassRatio_420_eq_half -
theorem
autInverseRatio_eq_half -
theorem
fibre_ratio_eq_aut_inverse_ratio -
def
SJ_twoEdge -
def
SJ_pathPlus -
theorem
SJ_twoEdge_rfl -
theorem
SJ_pathPlus_rfl -
def
predictedRatio_qSJ -
theorem
predictedRatio_qSJ_at_one -
theorem
predictedRatio_qSJ_at_two -
def
residualOverHalf -
theorem
residualOverHalf_eq_one -
theorem
deltaCounts_zero -
theorem
residual_family_silent -
theorem
arrivalCount_420 -
theorem
twoEdge_fibre_eq_orders_div_aut -
theorem
pathPlus_fibre_eq_orders_div_aut -
theorem
coarea_at_twoEdge -
theorem
coarea_at_pathPlus -
structure
PoissonCoareaIndex -
def
poissonCoareaIndex -
theorem
index_firewall -
theorem
index_cap3 -
theorem
index_ratio -
theorem
index_residual -
theorem
index_coarea