Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A filtered quasi isomorphism detected on associated graded complexes

Example

Let k=Z/2 and take C1=ka, C0=kbkc, da=b, with zero other degrees. Filter it by FpC=0 for p<0, F0C=kc[0] and FpC=C for p1. Give D=kc[0] the weight-zero filtration, zero for p<0 and full for p0. The projection f:CD killing a,b and fixing c is a filtered quasi-isomorphism detected on associated-graded complexes.

Facts & Assumptions

[F1]

Quasi isomorphism criterion from a filtered map proves that a map of degreewise finite filtered complexes which is a quasi-isomorphism on each graded complex is a quasi-isomorphism.

[F2]

Abelian-group model for spectral-sequence computations supplies k, finite coordinate groups and ordinary subgroup homology quotients.

Verification

Given: The two filtered complexes and the explicit projection in the example.

1.1

The differential squares to zero since the group below degree zero vanishes. The sole intermediate piece kc[0] is a subcomplex, so the filtration on C is by subcomplexes. The projection is a chain map: f(da)=f(b)=0=d(f(a)), and it preserves the specified pieces, including the zero lower tail and full upper tail. Both filtrations are finite in every degree, with the common bounds minus one and one.

F2
1.2

On gr0 the map is the identity kc[0]kc[0], hence an isomorphism on its sole homology group. On gr1, the source is kaabkb and the target is zero, because F1D=F0D. The source has zero kernel in degree one and zero cokernel in degree zero, so the graded map is again a quasi-isomorphism. Every other graded complex is zero on both sides. Therefore all hypotheses of the finite branch of [F1] hold.

F1F2
2.1

Apply [F1] to conclude that f is a quasi-isomorphism. Directly, d:C1C0 is injective with image kb, giving H1(C)=0 and H0(C)=(kbkc)/kbkc via [xb+yc]yc. The induced map H0(f) is this same isomorphism, while all other homology maps are isomorphisms between zero groups. This checks the specific map rather than only the isomorphism type of the target. All coefficients, zero terms, filtration endpoints and one-dimensional graded pieces have been computed explicitly; no AC or splitting choice is required.

F1F2step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

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