IndisputableMonolith.Foundation.PrimitiveRecognitionCalculus.CubicalChainComplex
Defines a two-step cubical chain complex C₂ → C₁ → C₀ in which the composition of successive boundary maps vanishes. Supplies the algebraic skeleton (boundary pairs, two-face certificates, finite ledger square-zero) used by later cubical and delta-native modules. Arguments are mostly direct algebraic identities and list inductions on face data from multi-distinction geometry.
claimA two-step chain complex of types $C_2 \xrightarrow{\partial_2} C_1 \xrightarrow{\partial_1} C_0$ is equipped so that $\partial_1 \circ \partial_2 = 0$. Concrete realizations include ambient two-face squares, certified two-face ledgers, and finite lists of faces, each satisfying the square-zero identity for the cubical boundary.
background
Primitive Recognition Calculus builds discrete geometry from multi-distinction data: faces, edges, and vertices assembled cubically rather than simplicially. The imported MultiDistinctionGeometry layer supplies the ambient face and edge types that sit in degrees 2, 1, and 0.
A chain complex here is the classical algebraic requirement that boundary after boundary is zero. The module packages that requirement as boundary pairs (a pair of maps with a square-zero witness), two-face certificates (finite certified face data whose signed boundary squares to zero), and a headline statement that the cubical complex is indeed a complex.
Notation follows the usual grading: $C_2$ holds 2-faces (squares), $C_1$ holds edges, $C_0$ holds vertices. The cubical boundary counts opposite edges with opposite signs, so opposite contributions cancel when the boundary is applied twice.
proof idea
This is primarily a definition-and-certificate module. Boundary pairs and two-face certificates are introduced as structures carrying the two maps and the identity $\partial^2=0$. Square-zero lemmas for ambient two-faces, single certificates, lists of certificates, and finite ledgers are proved by direct expansion of the cubical boundary formula and cancellation of opposite edge contributions, with list cases by induction. The headline theorem assembles these instances into the two-step complex statement.
why it matters in Recognition Science
Square-zero is the minimal coherence needed before higher cubical and delta-native constructions can treat discrete recognition ledgers as chain complexes. Downstream, AllDimensionalCubicalBoundary imports this module to extend the boundary beyond the two-step case; DeltaNativeAnalysis and DeltaNativeStrongClosure rely on it when analyzing native delta operators and their strong closure properties on cubical data.
In the Recognition Science foundation stack this sits under Primitive Recognition Calculus: it turns multi-distinction geometry into graded algebraic data with a verified differential. That is the bridge from combinatorial face incidence to homology-style invariants used later in the forcing and ledger layers. It does not itself force dimension or the eight-tick octave; it only guarantees that the cubical differential squares to zero so those later arguments have a clean complex to work on.
scope and limits
- Does not construct homology groups or prove vanishing of $H_n$ for $n>0$.
- Does not treat simplicial or singular complexes; only cubical two-step data.
- Does not force spatial dimension $D=3$ or the eight-tick period.
- Does not define higher coboundaries or cochain duals.
- Does not claim infinite or continuous geometric realization.