Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Degree-one inflation–restriction is exact

Statement

For every extension 1NGQ1 and left G-module A, the bar-cohomology sequence 0H1(Q,AN)infH1(G,A)resH1(N,A)Q is exact. This crossed-map proof is choice-free; the derived interpretation retains its inherited comparison convention. No surjectivity of restriction is asserted.

Facts & Assumptions

Given: The extension, A, and the well-defined degree-one maps.

[F1]

The displayed maps are homomorphisms with the stated domains and codomains (Degree-one maps and the quotient action are well-defined).

Proof

1.1

If an inflated c is principal, say c(πg)=gaa, restriction to N gives na=a for every n, because c(1)=0. Thus aAN and c itself is principal on Q. Inflation is injective. An inflated cocycle restricts to zero on N, so its class belongs to the kernel of restriction.

F1givenalgebra
2.1

Conversely let D restrict to a principal map nnaa. Replace D by D0=Dδa, so D0N=0. For n in N, D0(gn)=D0(g), and D0(ng)=nD0(g). But ng=g(g1ng), so these equations also give nD0(g)=D0(g). Thus D0 is constant on quotient fibers and takes values in AN. Define c(q) as this unique common value; no representatives need be chosen. For any g,h above q,r the crossed identity yields c(qr)=c(q)+qc(r). Hence D0=infc and [D] lies in its image.

F1step 1.1algebra

Depends on

Used by

Dependency tree · two levels

2 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