Alphabeta Math
Pipeline-generated
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.

Group Homology Transfer and Low-Degree Exact Sequences

1 · Prerequisites

2 · Summary

Normalized diagonal bar chains give an explicit finite-index transfer, including its coefficient action and independence from coset representatives. Transfer proves order annihilation in positive integral homology. A finite bicomplex calculation yields the five-term sequence of a free presentation, with its edge maps identified. Crossed homomorphisms and abelian-kernel extensions then give restriction, inflation and transgression with a fixed sign convention. Homology uses the stated Dependent Choice and supplied-resolution convention; the general extension classification and transgression proofs assume the Axiom of Choice, as declared in their statements.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Diagonal bar coinvariants compute group homology

Statement

Assume DC and the supplied projective-resolution convention for derived group homology. For every left G-module M, Hn(G;M) is naturally the homology of Cn(G;M)=(Bn(G)ZM)G, with diagonal left action and alternating vertex-deletion differential. Equivalently it is computed by Bright(G)ZGM, where bg=g1b.

Facts & Assumptions

Given: DC, a group G, a left module M, and supplied left projective resolution P of M.

[F1]

The derived convention computes homology of ZZGP (Group homology as a derived functor).

[F2]

The homogeneous bar complex is an augmented free resolution (The bar complex is a free resolution of the trivial module).

[F3]

Normalization is a chain-homotopy equivalence (Normalized and unnormalized bars are homotopy equivalent).

[F4]

Projectivity lifts the identity through any epimorphism onto the object (Projective object).

[F5]

Proof

1.1

Turning a left module into a right module by bg=g1b preserves exactness and takes the regular free left module to a free right module (send the basis coordinate g to g1). Thus the normalized bar complex B=Bright(G)Z is a free right resolution: normalization preserves exactness, and its nondegenerate orbits supply a free basis.

F2F3given
2.1

Put R=ZG and Dpq=BpRPq with differential h=dB1 and v=(1)p1dP. Then hv+vh=0. Tensor with Bp, a free right module, preserves exactness: each finite-support cycle has a primitive by lifting only its finitely many nonzero coordinates. Each projective Pq is a retract of the free module on its underlying set: lift its identity through the canonical surjection. Tensor with Pq is therefore a retract of tensor with a free left module and preserves exact sequences of right modules. The augmented columns of D are exact with bottom BpRM, and augmented rows are exact with left edge ZRPq.

F4step 1.1algebra
2.2

The map BRM(BZM)G sending bm to its diagonal orbit class is well-defined: g1bm and bgm are in the same orbit. Conversely (gb)(gm)=bm in the balanced tensor product since gb=bg1. The same formula therefore defines an inverse, and both composites fix every pure tensor. Each vertex deletion commutes with these formulas, including the first and last deletions, giving a chain isomorphism.

step 1.1algebra
3.1

Here is the finite comparison argument for either augmentation. For exact augmented columns, place the augmentation in vertical degree -1. In the resulting augmented total complex, a total n-cycle has finitely many components, with 0pn+1. At its largest remaining p, the cycle equation says vzp=0, because the component from p+1 is zero. Exactness supplies wp with vwp=zp. Subtract (h+v)wp; the p-component vanishes and the only new component is at p-1. Repeat down to p=0, where h is zero. The cycle has become zero after finitely many boundary subtractions. Thus the augmented total complex is acyclic. The same proof with p and q interchanged works for exact augmented rows, using the largest remaining q. Signs of the primitive are absorbed into w.

step 2.1algebra
4.1

The augmented total complex is the cone of the total-to-edge augmentation up to a shift and sign. Acyclicity implies that augmentation induces a homology isomorphism: a cycle on the edge lifts to a total cycle because the corresponding cone cycle bounds; if a total cycle maps to an edge boundary, pairing it with that boundary primitive makes a cone cycle, whose being a boundary says the original cycle bounds. Hence H(BRM)H(TotD)H(ZRP)=HP(G;M). DC is the inherited resolution-comparison assumption; the finite elimination in step 3.1 adds no arbitrary family of choices.

F1F5step 3.1algebra
5.1

The augmentations and tensor formulas commute with coefficient maps and with the bar maps induced by group homomorphisms. Maps between supplied resolutions give the same maps on homology by the supplied-resolution convention. Since inverses of isomorphisms are unique, the composite identification is natural. Degree zero gives the usual coinvariants; for M=0 all complexes are zero, and for G=1 normalized bars vanish in positive degrees.

F1step 4.1step 2.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Finite-index transfer on normalized bar chains

Definition

Use diagonal bar chains C(G;M) for a left G-module M, with the DC and supplied-resolution convention when identifying their homology with derived homology. Let HG have finite index. Choose representatives T of the right cosets Ht, with 1T. Write x=r(x)t(x) with r(x)H and t(x)T. Transfer is TrT[(g0,,gn)m]=tT[(r(tg0),,r(tgn))tm]. For trivial coefficients, in inhomogeneous coordinates set t0=t, ti=t(ti1gi) and hi=ti1giti1H. Then TrT[g1gn]=tT[h1hn]. A tuple with an identity entry in inhomogeneous coordinates is zero. Well-definedness and the chain-map property are supplied by the following lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Bar transfer is a chain map independent of the transversal

Statement

The transfer formula is well-defined on normalized diagonal coinvariants and is a chain map. Any two finite right transversals yield chain-homotopic transfer maps. Hence transfer on homology is independent of the transversal, with the inherited derived-homology conventions.

Facts & Assumptions

Given: G,H,M,T and the retraction r in the transfer definition.

[F1]

Transfer is the finite sum using the vertex retraction r and coefficients tm (Finite-index transfer on normalized bar chains).

Proof

1.1

