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

Grothendieck collapse when one functor is exact

Statement

Assume the Grothendieck hypotheses and supplied-data/choice conventions. If F is exact, then RnG(F(A))Rn(GF)(A). If G is exact, then Rn(GF)(A)G(RnF(A)). Both are natural edge isomorphisms for every n0. In the first alternative the hypothesis that F sends injectives to G-acyclics is still required.

Facts & Assumptions

Given: The Grothendieck setup and either stated exactness hypothesis.

[F1]

The second page, finite target filtration and canonical edges are those of the Grothendieck theorem (Grothendieck spectral sequence).

[F2]

Exact functors have zero positive relative derived objects (An exact functor has vanishing positive derived functors).

[F3]

Collapse at Es means dr=0 at every bidegree for every rs, so Es identifies with the stable page (Collapse at a page).

Proof

1.1

If F is exact, F2 makes RqF(A)=0 for q>0. Thus F1 is supported on q=0 and E2p,0=RpG(F(A)). If G is exact, F2 instead makes RpG(RqF(A))=0 for p>0, leaving E20,q=G(RqF(A)). In either alternative, a differential of bidegree (r,1r) with r2 cannot have both source and target on that one axis. All such differentials vanish, and repeated page homology preserves this support, proving collapse in the sense of F3.

F1F2F3
2.1

In degree n the first alternative has only the quotient at (n,0), so all preceding filtration quotients vanish and FnHn=Hn, with Fn+1Hn=0. Its lower edge is therefore the first claimed isomorphism. The second alternative has only (0,n); all positive filtration pieces are zero, so its upper edge is the second claimed isomorphism. Naturality comes from the edge maps in F1. For n=0 these are the identification with GF(A); if both functors are exact the positive targets are zero. No splitting or additional choice is used.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

19 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