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

Five-term sequence of a composite functor

Example

For a fixed extension 1NGQ1, the composite-invariants five-term sequence is 0H1(Q,MN)infH1(G,M)resH1(N,M)Qd20,1H2(Q,MN)infH2(G,M). For N=G=C2, Q=1 and trivial coefficients M=Z, it becomes 00000Z/2. Thus even this specialization illustrates that the last term is not required to be the image of the preceding arrow.

Facts & Assumptions

Given: The LHS supplied-data and DC or supplied-comparison convention.

[F1]

The composite five-term sequence has terms R1T(FM), R1(TF)M, T(R1FM), R2T(FM) and R2(TF)M (Five-term exact sequence of the Grothendieck spectral sequence).

[F2]

For invariants these maps are inflation, restriction and transgression, with their resolution descriptions (Five-term exact sequence from LHS).

[F3]

Group cohomology is Ext of the trivial group-ring module, computable from a supplied projective resolution by balance (Group cohomology as a derived functor, Projective and injective constructions of Ext agree for supplied resolutions).

Verification

1.1

Substitute F=()N and T=()Q into F1. The five terms become, in order, H1(Q,MN), H1(G,M), H1(N,M)Q, H2(Q,MN) and H2(G,M). F2 identifies the first and last maps with its bottom-cycle inflation, the second with restriction of invariant cocycles, and the middle with d2 from (0,1) to (2,0). Hence every term and arrow agrees with F2, without importing a later cocycle-classification theorem.

F1F2
1.2

To compute the specialization let C2=s. Its trivial Z[C2]-module has the free resolution with augmentation and alternating differentials d1=s1, d2=1+s, d3=s1, continuing periodically. Indeed for a+bs, the kernel of s1 is Z(1+s) and the kernel of 1+s is Z(1s); these are the preceding images. The augmentation kernel is also Z(1s). Rank-one free terms are projective by lifting the image of their generator. Hom into trivial Z has successive differentials 0,2,0,2,. Thus F3 gives H1(C2,Z)=0 and H2(C2,Z)=Z/2.

F3construct
2.1

For Q=1, invariants are identity and the positive cohomology is zero by exactness of any supplied resolution. Consequently step 1.1 has four zero non-initial terms before its final Z/2, as claimed. All maps in that displayed finite portion are zero, its transgression is zero and exactness holds at every required position. There is no final surjectivity. The rank-one periodic calculation itself is choice-free; only the common resolution-independent comparison convention is inherited.

F1F2step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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