Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Oriented simplicial subdivision commutes with boundary

Statement

The oriented subdivision operator on integral augmented chains satisfies S=S. Restriction to ordinary chains is also a chain map.

Source locators

2.1, pp.121–122.

Facts & Assumptions

[F1]

Subdivision is given by the augmented cone recursion. Oriented simplicial subdivision operator.

[F2]

The cone on the maximal face satisfies the contraction identity. An augmented simplicial cone has an explicit chain contraction.

[F3]

The simplicial boundary squares to zero. The simplicial boundary squares to zero.

Proof

Given: The augmented recursion S(s)=cσS(s) and S1=1.

1.1

For a vertex v, S[v]=[{v}]=1=S[v]. The degree 1 equation is zero on each side. On an edge [a,b], the formula is S[a,b]=[ab,b][ab,a]=[a,ab][b,ab], abbreviating singleton face labels by their vertices and {a,b} by ab. Its boundary is [b][a]=S[a,b].

F1
2.1

Assume boundary compatibility through degree n1. In the cone sdσ the contraction identity gives S(s)=cσS(s)=S(s)cσS(s)=S(s)cσS(2s)=S(s). For the augmented boundary square at a one-simplex, ε([b][a])=0; in higher degrees use the boundary-square theorem. Induction proves the identity in every degree. Geometrically the cone terms on boundary-of-boundary faces cancel, exactly accounting for internal faces. Setting the degree-zero ordinary boundary to zero preserves the identity on ordinary chains.

F1F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources