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.

Derived composition isomorphisms under total acyclicity

Statement

In the Grothendieck setup, with its supplied-data/choice conventions, fix A. If RqF(A)=0 for every q>0, then the lower edge gives RnG(F(A))Rn(GF)(A). If every RqF(A), including q=0, is G-acyclic, then the upper edge gives Rn(GF)(A)G(RnF(A)). These isomorphisms hold for n0 and are natural on inputs satisfying the relevant vanishing conditions.

Facts & Assumptions

Given: The Grothendieck hypotheses and one of the two vanishing conditions above.

[F1]

The Grothendieck page is E2p,q=RpG(RqF(A)) with finite normalized filtration and the stated canonical edges (Grothendieck spectral sequence).

[F2]

G-acyclicity means vanishing in every positive derived degree (G-acyclic object for a left-exact functor).

Proof

1.1

Under the first condition all rows q>0 vanish, leaving E2p,0=RpG(F(A)). Under the second condition F2 makes every column p>0 vanish, leaving E20,q=G(RqF(A)). The qualification including q=0 is needed to kill entries E2p,0 with p>0. In either case every differential dr for r2 has zero source or target because it changes both coordinates. The same support is preserved on taking homology, hence E2=E.

F1F2
2.1

The first case has one possible degree-n quotient at filtration index n; the zero preceding quotients identify its filtration subobject with all of Hn. The second case has its sole quotient at index zero; the zero later quotients force F1Hn=0. The normalized endpoints in F1 therefore identify the respective edges with the displayed isomorphisms. At n=0 both reduce to GF(A), and if the sole quotient is zero the target is zero by the same finite argument. Naturality follows by restricting F1 to morphisms between inputs obeying the conditions.

F1step 1.1

Depends on

Used by

Dependency tree · two levels

15 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