Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

The prism triangulation has the stated oriented boundary

Statement

Fix n≥0. Let ι0,ι1:Δn→Δn×I be the bottom and top inclusions, ιε(u)=(u,ε). Let Πn:=∑i=0n(−1)iλi∈Cn+1(Δn×I;Z), with the simplices λi from The prism operator of a homotopy. Then ∂Πn=ι1−ι0−∑j=0n(−1)j(δj×id⁡I)#Πn−1, where the last sum is omitted when n=0.

Facts & Assumptions

Given: An integer n≥0.

[L1]

The prism simplices λi are the simplices of the standard triangulation of Δn×I (The prism operator of a homotopy).

[L2]

The singular boundary is the alternating sum of the codimension-one faces (The singular boundary operator).

Proof

technique · direct
1.1L1L2given

If n=0, then Π0=λ0 is the oriented edge from (v0,0) to (v0,1), so [L2] gives ∂Π0=ι1−ι0. This is exactly the displayed formula with no side-prism sum.

1.2L1L2given

Assume n≥1. By [L2], each ∂λi is the alternating sum of its n+2 codimension-one faces. The face opposite (v0,0) in λ0=[(v0,0),(v0,1),…,(vn,1)] is the top face ι1, and the face opposite (vn,1) in λn=[(v0,0),…,(vn,0),(vn,1)] is the bottom face ι0. For each 1≤i≤n, the face of λi opposite (vi,0) is the same n-simplex as the face of λi−1 opposite (vi−1,1), so these interior faces occur twice in ∑i=0n(−1)i∂λi with opposite total signs and cancel.

2.1step 1.1step 1.2L1L2algebra∎

The remaining uncancelled faces are the top face ι1 from λ0, the bottom face −ι0 from λn, and the side faces obtained by deleting one vertex vj of Δn. For each fixed j, those side faces are exactly the prism simplices in the standard triangulation of δj(Δn−1)×I, and comparing the induced vertex order with the definition of Πn−1 gives the total contribution −(−1)j(δj×id⁡I)#Πn−1. Summing over j and combining with steps 1.1 and 1.2 yields the stated boundary formula.

Depends on

Used by

Dependency tree · two levels

5 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