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
- Abelian Categories
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Derived Functors
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Cohomology as a Derived Functor
- Group Extensions Complements and Schur Zassenhaus
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits and Colimits
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Semidirect Products, Automorphism Groups and Split Extensions
- Subobject Lattices Generators and the Grothendieck Axioms
- Suprema and Infima
- Tensor Products of Modules
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Universal Properties, Representables and the Yoneda Lemma
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
Diagonal bar coinvariants compute group homology
Statement
Assume DC and the supplied projective-resolution convention for derived group homology. For every left -module , is naturally the homology of , with diagonal left action and alternating vertex-deletion differential. Equivalently it is computed by , where .
Facts & Assumptions
Given: DC, a group G, a left module M, and supplied left projective resolution P of M.
The derived convention computes homology of (Group homology as a derived functor).
The homogeneous bar complex is an augmented free resolution (The bar complex is a free resolution of the trivial module).
Normalization is a chain-homotopy equivalence (Normalized and unnormalized bars are homotopy equivalent).
Projectivity lifts the identity through any epimorphism onto the object (Projective object).
DC is the axiom retained in the supplied derived-resolution convention (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Proof
Turning a left module into a right module by preserves exactness and takes the regular free left module to a free right module (send the basis coordinate g to ). Thus the normalized bar complex is a free right resolution: normalization preserves exactness, and its nondegenerate orbits supply a free basis.
Put and with differential and . Then . Tensor with , a free right module, preserves exactness: each finite-support cycle has a primitive by lifting only its finitely many nonzero coordinates. Each projective is a retract of the free module on its underlying set: lift its identity through the canonical surjection. Tensor with 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 , and augmented rows are exact with left edge .
The map sending to its diagonal orbit class is well-defined: and are in the same orbit. Conversely in the balanced tensor product since . 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.
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 . At its largest remaining p, the cycle equation says , because the component from p+1 is zero. Exactness supplies with . Subtract ; 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.
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 . DC is the inherited resolution-comparison assumption; the finite elimination in step 3.1 adds no arbitrary family of choices.
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 all complexes are zero, and for normalized bars vanish in positive degrees.
Finite-index transfer on normalized bar chains
Definition
Use diagonal bar chains for a left -module , with the DC and supplied-resolution convention when identifying their homology with derived homology. Let have finite index. Choose representatives of the right cosets , with . Write with and . Transfer is For trivial coefficients, in inhomogeneous coordinates set , and . Then A tuple with an identity entry in inhomogeneous coordinates is zero. Well-definedness and the chain-map property are supplied by the following lemma.
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.
Transfer is the finite sum using the vertex retraction r and coefficients tm (Finite-index transfer on normalized bar chains).
Proof
The retraction satisfies for , since . For and write . Right multiplication by x permutes the right cosets, so permutes T. The t-summand on is , equal in H-coinvariants to the -summand of the original chain. This proves diagonal invariance and well-definedness.
For two H-equivariant vertex maps f,u define the prism . Expansion gives : 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 . Equivariance makes this descend to diagonal coinvariants. If , each prism summand has either an adjacent equal f-pair or an adjacent equal u-pair, so it also descends to normalization.
For each deletion index , deleting the jth vertex of is exactly applying r to the tuple with 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.
Let U be another transversal with retraction u. For each right coset write its representative in U as , . The corresponding U-summand becomes after translating by in the H-coinvariants. Thus compare r and u on the same inputs 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 .
For completeness, in the inhomogeneous tuple , the recursion gives and . 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}.
Corestriction after transfer multiplies by the index
Statement
Let have finite index and M be a left G-module. For every , the composite is multiplication by . 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.
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).
For right-coset representatives , write with ; transfer is the finite sum obtained by applying to the vertices of and using coefficient (Finite-index transfer on normalized bar chains).
Proof
Put . For each define the alternating vertex prism Expanding the vertex-deletion differential cancels every face away from the switch in pairs; the two endpoint faces that survive give where uses and is the -summand of corestriction after the transfer in [F2]. If with and , then permutes , , and both vertex strings and the coefficient change by the same diagonal translation. Hence descends to -coinvariants. Equal adjacent input vertices make every prism summand degenerate, so it also descends to normalized chains. Thus
Each translated summand is in diagonal G-coinvariants. The sum is therefore 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 .
Positive integral homology is annihilated by the group order
Statement
For a finite group G and , , 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.
Inclusion after transfer multiplies by the finite index (Corestriction after transfer multiplies by the index).
Normalized diagonal bars compute group homology (Diagonal bar coinvariants compute group homology).
Proof
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 for n>0.
Apply transfer to . Its index is and the composite factors through the zero group of step 1.1; F1 identifies this composite with multiplication by . Hence it is zero. If G=1, this says the positive homology itself is zero. Degree zero is excluded: there it is .
First integral homology and conjugation coinvariants
Statement
Naturally . If , conjugation induces an -action on and , where is generated by . 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.
Normalized diagonal bars compute homology (Diagonal bar coinvariants compute group homology).
Inhomogeneous normalized chains kill an entry equal to 1 (The normalized homogeneous bar complex).
Proof
In degree one all boundaries to degree zero are zero with trivial coefficients. Degree two has , with . Thus H1 is the abelian group generated by symbols [x] subject precisely to . The assignment induces a map to ; conversely is a group homomorphism to an abelian group, kills every commutator, and factors through . The maps are inverse on generators and commute with group homomorphisms.
For R the isomorphism sends conjugation by f to . Conjugation by an element of R is trivial on this quotient, so the action factors through F/R. Taking coinvariants adds exactly the relations . Since , the resulting quotient is . If R=1 it is zero, and if R=F it is .
Generator differences form a basis of the free-group augmentation ideal
Statement
If F is free on an arbitrary set X, then 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 for and .
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 of the trivial left module.
Reduced words give the free group with no nonempty reduced word equal to 1 (Reduced words form the free group on an alphabet).
Group homology is the homology obtained by tensoring the supplied projective resolution with the right trivial module (Group homology as a derived functor).
A projective object lifts every morphism through an epimorphism (Projective object).
DC is the explicitly assumed axiom in the derived-homology convention (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Proof
For a word , telescoping gives . A positive letter contributes a multiple of , and does too. Every element of augmentation zero is , so . Empty words contribute zero; epsilon is onto since epsilon(1)=1.
Interpret 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.
Write and denote the displayed free left resolution by . Turn it into a right resolution by . This preserves the underlying exact sequence. Each left regular summand becomes a right regular summand by the coordinate map ; thus , , and the right differential sends the basis vector indexed by x to . 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 lifts its identity through the canonical surjection from the free left module on its underlying set, making a retract of that free module. Consequently tensoring with 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.
Form for , with and . These differentials anticommute, so defines the direct-sum total complex. The two augmentations give degreewise surjective chain maps and , zero off q=0 and p=0 respectively. By step 3.1, all augmented columns and all augmented rows are exact. Hence , viewed columnwise with its degree-zero column term replaced by the augmentation kernel, has exact columns; similarly has exact rows.
Both kernel total complexes are acyclic by the following finite argument. For a total n-cycle in , 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 , 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.
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 under the assumed DC and supplied-resolution convention.
The differential of sends every to zero. Its only nonzero terms are in degree one and in degree zero, proving the asserted homology groups. If X is empty, F=1 and the degree-one term is zero.
The low-degree filtration sequence of a first-quadrant bicomplex
Statement
Let , , be a bicomplex with , , . Set , , and . Then there is a natural exact sequence The filtration is . 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.
A differential has square zero (Chain complex in an abelian category).
Homology is cycles modulo boundaries (Homology object of a chain complex).
Proof
The identity makes T a chain complex, and h lowers p while v preserves it, so is a subcomplex. The quotient 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.
A class in is represented by with for some . Set . Indeed . Replacing y by another such lift changes hy by h of a vertical cycle, zero in E2. Replacing x by with , changes a compatible y to ; its h-image is unchanged. These are precisely the vertical-boundary and horizontal-boundary changes allowed in . Hence d2 is a well-defined homomorphism.
A total 2-cycle has components with and . Define . A total 3-boundary changes x by from and , so e2 is well-defined. Its image is in the kernel of d2. Conversely if , choose y as in step 2.1. Then for a vertical cycle and . The triple is a total cycle and maps to [x]. This proves exactness at .
A vertical cycle is a total cycle; define . Replacing z by with adds the total boundary , so j is well-defined on . If z=hy as in step 2.1, then , proving . Conversely, if , its p=1 component gives and its p=0 component gives . Therefore . This proves exactness at .
A total 1-cycle satisfies . Define . Boundaries change a by , so e1 is well-defined. Every representative a admits b with , hence e1 is onto. Clearly . If , write with , . Subtract from ; the result is , a vertical cycle, hence in the image of j. This proves exactness at and at the final nonzero term.
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 and 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.
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.
The free-presentation Lyndon bar bicomplex
Definition
Let be a free presentation (here R denotes the normal subgroup, not a ring). Under the DC and supplied-resolution homology convention put , a left -module, and Then for the p-filtration, and . The degree-one edge maps are the homomorphism induced by the subgroup inclusion and the quotient homomorphism .
Facts & Assumptions
Given: The free presentation and DC with supplied homology resolutions; normalized bars carry the vertex-deletion differential.
Normalized right bars and finite augmented tensor comparisons compute homology (Diagonal bar coinvariants compute group homology).
H1 is naturally abelianization and conjugation coinvariants are R/[F,R] (First integral homology and conjugation coinvariants).
The anticommuting total complex has the displayed low-degree filtration maps (The low-degree filtration sequence of a first-quadrant bicomplex).
A presentation gives a free group with its normal relation subgroup and quotient (Group presentation by generators and relations).
Proof
Normality of R makes left F-translation on R-orbits factor through G. A nondegenerate F-tuple has a unique form ; hence its R-orbit is specified by and the relative tuple . Thus is canonically free over on these relative tuples. Both differentials are well-defined, square to zero, and anticommute because the vertical sign changes when p decreases.
To identify 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 preserves exactness even without selecting representatives of all orbits at once. The augmented complex is exact also after restriction to R. Form . Its exact augmented rows and columns give, by the finite elimination in F1, . Applying the same comparison to shows that the isomorphism is induced by the literal inclusion of R-tuples.
For f in F, the maps on R-vertices and into F are equivariant for the same conjugated R-action. The alternating prism between them, , 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 induced by left f is conjugation by f on . Elements of R already act trivially on C, so this is the stated G-action.
For fixed q, the horizontal complex has zero positive homology since C_q is free; its zero homology is . 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 (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 , and F3 applies.
The map from to total H1 sends the bar cycle , r in R, to . The horizontal augmentation sends this to , which represents r in . F2 identifies its domain with R/[F,R], so this edge is the homomorphism induced by the subgroup inclusion ; it is not asserted to be injective.
For arbitrary f in F put and , . Balancing uses , so . Thus y-x is a total cycle whose horizontal augmentation represents [f]. The vertical augmentation sends it to , representing in . 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.
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.
Free-presentation total homology and its degree-one edges
Statement
For the free-presentation bicomplex, for , , , and . 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.
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).
A free group has a length-one free resolution (Generator differences form a basis of the free-group augmentation ideal).
H1(R) conjugation coinvariants equal R/[F,R] (First integral homology and conjugation coinvariants).
Proof
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 . Hence the asserted total vanishing holds even for an infinite free generating set.
The zero homology of R with trivial integers is : every vertex is identified, and each degree-one boundary is a difference of vertices. Conjugation fixes this generator. Consequently . Also by F3. The edge calculations of F1 send r to its class in and f to its image in , with positive signs.
The free-presentation homology five-term sequence
Statement
For a free presentation there is a natural exact sequence The last two nonzero arrows are induced by inclusion and quotient; d2 is the filtration transgression defined by . Retain DC and supplied-resolution homology conventions.
Facts & Assumptions
Given: The free presentation and the stated homology conventions.
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).
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).
The free-presentation bicomplex has anticommuting component differentials and with the stated total complex and edge maps (The free-presentation Lyndon bar bicomplex).
Proof
Apply F2 to the first-quadrant free-presentation bicomplex. Substitute , , , and 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.
In the bicomplex of [F3], represent a class in by with for some , and define . This is a vertical cycle because . Replacing by another lift changes by the horizontal boundary of a vertical cycle. Replacing by , with and , permits the compatible replacement and leaves unchanged. Thus the displayed formula is well-defined.
This is injective here. If in , write for a vertical cycle and . Then is a total 2-cycle mapping to . Since by [F1], its class and hence vanish. Moreover the edge map sends a vertical cycle to the total cycle . The equation follows from . Conversely, if , write with , , and . Its components give and , hence . This proves exactness at the first two nonzero terms for the stated representative formula; [F2] supplies exactness at the remaining terms.
The edge computations in F1 identify the next arrows with r mapped into 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 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 .
Crossed homomorphisms and first cohomology
Definition
For a left G-module A (written additively), put Define . It agrees with normalized bar ; 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.
The inhomogeneous coboundary is the alternating multiplication formula (Inhomogeneous group cochains).
Normalized inhomogeneous cochains compute group cohomology under its inherited conventions (Normalized cochains compute group cohomology).
Proof
In degrees zero and one the differential reads and . Thus is exactly the crossed-homomorphism identity. Setting g=h=1 gives d(1)=0, so every crossed homomorphism is normalized. Also , so every principal map is crossed. Both sets are additive groups and the principal maps form a subgroup.
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 . For G=1 or A=0 it is zero.
Degree-one restriction, inflation and quotient action
Definition
For and a left G-module A, let , with action for any lift g of q. Define Inflation starts with crossed maps . The last formula is a G-action on crossed maps ; 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.
Degree-one maps and the quotient action are well-defined
Statement
The formulas define homomorphisms , , and a Q-action on . 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.
Restriction, inflation and conjugation are given by the displayed crossed-map formulas (Degree-one restriction, inflation and quotient action).
Proof
If a is N-fixed, then , 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 . For a crossed map c into , ; hence its inflation is crossed. Principal c from a in inflates to . Restriction plainly preserves the crossed identity and sends the principal map from a to the principal map from the same a.
For , write , . Then , so the action preserves crossed maps. It sends to and satisfies by substitution. For , using gives . Hence N acts trivially on H1, and the action there factors through Q.
For a global crossed map D on G the identical expansion gives . Consequently conjugation changes its restriction by the principal map , 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.
Degree-one inflation–restriction is exact
Statement
For every extension and left G-module A, the bar-cohomology sequence 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.
The displayed maps are homomorphisms with the stated domains and codomains (Degree-one maps and the quotient action are well-defined).
Proof
If an inflated c is principal, say , restriction to N gives for every n, because c(1)=0. Thus 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.
Conversely let D restrict to a principal map . Replace D by , so . For n in N, , and . But , so these equations also give . Thus is constant on quotient fibers and takes values in . Define c(q) as this unique common value; no representatives need be chosen. For any g,h above q,r the crossed identity yields . Hence and [D] lies in its image.
Bar two-cocycles classify abelian-kernel extensions
Statement
Assume AC. For a group G and a fixed left G-module A, normalized bar is in bijection with equivalence classes of extensions 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.
The bar coboundary in degree two is the alternating action/multiplication formula (Inhomogeneous group cochains).
Normalized cochains compute H2 under the inherited convention (Normalized cochains compute group cohomology).
Equivalence fixes the identified kernel and quotient (Equivalence of group extensions with fixed kernel and fixed quotient).
Every family of nonempty sets has a choice function (The Axiom of Choice).
Proof
For an extension E, apply AC to the nonempty fibers of and set . Unique kernel coordinates define f by . Then . Associativity of gives , exactly . The action term follows from , the prescribed action.
Conversely, for a normalized cocycle f define with . The first coordinates of the two triple products differ by , so multiplication is associative. The identity is (0,1). The inverse is ; the right product is the identity, and the left product is too since the cocycle identity gives . Inclusion and projection to G are exact and conjugation induces ga.
A new normalized section changes f to , where . The map , is an isomorphism: substitution in the two multiplication laws gives first coordinate 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).
The map , , 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.
If the class is zero, choose a normalized b with ; the section 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.
Pullback and coefficient pushout realize bar cohomology maps
Statement
Assume AC. Pulling back an abelian-kernel extension along represents . Pushing it out along a G-module map represents . 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 , a group map alpha and a module map u.
An extension is classified by its normalized factor-set class, with section changes adding coboundaries (Bar two-cocycles classify abelian-kernel extensions).
AC supplies normalized sections from the nonempty fibers (The Axiom of Choice).
Proof
The pullback is . Its projection to H is onto, its kernel is , and the conjugation action is the restricted action. Choose a normalized section s of E using AC; is a section of P. Its factor set is . By F1 this represents the bar pullback, including when alpha is not injective or surjective.
Let E act on B through p and form . The subgroup is normal: conjugation by sends its a-element to the one indexed by , since i(A) acts trivially on B and u is equivariant. Set . The map , , is injective, because intersection with S forces i(a)=1 and a=0. Projection to G is onto, and any kernel element equals . Thus its kernel is exactly B, with the prescribed action.
The section has product , hence factor set u f. It represents the coefficient map by F1. Replacing f by replaces the two resulting cocycles by and , respectively. Extension equivalences induce the same maps by and , so both constructions are independent of representatives. No injectivity of the coefficient map on H2 is claimed.
Low-degree transgression for a group extension
Definition
Assume AC. For , a left G-module A and , put and . Define to be the class of It is a well-defined homomorphism to normalized bar . Explicitly choose normalized and with ; put . Then Tra is represented by 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].
The conjugation action on crossed-map classes factors through Q (Degree-one maps and the quotient action are well-defined).
Normalized factor sets classify the extensions with fixed action (Bar two-cocycles classify abelian-kernel extensions).
AC chooses elements of arbitrary nonempty indexed families (The Axiom of Choice).
Proof
The crossed identity makes a subgroup mapping isomorphically onto N. In , conjugating by (a,g) gives . Thus exactly when for every n. By invariance in F1 there exists such an a for each g, so is onto. Setting g=1 shows . Its elements over N are precisely , 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 is , the quotient Q-action.
Apply AC to the fibers of , normalizing . For each q the set of a solving the normalizer equation for is nonempty by step 1.1. Apply AC to these Q-indexed sets and normalize , which is a solution. Then . For , direct multiplication gives with exactly the F printed in the Definition. All factors except possibly are in , so it too is, and step 1.1 gives .
If for a fixed b in A, then by the semidirect multiplication. Conjugation by (-b,1) therefore identifies their normalizers and quotients, fixes every element of , and is the identity on Q. Hence the extension class depends only on [d].
In the quotient , the elements form a normalized section and satisfy . Associativity yields by comparing the two triple products. Also F(1,q)=F(q,1)=0. Thus F is a normalized -valued cocycle representing the extension by F2. Different alpha or eta give another normalized section of the same extension; their unique difference changes F by , as in F2.
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 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 . If N=1 or Q=1, the normalized formulas give the zero transgression.
The kernel of transgression is the image of restriction
Statement
Assume AC. With the displayed crossed-map and transgression conventions, 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.
Transgression is the extension with kernel (Low-degree transgression for a group extension).
Restriction is defined into invariant H1 and its image has the stated crossed-map interpretation (Degree-one inflation–restriction is exact).
The class of an extension is zero if and only if it has a homomorphic section (Bar two-cocycles classify abelian-kernel extensions).
Proof
If d is the restriction of a global crossed map c, its graph is a subgroup of and . The latter is normal in C because N is normal in G. Thus , and is a subgroup of meeting the kernel 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.
Conversely if Tra[d]=0, let be the image of a splitting, supplied by F3. Take its full inverse image C in . It contains . It meets A trivially: an element of lies in by F1 and has class in , so lies in . The projection is onto: given g, select one member of C whose projection has quotient pi(g), then multiply it by the unique element of correcting its projection to g. This is an elementwise existence proof, not a family of selections. Hence is an isomorphism and its inverse is the graph of a uniquely defined function c:G to A. The subgroup law gives , and gives . Thus [d] is in the restriction image.
The kernel of degree-two inflation is the transgression image
Statement
Assume AC. The map is pullback along followed by coefficient inclusion . Then . H2 denotes normalized bar cohomology, with its inherited derived interpretation.
Facts & Assumptions
Given: AC, the group extension, module A and B=A^N.
For a Q-invariant class, projects onto G with kernel B, and Tra is L/D (Low-degree transgression for a group extension).
Pullback then abelian coefficient pushout realizes inflation on bar H2 (Pullback and coefficient pushout realize bar cohomology maps).
Proof
For a transgression class let E0=L/D. Its pullback to G is isomorphic to L by . Injectivity follows from . For a pair (lD,g) in the pullback, 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 . The homomorphism onto has exactly that kernel: its value is the identity only if . It is onto since L maps onto G. Thus the inflated extension is split, and its class is zero.
Conversely let have zero inflated class. Form and , . By F2 this is the inflated extension. The map , , 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 is normal, has trivial intersection with B and projects isomorphically onto N. Put .
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 for every n, because its commutator is the kernel element . Hence such a belongs to B, already in j(P), proving the other inclusion. Therefore via the first projection of P. This isomorphism fixes the identified B and Q.
Since the inflated class is zero, E is equivalent to the split extension 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 . Together with step 1.1 this proves both inclusions. In particular no injectivity of was used.
The inflation–restriction–transgression five-term sequence
Statement
Assume AC. For every group extension and left G-module A, the sequence 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.
Inflation is injective and its image is the kernel of restriction (Degree-one inflation–restriction is exact).
The kernel of Tra is the restriction image (The kernel of transgression is the image of restriction).
The kernel of degree-two inflation is the image of Tra (The kernel of degree-two inflation is the transgression image).
Proof
Use the degree-one inflation and restriction formulas with coefficients . F1 gives injectivity of the first arrow and exactness at . Its codomain for restriction is precisely , the domain of Tra in F2.
F2 gives exactness at . F3 applies to the same normalizer transgression and the pullback/coefficient-inclusion inflation and gives exactness at . 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.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Loh, Group Cohomology, Definitions 1.7.12–13 and Theorem 1.7.15 pp.63–64; Theorem 3.2.18 pp.129–132
- Weibel, An Introduction to Homological Algebra, Chapter 6, Sections 6.4–6.8
- Loh, Group Cohomology, Definitions 1.7.12–13 and Theorem 1.7.15 pp.63–64; Theorem 4.1.18 pp.129–132
- Weibel, An Introduction to Homological Algebra, Definition 6.1.2 and Proposition 6.2.6–Corollary 6.2.7, pp.161,169
- Sharifi, Homological Algebra, Lemma 3.5.8, Proposition 3.5.9 and Remark 3.5.11, pp.66–68
- Dekimpe–Hartl–Wauters, A seven-term exact sequence for the cohomology of a group extension, Sections 2–5 pp.2–11 and Section 10.2 p.21