Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

R boundaries embed in r cycles

Statement

For every filtered chain complex, Bp,qr⊆Zp,qr for all p,q∈Z and r≥0.

Facts & Assumptions

Given: A filtered chain complex and integers p,q with r≥0.

[F1]

The numerator is Ap,nr and the denominator is the displayed sum of lower approximate cycles and differential images (R cycles and r boundaries of an increasingly filtered complex).

Proof

technique · direct
1.1F1algebra

For r=0, the assertion is Fp−1Cn⊆FpCn. For r≥1, Ap−1,nr−1⊆Fp−1Cn⊆FpCn and its differential lies in F(p−1)−(r−1)Cn−1=Fp−rCn−1. It therefore factors through Ap,nr.

2.1F1step 1.1algebra∎

For the other summand, d(Ap+r−1,n+1r−1)⊆FpCn, and applying dn to it gives zero since dndn+1=0. It too lies in Ap,nr. The sum lies there by the least-upper-bound property of the image sum in [F1]. This proves the assertion for every r, including r=1.

Source notes

Weibel, Chapter 5, Construction 5.4.6 and Lemma 5.4.7, pp.133–134; Sharifi, Theorem 4.2.3, pp.91–92. Increasing homological indices are used here.

Depends on

Dependency tree · 2 levels

Sources