The retraction satisfies r(hx)=hr(x) for hH, since Hx=Hhx. For xG and tT write tx=httx. Right multiplication by x permutes the right cosets, so ttx permutes T. The t-summand on [(xg0,,xgn)xm] is [(htr(txg0),,htr(txgn))httxm], equal in H-coinvariants to the tx-summand of the original chain. This proves diagonal invariance and well-definedness.

F1givenalgebra
1.2

For two H-equivariant vertex maps f,u define the prism Pn(v0,,vn)=i=0n(1)i(fv0,,fvi,uvi,,uvn). Expansion gives dP+Pd=uf: deletions away from the switch cancel the corresponding terms of Pd; the two switch faces at consecutive values of i cancel, leaving only deletion of the first f-vertex at i=0 and of the last u-vertex at i=n, with signs + and -. For n=0 this reads d(fv0,uv0)=(uv0)(fv0). Equivariance makes this descend to diagonal coinvariants. If vj=vj+1, each prism summand has either an adjacent equal f-pair or an adjacent equal u-pair, so it also descends to normalization.

givenalgebra
2.1

For each deletion index 0jn, deleting the jth vertex of (r(tg0),,r(tgn)) is exactly applying r to the tuple with gj deleted; the coefficient remains tm. Thus all faces, including j=0,n, commute with the sum and so does their alternating differential. Adjacent equal input vertices stay equal after r, so degeneracies map to degeneracies. The formula descends to normalized chains.

step 1.1algebra
2.2

Let U be another transversal with retraction u. For each right coset write its representative in U as att, atH. The corresponding U-summand becomes [(u(tg0),,u(tgn))tm] after translating by at1 in the H-coinvariants. Thus compare r and u on the same inputs (tg0,,tgn) and same coefficient tm. Sum the prism of step 1.2 over T. The permutation calculation of step 1.1 applies to the prism too, because both vertex maps are H-equivariant. It gives a well-defined normalized homotopy K with dK+Kd=TrUTrT.

step 1.1step 1.2algebra
3.1

For completeness, in the inhomogeneous tuple (1,g1,g1g2,,g1gn), the recursion gives r(tg1gi)=h1hi and r(t)=1. Consecutive vertex ratios are therefore the printed h_i, proving the inhomogeneous formula. All sums and choices are finite; for H=G use T={1}.

F1step 2.1step 2.2algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Corestriction after transfer multiplies by the index

Statement

Let HG have finite index and M be a left G-module. For every n0, the composite Hn(G;M)TrHn(H;M)iHn(G;M) is multiplication by [G:H]. Here corestriction means the covariant inclusion map in homology; the derived identification retains DC and supplied resolutions.

Facts & Assumptions

Given: The finite-index inclusion, coefficient module, and a finite transversal T.

[F1]

The transfer formula is well-defined on normalized diagonal coinvariants, is a chain map, and induces a transversal-independent homology map (Bar transfer is a chain map independent of the transversal).

[F2]

For right-coset representatives T, write x=r(x)t(x) with r(x)H; transfer is the finite sum obtained by applying r to the vertices of (tg0,,tgn) and using coefficient tm (Finite-index transfer on normalized bar chains).

Proof

1.1

Put u(x)=x. For each tT define the alternating vertex prism Pt,n[(g0,,gn)m]=i=0n(1)i[(r(tg0),,r(tgi),tgi,,tgn)tm]. Expanding the vertex-deletion differential cancels every face away from the switch in pairs; the two endpoint faces that survive give dPt+Ptd=ut,rt,, where ut, uses (tg0,,tgn) and rt, is the t-summand of corestriction after the transfer in [F2]. If tx=httx with htH and txT, then ttx permutes T, r(txg)=htr(txg), and both vertex strings and the coefficient txm=httxm change by the same diagonal translation. Hence P=tTPt descends to G-coinvariants. Equal adjacent input vertices make every prism summand degenerate, so it also descends to normalized chains. Thus dP+Pd=tTut,iTrT.

F1F2givenalgebra
2.1

Each translated summand is [(g0,,gn)m] in diagonal G-coinvariants. The sum is therefore [G:H] times that chain in every degree, including zero. Homotopic chain maps give the same map on homology because their difference on a cycle is a boundary. Thus iTr=[G:H]id.

step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Positive integral homology is annihilated by the group order

Statement

For a finite group G and n>0, GHn(G;Z)=0, with trivial integral coefficients. Derived homology uses the inherited DC and supplied-resolution convention.

Facts & Assumptions

Given: A finite group G and integer n>0.

[F1]

Inclusion after transfer multiplies by the finite index (Corestriction after transfer multiplies by the index).

[F2]

Normalized diagonal bars compute group homology (Diagonal bar coinvariants compute group homology).

Proof

1.1

For the trivial group, every tuple of length at least two has adjacent equal vertices. Its normalized chain groups in positive degrees are consequently zero, so Hn(1;Z)=0 for n>0.

F2given
2.1

Apply transfer to 1G. Its index is G and the composite factors through the zero group of step 1.1; F1 identifies this composite with multiplication by G. Hence it is zero. If G=1, this says the positive homology itself is zero. Degree zero is excluded: there it is Z.

F1step 1.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

First integral homology and conjugation coinvariants

Statement

Naturally H1(G;Z)Gab. If RF, conjugation induces an F/R-action on H1(R;Z) and H1(R;Z)F/RR/[F,R], where [F,R] is generated by frf1r1. Derived homology carries the inherited DC and supplied-resolution convention.

Facts & Assumptions

Given: G is a group; in the second assertion R is normal in F; coefficients are trivial integers.

[F1]

Normalized diagonal bars compute homology (Diagonal bar coinvariants compute group homology).

[F2]

Inhomogeneous normalized chains kill an entry equal to 1 (The normalized homogeneous bar complex).

