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.

Pullback and coefficient pushout realize bar cohomology maps

Statement

Assume AC. Pulling back an abelian-kernel extension along α:H→G represents α∗:H2(G,A)→H2(H,A). Pushing it out along a G-module map u:A→B represents u∗:H2(G,A)→H2(G,B). These are the abelian-kernel constructions, with the fixed actions. H2 denotes normalized bar cohomology, with its inherited derived interpretation.

Facts & Assumptions

Given: AC and an extension 0→A→iE→pG→1, a group map alpha and a module map u.

[F1]

An extension is classified by its normalized factor-set class, with section changes adding coboundaries (Bar two-cocycles classify abelian-kernel extensions).

[F2]

AC supplies normalized sections from the nonempty fibers (The Axiom of Choice).

Proof

1.1F1F2givenalgebra

The pullback is P={(e,h):p(e)=α(h)}≤E×H. Its projection to H is onto, its kernel is {(i(a),1)}, and the conjugation action is the restricted action. Choose a normalized section s of E using AC; (s(α(h)),h) is a section of P. Its factor set is (h,l)↦f(α(h),α(l)). By F1 this represents the bar pullback, including when alpha is not injective or surjective.

1.2givenalgebra

Let E act on B through p and form B⋊E. The subgroup S={(−u(a),i(a)):a∈A} is normal: conjugation by (b,e) sends its a-element to the one indexed by p(e)a, since i(A) acts trivially on B and u is equivariant. Set Eu=(B⋊E)/S. The map B→Eu, b↦[(b,1)], is injective, because intersection with S forces i(a)=1 and a=0. Projection to G is onto, and any kernel element [(b,i(a))] equals [(b+u(a),1)]. Thus its kernel is exactly B, with the prescribed action.

2.1F1step 1.1step 1.2algebra∎

The section g↦[(0,s(g))] has product [(0,s(g)s(h))]=[(u(f(g,h)),s(gh))], hence factor set u f. It represents the coefficient map by F1. Replacing f by f+δc replaces the two resulting cocycles by α∗f+δ(α∗c) and uf+δ(uc), respectively. Extension equivalences induce the same maps by [(b,e)]↦[(b,θ(e))] and (e,h)↦(θ(e),h), so both constructions are independent of representatives. No injectivity of the coefficient map on H2 is claimed.

Depends on

Used by

Dependency tree · two levels

6 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