Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Short exact two open cover small singular chain sequence

Statement

Let X=UV with U,V open. Let CU,V(X;R) be the span of simplices whose image lies in U or V. There is a short exact sequence of real chain complexes 0C(UV;R)iC(U;R)C(V;R)jCU,V(X;R)0, where i(c)=(c,c) and j(a,b)=a+b. This choice of i is the negative of the ordinary AT convention.

Facts & Assumptions

Given: The ordered open cover (U,V) of X; all chains have real coefficients.

[F1]

Chains use a supplied basis of simplices and the signed face differential (Real singular chain complex).

[F2]

The ordinary coefficient-chain sequence uses i(c)=(c,c) and j(a,b)=a+b (Short exact chain Mayer–Vietoris sequence).

Proof

1.1

Regard chains in U, V, and UV as chains in X by their basis inclusions: a map with image in a subspace has a unique corestriction, continuous by the subspace topology. A face of a small simplex remains small. Hence these spaces and the span CU,V are subcomplexes, and both displayed arrows commute with boundary. The sign choice equals [F2] precomposed by id on the overlap.

givenF1F2
2.1

The map i is injective since its second component is c. To split a finite small chain, assign a simplex to the U component whenever its image lies in U, and otherwise to V. This formula gives a preimage under j, proving surjectivity without choosing from an arbitrary family.

F1step 1.1
3.1

If a+b=0, coefficient comparison in the supplied X basis forces coefficients of a outside the overlap to vanish, and likewise for b. Thus b=a is an overlap chain, and (a,b)=i(b). Conversely ji(c)=c+c=0. These prove equality of kernel and image. If an open set or overlap is empty the same argument gives the appropriate zero term; when U=V=X it is the diagonal signed sequence. In negative degrees all terms are zero, and degree zero uses the same basis argument with zero differential. Constant simplices remain generators, and no AC is used.

F1step 1.1step 2.1algebra

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