Proof

1.1

In degree one all boundaries to degree zero are zero with trivial coefficients. Degree two has d[xy]=[y][xy]+[x], with [1]=0. Thus H1 is the abelian group generated by symbols [x] subject precisely to [xy]=[x]+[y]. The assignment [x]x[G,G] induces a map to Gab; conversely x[x] is a group homomorphism to an abelian group, kills every commutator, and factors through Gab. The maps are inverse on generators and commute with group homomorphisms.

F1F2algebra
2.1

For R the isomorphism sends conjugation by f to r[R,R]frf1[R,R]. Conjugation by an element of R is trivial on this quotient, so the action factors through F/R. Taking coinvariants adds exactly the relations frf1r1=1. Since [R,R][F,R], the resulting quotient is R/[F,R]. If R=1 it is zero, and if R=F it is Fab.

step 1.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-09Open item page →

Generator differences form a basis of the free-group augmentation ideal

Statement

If F is free on an arbitrary set X, then 0xXZFexZFϵZ0,(ex)=x1, is a free resolution of the trivial left module; this exactness assertion requires no choice axiom. Assume additionally the Axiom of Dependent Choice (DC) and supplied projective-resolution data for derived group homology. Then Hq(F;Z)=0 for q>1 and H1(F;Z)XZ.

Facts & Assumptions

Given: F is the reduced-word free group on an arbitrary set X; epsilon sums the coefficients. For the homology conclusions, assume DC and fix the supplied projective resolution QZ of the trivial left module.

[F1]

Reduced words give the free group with no nonempty reduced word equal to 1 (Reduced words form the free group on an alphabet).

[F2]

Group homology is the homology obtained by tensoring the supplied projective resolution with the right trivial module (Group homology as a derived functor).

[F3]

A projective object lifts every morphism through an epimorphism (Projective object).

[F4]

Proof

1.1

For a word w=l1ls, telescoping gives w1=j=1sl1lj1(lj1). A positive letter contributes a multiple of x1, and x11=x1(x1) does too. Every element waww of augmentation zero is waw(w1), so im=kerϵ. Empty words contribute zero; epsilon is onto since epsilon(1)=1.

F1givenalgebra
2.1

Interpret wex as the oriented edge from w to wx. Its boundary is wx-w. The underlying graph is connected by reduced words and has no simple cycle: a simple cycle would give a nonempty reduced word equal to 1, impossible by F1. A finite nonzero edge chain has support in a finite forest. A nonempty finite forest with an edge has a terminal vertex (take an endpoint of a longest simple path); at that vertex its boundary coefficient is plus or minus the nonzero coefficient of its unique incident supported edge. Thus a nonzero finite edge chain cannot have zero boundary, proving injectivity.

F1step 1.1algebra
3.1

Write R=ZF and denote the displayed free left resolution by P. Turn it into a right resolution T by tg=g1t. This preserves the underlying exact sequence. Each left regular summand becomes a right regular summand by the coordinate map gg1; thus T0R, T1XR, and the right differential sends the basis vector indexed by x to x11. Tensoring with a free module preserves exactness: the tensor product is a direct sum of copies of the original sequence, and lifting an element requires preimages only for its finitely many nonzero coordinates. For each fixed q, projectivity of Qq lifts its identity through the canonical surjection from the free left module on its underlying set, making Qq a retract of that free module. Consequently tensoring with Qq also preserves exactness, as a retract of an exact tensor functor. This uses no choice of lifts for an arbitrary basis and no simultaneous choice of splittings for all q.

F3step 1.1step 2.1algebra
4.1

Form Dpq=TpRQq for p,q0, with h=dT1 and v=(1)p1dQ. These differentials anticommute, so d=h+v defines the direct-sum total complex. The two augmentations give degreewise surjective chain maps a:TotDTRZ and b:TotDZRQ, zero off q=0 and p=0 respectively. By step 3.1, all augmented columns and all augmented rows are exact. Hence kera, viewed columnwise with its degree-zero column term replaced by the augmentation kernel, has exact columns; similarly kerb has exact rows.

step 3.1givenalgebra
5.1

Both kernel total complexes are acyclic by the following finite argument. For a total n-cycle in kera, take the largest p with a nonzero component. Its vertical differential is zero, since the component at p+1 is zero. Exactness in that column supplies a vertical primitive. Subtract its total boundary: the p-component vanishes and only a component at p-1 can be introduced. Repeating ends at p=0, where h is zero. There are at most n+1 columns to remove, so the cycle is a boundary. For kerb, use the largest q and horizontal primitives, decreasing q until q=0, where v is zero. Signs are absorbed into the primitives. These arguments use only finitely many existential choices for each cycle.

step 4.1algebra
6.1

A degreewise surjective chain map with acyclic kernel induces a homology isomorphism: lift a target cycle; its differential is a kernel cycle, so subtract a kernel primitive to make the lift a cycle. If a source cycle maps to a boundary, lift that boundary's primitive and subtract its differential; the result is a kernel cycle and hence a boundary. This proves surjectivity and injectivity on homology, including degree zero. Applying this to a and b yields H(TRZ)H(ZRQ)=H(F;Z) under the assumed DC and supplied-resolution convention.

F2F4step 4.1step 5.1algebra
7.1

The differential of TRZ sends every x11 to zero. Its only nonzero terms are XZ in degree one and Z in degree zero, proving the asserted homology groups. If X is empty, F=1 and the degree-one term is zero.

step 3.1step 6.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The low-degree filtration sequence of a first-quadrant bicomplex

Statement

