Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Homological Lyndon–Hochschild–Serre spectral sequence for group extensions

Statement

Assume the Axiom of Choice. For every short exact sequence of discrete groups 1⟶N⟶G⟶Q⟶1, the homological Serre spectral sequence of the induced map of classifying spaces has Ep,q2≅Hp ⁣(Q;Hq(N;Z))⟹Hp+q(G;Z). Here Hp(Q;M) denotes homology of BQ with the local coefficient system determined by the left Q-module M, and group homology uses the bar classifying spaces. The coefficient group Hq(N;Z) has the Q-action induced by conjugation by lifts in G, and convergence is strong with the finite Serre filtration in each total degree.

Facts & Assumptions

Given: Full AC and a short exact sequence 1→N→G→Q→1 of discrete groups.

[A1]

Full AC, written AC, is The Axiom of Choice.

[L2]

Full AC implies DC: apply AC to the family of nonempty successor sets of a serial relation, choose one initial element, and recursively follow the resulting choice function. The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[L1]

Under AC, Milnor's classifying space BG is a connected CW model with π1(BG)≅G and πk(BG)=0 for k>1. The classifying space of a discrete group is a K(G,1)

[F1]

The homotopy long exact sequence of a Serre fibration computes the homotopy groups of its fiber. Long exact sequence of homotopy groups of a fibration

[F2]

For a Serre fibration over a path-connected CW complex, the homological Serre spectral sequence has Ep,q2=Hp(B;Hq(F;Z)) and strongly converges to the homology of the total space. Homological Serre spectral sequence

[F3]

The homology of a classifying space with the local system determined by a module is the usual bar-model group homology; the derived-functor identification in the library assumes DC. Diagonal bar coinvariants compute group homology, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain

[F4]

Connected CW models with the same identified fundamental group and vanishing higher homotopy groups are homotopy equivalent under AC. Existence and homotopy uniqueness of Eilenberg--Mac Lane spaces

[F5]

External input: For a map between CW complexes, its mapping-path homotopy fiber has CW homotopy type. This is the homotopy-fiber consequence of Milnor's compact-domain mapping n-ad theorem, stated explicitly in Hatcher's §4.3; the hypotheses here are satisfied by the classifying CW models in step 1.1. [Hatcher §4.3, p. 408], [Milnor, Theorem 3, pp. 276–280]

[F6]

Classifying maps commute up to based homotopy with a based map and its induced fundamental-group homomorphism. Classifying maps are natural up to based homotopy

Proof

Given: The group extension and [A1].

1.1A1L1givenconstruct

Choose connected CW models from [L1]. Build a based map BG→BQ inducing G→Q by mapping the one-skeleton to loops representing the quotient images, filling each two-cell because its attaching word maps to the identity in Q, and extending over each higher cell because πk(BQ)=0 for k>1. The finite cell extensions are simultaneous over a set of cells; [A1] supplies those choices. Replace this map by its mapping-path fibration p:E→BQ; the total space E is homotopy equivalent to BG, and the fiber F is its homotopy fiber.

2.1L1F1F4F5step 1.1

The map on fundamental groups is the quotient G→Q. Exactness of [F1] gives π0(F)={∗}, π1(F)≅ker⁡(G→Q)=N, and πk(F)=0 for every k>1, because both BG and BQ have zero higher homotopy groups by [L1]. By the external input [F5], F has CW homotopy type. Choose a connected CW model F′≃F and identify π1(F′) with N. The uniqueness theorem [F4] gives F′≃BN, so Hq(F;Z)≅Hq(N;Z) for every q.

3.1L1F1F4F6step 2.1algebra

A lift g∈G of a loop class q∈Q=π1(BQ) transports the fiber fundamental group by n↦gng−1. Choose a based homotopy equivalence h:F′→F as in step 2.1 and a based homotopy inverse hˉ:F→F′, using the basepoint path supplied by the transport. The map Tg′=hˉ∘Tg∘h is a based self-map of F′ inducing cg(n)=gng−1 on π1(F′)≅N. By [F6], the classifying map c:F′→BN satisfies c∘Tg′≃B(cg)∘c, so the monodromy on Hq(F′) agrees under h with the bar-classifying-space map induced by cg. If a different lift is chosen, it differs by an element of N and changes this map by an inner automorphism of N. Inner conjugation is homotopic to the identity on the bar classifying space: the conjugation functor on the one-object category of N is naturally isomorphic to the identity by the conjugating element. Hence the induced action on Hq(F;Z)≅Hq(N;Z) depends only on q, and is exactly the stated Q-module action.

4.1F2step 2.1step 3.1

Apply [F2] to p:E→BQ. By step 2.1 the fiber homology is Hq(N;Z), and step 3.1 identifies its monodromy local system with the conjugation action. Therefore the E2 page is Hp(Q;Hq(N;Z)) and the spectral sequence strongly converges to Hp+q(E;Z).

5.1A1L2F3F4step 1.1step 4.1∎

The total-space equivalence from step 1.1 identifies Hp+q(E;Z) with Hp+q(BG;Z). By [F4], this classifying CW model is homotopy equivalent to the bar model used in [F3], so its homology is Hp+q(G;Z). The base and fiber are connected CW models, so the Serre filtration is first quadrant and finite on each total-degree diagonal. AC supplies the DC hypothesis of [F3] by [L2]. The fiber action and Serre filtration introduce no further choice.

Depends on

Used by

Dependency tree · two levels

54 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources