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

The kernel of transgression is the image of restriction

Statement

Assume AC. With the displayed crossed-map and transgression conventions, ker(Tra:H1(N,A)QH2(Q,AN))=im(res:H1(G,A)H1(N,A)Q). Cohomology is the normalized bar theory, with its inherited derived interpretation.

Facts & Assumptions

Given: AC, the extension, A and [d] in the invariant H1 group.

[F1]

Transgression is the extension Ld/Dd with kernel AN (Low-degree transgression for a group extension).

[F2]

Restriction is defined into invariant H1 and its image has the stated crossed-map interpretation (Degree-one inflation–restriction is exact).

[F3]

The class of an extension is zero if and only if it has a homomorphic section (Bar two-cocycles classify abelian-kernel extensions).

Proof

1.1

If d is the restriction of a global crossed map c, its graph C={(c(g),g)} is a subgroup of AG and C(AN)=Dd. The latter is normal in C because N is normal in G. Thus CLd, and C/DdQ is a subgroup of Ld/Dd meeting the kernel AN trivially and mapping onto Q. It gives a homomorphic section. Therefore Tra[d]=0. If only the cohomology classes agree, replace the restriction by its principal-equivalent representative; F1 says Tra is unchanged.

F1F2F3givenalgebra
2.1

Conversely if Tra[d]=0, let CˉLd/Dd be the image of a splitting, supplied by F3. Take its full inverse image C in Ld. It contains Dd. It meets A trivially: an element of CA lies in AN by F1 and has class in CˉAN=1, so lies in DdA=1. The projection CG is onto: given g, select one member of C whose projection has quotient pi(g), then multiply it by the unique element of Dd correcting its projection to g. This is an elementwise existence proof, not a family of selections. Hence CG is an isomorphism and its inverse is the graph of a uniquely defined function c:G to A. The subgroup law gives c(gh)=c(g)+gc(h), and C(AN)=Dd gives cN=d. Thus [d] is in the restriction image.

F1F3step 1.1algebra

Depends on

Used by

Dependency tree · two levels

10 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