Let Dpq, p,q0, be a bicomplex with h:DpqDp1,q, v:DpqDp,q1, h2=v2=hv+vh=0. Set Tn=p+q=nDpq, d=h+v, and Epq2=Hp(Hq(D,,v),h). Then there is a natural exact sequence H2(T)e2E202d2E012jH1(T)e1E1020. The filtration is FrTn=pr,p+q=nDpq. This holds for module bicomplexes, and with the same kernel/image constructions in an abelian category. No general spectral-sequence convergence theorem is assumed.

Facts & Assumptions

Given: A first-quadrant anticommuting bicomplex as stated; missing negative positions mean zero.

[F1]

A differential has square zero (Chain complex in an abelian category).

[F2]

Homology is cycles modulo boundaries (Homology object of a chain complex).

Proof

1.1

The identity (h+v)2=0 makes T a chain complex, and h lowers p while v preserves it, so FrT is a subcomplex. The quotient FrT/Fr1T has just differential v; its homology is the rth column homology, whose induced differential is h. This yields the stated E2 subquotients using only kernels and images. Below, an element denotes a representative in these subquotients. In an abelian category the same notation means a morphism into the indicated kernel after pulling back the epimorphism onto the image; every lift below is of this form, and equality of subobjects can be checked after such epimorphic pullbacks. Thus the calculations do not require objects to have underlying sets.

F1F2givenalgebra
2.1

A class in E202 is represented by xD20 with hx=vy for some yD11. Set d2[x]=[hy]E012. Indeed vhy=hvy=h2x=0. Replacing y by another such lift changes hy by h of a vertical cycle, zero in E2. Replacing x by x+vt+hu with tD21, uD30 changes a compatible y to y+ht; its h-image is unchanged. These are precisely the vertical-boundary and horizontal-boundary changes allowed in E202. Hence d2 is a well-defined homomorphism.

step 1.1algebra
3.1

A total 2-cycle has components (x,y,z)D20D11D02 with hx+vy=0 and hy+vz=0. Define e2[(x,y,z)]=[x]. A total 3-boundary changes x by hu+vt from D30 and D21, so e2 is well-defined. Its image is in the kernel of d2. Conversely if d2[x]=0, choose y as in step 2.1. Then hy=ha+vb for a vertical cycle aD11 and bD02. The triple (x,ya,b) is a total cycle and maps to [x]. This proves exactness at E202.

step 2.1algebra
3.2

A vertical cycle zD01 is a total cycle; define j[z]=[(0,z)]. Replacing z by vb+ha with va=0 adds the total boundary d(b+a), so j is well-defined on E012. If z=hy as in step 2.1, then z=d(x+y), proving jd2=0. Conversely, if (0,z)=d(x+y+b), its p=1 component gives hx+vy=0 and its p=0 component gives z=hy+vb. Therefore [z]=d2[x]. This proves exactness at E012.

step 2.1algebra
4.1

A total 1-cycle (a,b)D10D01 satisfies ha+vb=0. Define e1[(a,b)]=[a]E102. Boundaries change a by hx+vy, so e1 is well-defined. Every E102 representative a admits b with ha=vb, hence e1 is onto. Clearly e1j=0. If [a]=0, write a=hx+vy with xD20, yD11. Subtract d(x+y) from (a,b); the result is (0,bhy), a vertical cycle, hence in the image of j. This proves exactness at H1(T) and at the final nonzero term.

step 1.1step 3.2algebra
5.1

All constructions commute with morphisms of bicomplexes: they use the same components, and images of chosen lifts are compatible lifts in the target, whose class is independent of the lift. Only components of total degree at most three were used. In particular F0H1(T)=imjE012/imd2 and H1(T)/F0H1(T)E102 by steps 3.2–4.1. These explicit subquotients establish the required low-degree filtration assertions without an infinite limiting process. Zero rows or columns are permitted throughout.

step 3.1step 3.2step 4.1algebra

Remarks

The source low-degree sequences are Löh Theorem 3.2.18 and Weibel Low Degree Terms 6.8.3. The finite component chase above supplies the filtration argument locally.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The free-presentation Lyndon bar bicomplex

Definition

Let 1RFπG1 be a free presentation (here R denotes the normal subgroup, not a ring). Under the DC and supplied-resolution homology convention put Cq=(Bq(F))R, a left ZG-module, and Dpq=Bpright(G)ZGCq,h=dB1,v=(1)p1dC. Then Epq2=Hp(G;Hq(R;Z)) for the p-filtration, and H(TotD)=H(F;Z). The degree-one edge maps are the homomorphism R/[F,R]Fab induced by the subgroup inclusion RF and the quotient homomorphism FabGab.

Facts & Assumptions

Given: The free presentation and DC with supplied homology resolutions; normalized bars carry the vertex-deletion differential.

[F1]

Normalized right bars and finite augmented tensor comparisons compute homology (Diagonal bar coinvariants compute group homology).

[F2]

H1 is naturally abelianization and conjugation coinvariants are R/[F,R] (First integral homology and conjugation coinvariants).

[F3]

The anticommuting total complex has the displayed low-degree filtration maps (The low-degree filtration sequence of a first-quadrant bicomplex).

[F4]

A presentation gives a free group with its normal relation subgroup and quotient (Group presentation by generators and relations).

Proof

1.1

Normality of R makes left F-translation on R-orbits factor through G. A nondegenerate F-tuple has a unique form f0(1,a1,,aq); hence its R-orbit is specified by π(f0) and the relative tuple (1,a1,,aq). Thus Cq is canonically free over ZG on these relative tuples. Both differentials are well-defined, square to zero, and anticommute because the vertical sign changes when p decreases.

F1F4givenalgebra
2.1

To identify Hq(C) without choosing a transversal of R in F, note that the permutation module on any free R-set is tensor-exact. Each element of a tensor product has finite support in the orbit set. On the union of those finitely many orbits choose one representative per orbit; there it is a finite sum of regular free modules. Coordinate lifting proves exactness on that summand, and projection onto it shows injectivity is tested there too. Thus tensoring with the restriction of each Bq(F) preserves exactness even without selecting representatives of all orbits at once. The augmented complex B(F)Z is exact also after restriction to R. Form Bright(R)ZRB(F). Its exact augmented rows and columns give, by the finite elimination in F1, H(C)H(R;Z). Applying the same comparison to B(R)B(F) shows that the isomorphism is induced by the literal inclusion of R-tuples.

F1step 1.1algebra
3.1

For f in F, the maps on R-vertices rfr and rfrf1 into F are equivariant for the same conjugated R-action. The alternating prism between them, i(1)i(fr0,,fri,frif1,,frnf1), has boundary equal to their difference: off-switch faces cancel in pairs and the two surviving switch endpoints are the two maps. It preserves normalized degeneracies and descends to R-coinvariants. Hence the action on Hq(C) induced by left f is conjugation by f on Hq(R;Z). Elements of R already act trivially on C, so this is the stated G-action.

step 2.1algebra
4.1

For fixed q, the horizontal complex Bright(G)Cq has zero positive homology since C_q is free; its zero homology is (Cq)G=(Bq(F))F. The augmentation to this column induces a total homology isomorphism by the finite row elimination of F1. For fixed p, the first factor is free, so vertical homology is Bpright(G)Hq(C) (the sign does not change kernels or images). Taking horizontal homology and using step 3.1 gives exactly the asserted E2 terms. Thus the total computes H(F;Z), and F3 applies.

F1F3step 1.1step 3.1algebra
5.1

The map from E012 to total H1 sends the bar cycle (1,r), r in R, to y=(1)[(1,r)]RD01. The horizontal augmentation sends this to [(1,r)]F, which represents r in Fab. F2 identifies its domain with R/[F,R], so this edge is the homomorphism induced by the subgroup inclusion RF; it is not asserted to be injective.

F2F3step 4.1algebra
6.1

For arbitrary f in F put g=π(f) and y=(1)[(1,f)]RD01, x=(1,g1)[(1)]RD10. Balancing uses (g1)=(1)g, so hx=(1)([f]R[1]R)=vy. Thus y-x is a total cycle whose horizontal augmentation represents [f]. The vertical augmentation sends it to [(1,g1)], representing [g1]=[g] in Gab. Since the [f] generate H1, the other edge is exactly the quotient map. If g=1 then x is degenerate and zero, consistent with step 5.1.

F2F3step 4.1step 5.1algebra
7.1

Group maps of presentations act vertexwise on bars and on R-orbits, commuting with all augmentations and component maps. The constructed homology and E2 identifications, including the edge maps, are therefore natural. Empty X, trivial R, and trivial G cause no failure in the formulas; when G=1 all horizontal positive bars vanish.

step 2.1step 4.1step 5.1step 6.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Free-presentation total homology and its degree-one edges

Statement

For the free-presentation bicomplex, Hn(TotD)=0 for n>1, H1(TotD)=Fab, E012=R/[F,R], and Ep02=Hp(G;Z). The degree-one maps are inclusion and quotient on abelianizations. This does not assert vanishing of every positive-degree E2 term. Retain DC and supplied-resolution conventions.

Facts & Assumptions

Given: The free presentation and bicomplex of the Definition, with the inherited homology conventions.

[F1]

Total homology is H*(F), E2 is H_p(G;H_q(R)), and the degree-one edges are identified (The free-presentation Lyndon bar bicomplex).

[F2]

A free group has a length-one free resolution (Generator differences form a basis of the free-group augmentation ideal).

[F3]

H1(R) conjugation coinvariants equal R/[F,R] (First integral homology and conjugation coinvariants).

Proof

1.1

The total homology equals H*(F) by F1. The free resolution of F2 has no terms above degree one, so after tensoring it has zero homology there; in degree one it gives the free abelian group on the free generators, which is Fab. Hence the asserted total vanishing holds even for an infinite free generating set.

F1F2given
2.1

The zero homology of R with trivial integers is Z: every vertex is identified, and each degree-one boundary is a difference of vertices. Conjugation fixes this generator. Consequently Ep02=Hp(G;Z). Also E012=H0(G;H1(R;Z))=R/[F,R] by F3. The edge calculations of F1 send r to its class in Fab and f to its image in Gab, with positive signs.

F1F3step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The free-presentation homology five-term sequence

Statement

For a free presentation 1RFG1 there is a natural exact sequence 0H2(G;Z)d2R/[F,R]FabGab0. The last two nonzero arrows are induced by inclusion and quotient; d2 is the filtration transgression defined by hx=vy[hy]. Retain DC and supplied-resolution homology conventions.

Facts & Assumptions

Given: The free presentation and the stated homology conventions.

[F1]

Total H2 vanishes and the low-degree total and E2 terms have the stated group interpretations (Free-presentation total homology and its degree-one edges).

[F2]

H2(T) to E20 to E01 to H1(T) to E10 to zero is naturally exact (The low-degree filtration sequence of a first-quadrant bicomplex).

[F3]

The free-presentation bicomplex has anticommuting component differentials h and v with the stated total complex and edge maps (The free-presentation Lyndon bar bicomplex).

Proof

1.1

Apply F2 to the first-quadrant free-presentation bicomplex. Substitute H2(T)=0, E202=H2(G;Z), E012=R/[F,R], H1(T)=Fab and E102=Gab from F1. This identifies the groups in the displayed sequence and supplies exactness at the last three nonzero terms; the next two steps define the first arrow by the printed representative formula and prove the two adjacent exactness claims directly.

F1F2given
1.2

In the bicomplex of [F3], represent a class in E202 by xD20 with hx=vy for some yD11, and define d2[x]=[hy]E012. This is a vertical cycle because vhy=hvy=h2x=0. Replacing y by another lift changes hy by the horizontal boundary of a vertical cycle. Replacing x by x+vt+hu, with tD21 and uD30, permits the compatible replacement y+ht and leaves hy unchanged. Thus the displayed formula is well-defined.

F3algebra
2.1

This d2 is injective here. If [hy]=0 in E012, write hy=ha+vb for a vertical cycle aD11 and bD02. Then (x,ya,b) is a total 2-cycle mapping to [x]. Since H2(T)=0 by [F1], its class and hence [x] vanish. Moreover the edge map j:E012H1(T) sends a vertical cycle z to the total cycle (0,z). The equation jd2[x]=0 follows from (0,hy)=d(x+y). Conversely, if j[z]=0, write (0,z)=d(x+y+b) with xD20, yD11, and bD02. Its components give hx=vy and z=hy+vb, hence [z]=d2[x]. This proves exactness at the first two nonzero terms for the stated representative formula; [F2] supplies exactness at the remaining terms.

F1F2F3step 1.2algebra
3.1

The edge computations in F1 identify the next arrows with r mapped into Fab and f mapped to its quotient class. All constructions in steps 1.2–2.1 commute with the vertexwise maps induced by maps of presentations, so the sequence and the displayed transgression are natural. No terminal surjectivity beyond the printed Gab0 is needed. For R=1 the sequence reduces to zero H2 of F and the identity of its abelianization; for G=1 it reduces to the identity FabFab.

F1F2F3step 1.1step 1.2step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Crossed homomorphisms and first cohomology

Definition

For a left G-module A (written additively), put Zcr1(G,A)={d:GA:d(gh)=d(g)+gd(h)},Bcr1(G,A)={δa:ggaa}. Define Hcr1=Zcr1/Bcr1. It agrees with normalized bar H1(G,A); comparison to derived cohomology retains the inherited DC and supplied-resolution convention. The crossed-homomorphism and bar quotient statements themselves require no choice axiom.

Facts & Assumptions

Given: G a group and A a left G-module.

[F1]

The inhomogeneous coboundary is the alternating multiplication formula (Inhomogeneous group cochains).

[F2]

Normalized inhomogeneous cochains compute group cohomology under its inherited conventions (Normalized cochains compute group cohomology).

Proof

1.1

In degrees zero and one the differential reads (δa)(g)=gaa and (δd)(g,h)=gd(h)d(gh)+d(g). Thus δd=0 is exactly the crossed-homomorphism identity. Setting g=h=1 gives d(1)=0, so every crossed homomorphism is normalized. Also (gh)aa=(gaa)+g(haa), so every principal map is crossed. Both sets are additive groups and the principal maps form a subgroup.

F1givenalgebra
2.1

The cycles and boundaries of normalized degree one are therefore exactly the two groups in the Definition, so their quotient is bar H1 and hence, under the stated convention, the cohomology of F2. For trivial action the crossed identity is the homomorphism identity and every principal map is zero, giving H1(G,A)=Hom(G,A). For G=1 or A=0 it is zero.

F2step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Degree-one restriction, inflation and quotient action

Definition

For 1NGπQ1 and a left G-module A, let AN={a:na=a for all nN}, with action qa=ga for any lift g of q. Define res(d)=dN,inf(c)(g)=c(π(g)),(gd)(n)=gd(g1ng). Inflation starts with crossed maps QAN. The last formula is a G-action on crossed maps NA; it is its induced action on H1 that factors through Q. All H1 symbols first denote the explicit bar quotient; the derived interpretation uses its inherited conventions. The next lemma supplies well-definedness on the quotient.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Degree-one maps and the quotient action are well-defined

Statement

The formulas define homomorphisms inf:H1(Q,AN)H1(G,A), res:H1(G,A)H1(N,A)Q, and a Q-action on H1(N,A). Here H1 is the bar quotient, with the inherited convention for its derived interpretation.

Facts & Assumptions

Given: The extension, module, and formulas in the preceding Definition.

[F1]

Restriction, inflation and conjugation are given by the displayed crossed-map formulas (Degree-one restriction, inflation and quotient action).

Proof

1.1

If a is N-fixed, then n(ga)=g(g1ng)a=ga, since N is normal. Thus ga is N-fixed. Replacing g by gn with n in N does not change ga, proving the Q-action on AN. For a crossed map c into AN, c(π(gh))=c(πg)+gc(πh); hence its inflation is crossed. Principal c from a in AN inflates to ggaa. Restriction plainly preserves the crossed identity and sends the principal map from a to the principal map from the same a.

F1givenalgebra
1.2

For dZ1(N,A), write u=g1ng, w=g1mg. Then (gd)(nm)=g(d(u)+ud(w))=(gd)(n)+n(gd)(m), so the action preserves crossed maps. It sends δa to δ(ga) and satisfies (gh)d=g(hd) by substitution. For tN, using d(t1)=t1d(t) gives (td)(n)=d(n)+nd(t)d(t). Hence N acts trivially on H1, and the action there factors through Q.

F1algebra
2.1

For a global crossed map D on G the identical expansion gives gD(g1ng)=D(n)+nD(g)D(g). Consequently conjugation changes its restriction by the principal map δ(D(g)), so the restriction class is Q-invariant. All formulas are additive in the crossed map, and therefore descend to the stated homomorphisms. The zero module and either trivial end group obey the same identities.

step 1.1step 1.2algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-09Open item page →

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
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Bar two-cocycles classify abelian-kernel extensions

Statement

Assume AC. For a group G and a fixed left G-module A, normalized bar H2(G,A) is in bijection with equivalence classes of extensions 0AEG1 inducing the fixed action on A. The zero class corresponds exactly to extensions with a homomorphic section. The derived interpretation of bar cohomology retains its supplied-resolution comparison convention.

Facts & Assumptions

Given: AC, G and A as stated; extension equivalences fix kernel and quotient.

[F1]

The bar coboundary in degree two is the alternating action/multiplication formula (Inhomogeneous group cochains).

[F2]

Normalized cochains compute H2 under the inherited convention (Normalized cochains compute group cohomology).

[F3]

Equivalence fixes the identified kernel and quotient (Equivalence of group extensions with fixed kernel and fixed quotient).

[F4]

Every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

1.1

For an extension E, apply AC to the nonempty fibers of EG and set s(1)=1. Unique kernel coordinates define f by s(g)s(h)=i(f(g,h))s(gh). Then f(1,g)=f(g,1)=0. Associativity of s(g)s(h)s(l) gives f(g,h)+f(gh,l)=gf(h,l)+f(g,hl), exactly δf=0. The action term follows from s(g)i(a)s(g)1=i(ga), the prescribed action.

F1F4givenalgebra
2.1

Conversely, for a normalized cocycle f define Ef=A×G with (a,g)(b,h)=(a+gb+f(g,h),gh). The first coordinates of the two triple products differ by f(g,h)+f(gh,l)gf(h,l)f(g,hl)=0, so multiplication is associative. The identity is (0,1). The inverse is (a,g)1=(g1ag1f(g,g1),g1); the right product is the identity, and the left product is too since the cocycle identity gives f(g1,g)=g1f(g,g1). Inclusion a(a,1) and projection to G are exact and conjugation induces ga.

F1step 1.1algebra
3.1

A new normalized section sb(g)=i(b(g))s(g) changes f to fb=f+δb, where (δb)(g,h)=b(g)+gb(h)b(gh). The map EfEfb, (a,g)(ab(g),g) is an isomorphism: substitution in the two multiplication laws gives first coordinate a+gc+f(g,h)b(gh) on both sides. It fixes A and G and has inverse adding b(g). If two normalized cocycles differ by a coboundary, the cochain b is normalized as well, since its coboundary at (1,g) equals b(1).

F1F3step 2.1algebra
4.1

The map EfE, (a,g)i(a)s(g), is a homomorphism by the factor-set equation; unique kernel coordinates in each fiber make it a bijection fixing A and G. Conversely any equivalence carries a chosen section to a section and preserves its factor set. Thus the two constructions induce inverse bijections on the quotient by coboundaries and on extension classes. By F2 this quotient is the indicated H2.

F2F3step 1.1step 3.1algebra
5.1

If the class is zero, choose a normalized b with f+δb=0; the section sb is then a homomorphism. A homomorphic section conversely has f=0 and hence zero class. For A=0 there is the unique extension G, and for G=1 the unique extension A; both have zero class. Only step 1.1 uses arbitrary choice; supplied sections suffice for an individual construction.

step 1.1step 3.1step 4.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Pullback and coefficient pushout realize bar cohomology maps

Statement

Assume AC. Pulling back an abelian-kernel extension along α:HG represents α:H2(G,A)H2(H,A). Pushing it out along a G-module map u:AB 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 0AiEpG1, 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.1

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.

F1F2givenalgebra
1.2

Let E act on B through p and form BE. The subgroup S={(u(a),i(a)):aA} 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=(BE)/S. The map BEu, 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.

givenalgebra
2.1

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.

F1step 1.1step 1.2algebra
DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

Low-degree transgression for a group extension

Definition

Assume AC. For 1NGπQ1, a left G-module A and [d]H1(N,A)Q, put Dd={(d(n),n):nN}AG and Ld=NAG(Dd). Define Tra[d] to be the class of 0ANLd/DdQ1. It is a well-defined homomorphism to normalized bar H2(Q,AN). Explicitly choose normalized α:QG and η:QA with (α(q)dd)(n)=nη(q)η(q); put f(q,r)=α(q)α(r)α(qr)1. Then Tra is represented by F(q,r)=η(q)+α(q)η(r)f(q,r)η(qr)d(f(q,r)). This fixes the DHW sign convention. The derived interpretation of bar cohomology retains its comparison convention.

Facts & Assumptions

Given: AC, the extension, A, and a Q-invariant crossed-map class [d].

[F1]

The conjugation action on crossed-map classes factors through Q (Degree-one maps and the quotient action are well-defined).

[F2]

Normalized factor sets classify the extensions with fixed action (Bar two-cocycles classify abelian-kernel extensions).

[F3]

AC chooses elements of arbitrary nonempty indexed families (The Axiom of Choice).

Proof

1.1

The crossed identity makes Dd a subgroup mapping isomorphically onto N. In AG, conjugating (d(g1ng),g1ng) by (a,g) gives (a+gd(g1ng)na,n). Thus (a,g)Ld exactly when (gdd)(n)=naa for every n. By invariance in F1 there exists such an a for each g, so LdG is onto. Setting g=1 shows LdA=AN. Its elements over N are precisely ANDd, since division by the unique D_d element over the same n lies in this intersection. Consequently the quotient extension is exact; its action on AN is aga, the quotient Q-action.

F1givenalgebra
2.1

Apply AC to the fibers of GQ, normalizing α(1)=1. For each q the set of a solving the normalizer equation for α(q) is nonempty by step 1.1. Apply AC to these Q-indexed sets and normalize η(1)=0, which is a solution. Then lq=(η(q),α(q))Ld. For f=f(q,r), direct multiplication gives lqlr=(F(q,r),1)(d(f),f)lqr with exactly the F printed in the Definition. All factors except possibly (F,1) are in Ld, so it too is, and step 1.1 gives FAN.

F3step 1.1algebra
2.2

If db=d+δb for a fixed b in A, then Ddb=(b,1)Dd(b,1)1 by the semidirect multiplication. Conjugation by (-b,1) therefore identifies their normalizers and quotients, fixes every element of AN, and is the identity on Q. Hence the extension class depends only on [d].

F2step 1.1algebra
3.1

In the quotient Ld/Dd, the elements lˉq form a normalized section and satisfy lˉqlˉr=i(F(q,r))lˉqr. Associativity yields F(q,r)+F(qr,s)=qF(r,s)+F(q,rs) by comparing the two triple products. Also F(1,q)=F(q,1)=0. Thus F is a normalized AN-valued cocycle representing the extension by F2. Different alpha or eta give another normalized section of the same extension; their unique difference b:QAN changes F by δb, as in F2.

F2step 2.1algebra
4.1

For d and e choose the same alpha and compatible eta_d,eta_e; their sum solves the normalizer equation for d+e. The displayed formula then gives Fd+e=Fd+Fe term by term. For d=0 choose eta=0, giving F=0. Independence in steps 2.2 and 3.1 makes these choices irrelevant, proving additivity on cohomology. In particular if N acts trivially on A, invariance is literal equality of crossed maps, so eta=0 is allowed and F=d(f). If N=1 or Q=1, the normalized formulas give the zero transgression.

step 2.1step 3.1step 2.2algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

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
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The kernel of degree-two inflation is the transgression image

Statement

Assume AC. The map inf:H2(Q,AN)H2(G,A) is pullback along π:GQ followed by coefficient inclusion ANA. Then kerinf=imTra. H2 denotes normalized bar cohomology, with its inherited derived interpretation.

Facts & Assumptions

Given: AC, the group extension, module A and B=A^N.

[F1]

For a Q-invariant class, L=NAG(D) projects onto G with kernel B, and Tra is L/D (Low-degree transgression for a group extension).

[F2]

Pullback then abelian coefficient pushout realizes inflation on bar H2 (Pullback and coefficient pushout realize bar cohomology maps).

Proof

1.1

For a transgression class let E0=L/D. Its pullback to G is isomorphic to L by l(lD,p(l)). Injectivity follows from Dkerp=1. For a pair (lD,g) in the pullback, p(l)1gN and multiplication by its unique lift in D corrects p(l) to g, proving surjectivity. This isomorphism fixes the kernel B. Pushing L out to A gives the group (AL)/{(b,(b,1)):bB}. The homomorphism (a,l)(a,1)l onto AG has exactly that kernel: its value is the identity only if l=(a,1)B. It is onto since L maps onto G. Thus the inflated extension is split, and its class is zero.

F1F2givenalgebra
1.2

Conversely let 0Bi0E0Q1 have zero inflated class. Form P=E0×QG and E=(AP)/S, S={(b,(i0(b),1)):bB}. By F2 this is the inflated extension. The map j:PE, p[(0,p)], is injective, since membership of (0,p) in S forces b=0 and p=1. Its intersection with A is precisely B. In P the subgroup U={(1,n):nN} is normal, has trivial intersection with B and projects isomorphically onto N. Put D=j(U).

F2givenalgebra
2.1

The normalizer of D in E is exactly j(P). One inclusion follows because U is normal in P. Every e in E is a product a j(p); if e normalizes D then a does. Conjugation by a sends the unique D-element over n to itself exactly when na=a for every n, because its commutator is the kernel element ana. Hence such a belongs to B, already in j(P), proving the other inclusion. Therefore NE(D)/D=j(P)/j(U)E0 via the first projection of P. This isomorphism fixes the identified B and Q.

step 1.2algebra
3.1

Since the inflated class is zero, E is equivalent to the split extension AG by the classification implicit in F2. Carry D through this equivalence. It is the graph of a crossed map d on N, and its normalizer projects onto G, so the normalizer equation of F1 shows [d] is Q-invariant. Step 2.1 identifies its normalizer quotient, with both kernel and quotient fixed, with the original E0. Hence Tra[d]=[E0]. Together with step 1.1 this proves both inclusions. In particular no injectivity of H2(G,B)H2(G,A) was used.

F1F2step 1.1step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-09Open item page →

The inflation–restriction–transgression five-term sequence

Statement

Assume AC. For every group extension 1NGQ1 and left G-module A, the sequence 0H1(Q,AN)infH1(G,A)resH1(N,A)QTraH2(Q,AN)infH2(G,A) is exact at every term having a following displayed arrow. Tra uses the normalizer quotient and its printed DHW cocycle sign; degree-two inflation includes coefficient inclusion. Cohomology is normalized bar cohomology, with its inherited derived interpretation. No exactness assertion at the last term is intended.

Facts & Assumptions

Given: AC, the extension and module A.

[F1]

Inflation is injective and its image is the kernel of restriction (Degree-one inflation–restriction is exact).

[F2]

The kernel of Tra is the restriction image (The kernel of transgression is the image of restriction).

[F3]

The kernel of degree-two inflation is the image of Tra (The kernel of degree-two inflation is the transgression image).

Proof

1.1

Use the degree-one inflation and restriction formulas with coefficients ANA. F1 gives injectivity of the first arrow and exactness at H1(G,A). Its codomain for restriction is precisely H1(N,A)Q, the domain of Tra in F2.

F1F2given
2.1

F2 gives exactness at H1(N,A)Q. F3 applies to the same normalizer transgression and the pullback/coefficient-inclusion inflation and gives exactness at H2(Q,AN). These cover every asserted location, including zero composites. No result about the cokernel of the final map is used or claimed. For N=1 the two inflation maps are identities and H1(N,A)=0; for Q=1 the restriction map is the identity and both positive-degree Q groups vanish, so the degenerate sequences agree.

F2F3step 1.1algebra

5 · Examples, counterexamples and false statements

None yet.

Sources