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.

✓ 21 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 14 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Schur Multipliers and Universal Central Extensions

1 · Prerequisites

2 · Summary

The convention throughout is M(G)=H2(G;Z). The degree-two cohomology sequence classifies central extensions with the Axiom of Choice and resolution data specified in its statement; its splitting is not natural. The multiplier computations and universal-extension constructions retain their individual choice and resolution hypotheses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Schur multiplier

Definition

M(G)=H_2(G;Z), not H²(G,C×) by definition.

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

Free-presentation kernel data

Definition

A free presentation is 1→R→F→G→1 with F free and R normal.

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

Every finite group is finitely presented

Statement

Every finite group has finitely many generators and relators.

Proof

Given: Let G be finite.

1.1given

Use one generator xg for each g∈G and the finitely many relations xgxh=xgh and x1=1.

2.1step 1.1algebra∎

Every word reduces to one xg, so the presented group maps bijectively to G and is a finite presentation.

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

The Hopf-formula quotient exists

Statement

[F,R] is normal and contained in R∩[F,F].

Proof

Given: Let 1→R→F→G→1 be a free presentation.

1.1given

Normality of R gives [F,R]≤R, and the commutator identities make [F,R] normal in F.

2.1step 1.1algebra∎

Every generator [f,r] is in [F,F], so [F,R]≤R∩[F,F] and the quotient exists.

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

Hopf-formula quotient

Definition

For a free presentation 1→R→F→G→1, the Hopf quotient is

R∩[F,F][F,R].

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-26 (gpt-6-sol)Open item page →

Low-degree sequence of a free presentation

Statement

Assume the Axiom of Dependent Choice and supplied projective-resolution data for the group-homology construction. For an exact sequence 1→R→F→G→1 with F free, there is an exact sequence

0→H2(G;Z)→R/[F,R]→Fab→Gab→0.

Facts & Assumptions

Given: Dependent choice, the supplied group-homology resolution data, and a free presentation 1→R→F→G→1.

[L1]

Under the stated conventions, the free-presentation homology five-term theorem supplies the natural exact sequence 0→H2(G;Z)→R/[F,R]→Fab→Gab→0 (The free-presentation homology five-term sequence).

Proof

technique · direct
1.1L1given

The hypotheses and group-homology conventions are exactly those of [L1]. Its first arrow is the free-presentation transgression, and its remaining arrows come from the inclusion R↪F and quotient F↠G.

2.1L1step 1.1∎

The exactness and initial injection asserted by [L1] therefore give the displayed sequence under the retained dependent-choice and resolution hypotheses.

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

Hopf formula for the Schur multiplier

Statement

Assume the Axiom of Dependent Choice and supplied projective-resolution data for group homology. For G=F/R with F free, M(G)≅(R∩[F,F])/[F,R].

Proof

Given: Dependent choice, the supplied group-homology resolution data, and a free presentation G=F/R.

1.1givenalgebra

Under the stated hypotheses, Low-degree sequence of a free presentation gives an injection H2(G;Z)→R/[F,R] whose image is the kernel of R/[F,R]→Fab. This kernel is (R∩[F,F])/[F,R], since the map sends r[F,R] to r[F,F].

2.1step 1.1algebra∎

Exactness identifies that kernel with H2(G;Z)=M(G) by Schur multiplier, giving the stated isomorphism.

CorollaryStatement: Literature-sourcedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

Hopf formula is presentation-independent

Statement

Assume dependent choice and supplied projective-resolution data for group homology. Then Hopf's quotient is independent of the free presentation through M(G).

Facts & Assumptions

Given: Dependent choice, the supplied group-homology resolution data, and two free presentations G=F/R=F′/R′.

Proof

technique · direct
1.1givenalgebra

For each presentation, the conditional five-term sequence injects H2(G;Z) into R/[F,R] with image the kernel of R/[F,R]→Fab. That kernel is (R∩[F,F])/[F,R], since the map sends r[F,R] to r[F,F]. By the definition of the Schur multiplier this gives (R∩[F,F])/[F,R]≅M(G), and the same argument gives (R′∩[F′,F′])/[F′,R′]≅M(G).

2.1step 1.1algebra∎

Composing the first isomorphism with the inverse of the second identifies the two presentation quotients. Thus their isomorphism type depends only on G, through M(G).

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Multiplier of a finitely presented group

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. A finitely presented group has finitely generated Schur multiplier.

Facts & Assumptions

Given: The stated choice and resolution hypotheses. Let G=F/R have finitely many generators and finitely many defining relators. Choice implies the dependent-choice premise of Hopf formula for the Schur multiplier.

Proof

technique · direct
1.1givenalgebra

Modulo [F,R], every conjugate of a defining relator has the same class as that relator. Since R is the normal closure of the finite relator set, their images generate R/[F,R]. This quotient is abelian because [R,R]≤[F,R].

2.1step 1.1algebra∎

Hopf's formula, under the stated hypotheses, identifies M(G) with the subgroup (R∩[F,F])/[F,R] of this finitely generated abelian group. Subgroups of finitely generated abelian groups are finitely generated, so M(G) is finitely generated.

PropositionStatement: AI-adaptedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

Multiplier of a free group

Statement

Assume the Axiom of Dependent Choice and supplied projective-resolution data for group homology. Then M(F)=0 for every free group F.

Proof

Given: The stated choice and resolution data, and the free presentation F=F/1.

1.1given

Hopf’s numerator is 1∩[F,F]=1 and its denominator is [F,1]=1.

2.1step 1.1algebra∎

Thus the Hopf quotient, and hence M(F), is zero.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Multiplier of a cyclic group

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. Then M(C)=0 for every cyclic group C.

Proof

Given: The stated choice and resolution hypotheses. For finite cyclic Cn, take F=⟨x⟩ and R=⟨xn⟩; the infinite cyclic group has R=1. Choice implies the dependent choice required by Hopf formula for the Schur multiplier.

1.1given

The group F is abelian, hence R∩[F,F]=1.

2.1step 1.1algebra∎

Under the stated hypotheses, Hopf's formula gives M(C)=(R∩[F,F])/[F,R]=0 in both cases. The trivial group is also cyclic; its free presentation F=R=1 gives the same result.

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

Exterior square

Definition

∧²A=(A⊗_Z A)/⟨a⊗a:a∈A⟩.

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

Alternating universal property

Statement

Alternating bilinear maps A×A→B factor uniquely through ∧²A.

Proof

Given: Let b:A×A→B be alternating and bilinear.

1.1given

The tensor universal property gives a unique map A⊗A→B carrying a⊗a′ to b(a,a′).

2.1step 1.1algebra∎

Because b(a,a)=0, it kills the defining subgroup and factors uniquely through ⋀2A.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Multiplier of an abelian group

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. For every abelian group A, there is a natural isomorphism M(A)≅⋀2A.

Facts & Assumptions

Given: The stated choice and resolution hypotheses and a free presentation A=F/R. Choice supplies a free presentation if one has not been supplied, and implies the dependent-choice hypothesis of Hopf formula for the Schur multiplier. Since A is abelian, [F,F]≤R.

Proof

technique · direct
1.1givenalgebra

In F/[F,R], the subgroup R/[F,R] is central. Since [F,F]≤R, this quotient has nilpotency class at most two. Thus its commutator is alternating and bilinear. Changing either lift by an element of R does not change its commutator, so the rule xˉ∧yˉ↦[x,y][F,R] defines a surjective homomorphism Φ:⋀2A→[F,F]/[F,R].

1.2givenalgebra

To check that there are no further relations, write X=Fab. The class-two quotient F/[F,[F,F]] is the free class-two group on the chosen free basis. Its central commutator subgroup is ⋀2X: ordering the basis, every commutator word reduces using [xy,z]=[x,z][y,z] and [x,yz]=[x,y][x,z] to a product of basic commutators [xi,xj] with i<j. Their independence follows by mapping the basis into the explicit class-two group (X⊕⋀2X,⋅) with (u,a)⋅(v,b)=(u+v,a+b+∑i>juivj(ei∧ej)); each word has finite support, so the displayed sum is finite.

2.1step 1.1step 1.2algebra∎

The image of [F,R] in ⋀2X is generated by x∧r with x∈X and r in the image K of R in X. The alternating universal property identifies (⋀2X)/(X∧K) with ⋀2(X/K)=⋀2A. Hence Φ is injective as well as surjective. Since [F,F]≤R, Hopf formula for the Schur multiplier identifies M(A)=(R∩[F,F])/[F,R]=[F,F]/[F,R] under the stated hypotheses. Presentation maps preserve commutators and exterior products, and the canonical Hopf identification is natural, so the resulting isomorphism is natural in A.

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

Central and stem extensions

Definition

Central means K≤Z(E); stem means K≤Z(E)∩[E,E].

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

Perfect group

Definition

G is perfect if G=[G,G], equivalently G_ab=0.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

Universal central extension

Definition

A universal central extension is initial among central extensions of G over G.

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

Uniqueness of universal central extensions

Statement

A universal central extension is unique up to unique isomorphism over G.

Proof

Given: Let U→G and V→G both be universal.

1.1given

Initiality produces unique maps U→V and V→U over G.

2.1step 1.1algebra∎

Their composites are the unique endomorphisms over G, hence identities; the maps are inverse and unique.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Existence criterion for universal central extensions

Statement

Assume the Axiom of Choice. A group G admits a universal central extension if and only if G is perfect.

Facts & Assumptions

Given: The Axiom of Choice. First suppose u:U↠G is universal. In the converse, Choice supplies simultaneous lifts of the generators of a free presentation into each central extension.

Proof

technique · direct
1.1givenalgebra

For every abelian group A and homomorphism ϕ:G→A, the two maps x↦(u(x),0) and x↦(u(x),ϕ(u(x))) from U to the split central extension G×A→G must agree by universality. Since u is surjective, ϕ=0. Taking A=Gab and ϕ the quotient map gives Gab=0, so G is perfect.

1.2givenconstruct

Conversely, let G=F/R be perfect, using for example the free group on the underlying set of G. Under Choice, Free-presentation construction is universal proves that [F,F]/[F,R]→G is a universal central extension. Its proof identifies the exact use of Choice: lifting every free generator through each central quotient.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the two implications.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

Free-presentation universal extension

Definition

Let 1→R→F→G→1 be a free presentation of a perfect group G. The induced map

[F,F]/[F,R]⟶G

is the free-presentation universal-extension candidate.

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

Free-presentation construction is central

Statement

For perfect G, [F,F]/[F,R]→G is central.

Proof

Given: Let G=F/R be perfect.

1.1given

Perfectness gives F=[F,F]R, so [F,F]/[F,R]→G is onto and has kernel (R∩[F,F])/[F,R].

2.1step 1.1algebra∎

The latter kernel commutes with [F,F]/[F,R], since every [r,f] is killed; therefore the extension is central.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Free-presentation construction is universal

Statement

Assume the Axiom of Choice. If G=F/R is perfect and F is free, then [F,F]/[F,R]→G is a universal central extension.

Facts & Assumptions

Given: A central extension E→G and a free basis of F. The Axiom of Choice supplies simultaneous lifts in E of the images of every basis element, including when the basis is infinite.

Proof

technique · direct
1.1givenchoosealgebra

The chosen basis lifts extend uniquely to a homomorphism h:F→E over G. Every r∈R maps into the central kernel of E→G, so h([F,R])=1. Restricting h to [F,F] therefore gives a homomorphism [F,F]/[F,R]→E over G. Since G is perfect, the displayed source maps onto G, and the preceding central-extension lemma gives its central kernel.

2.1step 1.1algebra∎

If v,w:[F,F]/[F,R]→E are two maps over G, their pointwise ratio v(x)w(x)−1 lies in the central kernel. Centrality makes this ratio a homomorphism to an abelian group. The source is perfect: write elements a,b∈F as a=a′r, b=b′s with a′,b′∈[F,F] and r,s∈R, which is possible because G is perfect; modulo [F,R] one has [a,b]=[a′,b′]. Its generators are thus commutators inside the source. Every homomorphism from it to an abelian group is zero, so v=w. Existence from step 1.1 and this uniqueness prove universality.

CorollaryStatement: Literature-sourcedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)Open item page →

Kernel of the universal central extension

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. For a perfect group G=F/R with F free, the kernel of the free-presentation universal central extension [F,F]/[F,R]→G is naturally isomorphic to M(G)=H2(G;Z).

Proof

Given: Use the stated choice and resolution hypotheses and the free-presentation universal extension of a perfect group G=F/R. Choice supplies the infinite free-basis lifts required by Free-presentation construction is universal and implies the dependent-choice premise of the five-term sequence.

1.1given

Its kernel is (R∩[F,F])/[F,R].

2.1step 1.1algebra∎

Under the stated hypotheses, the free-presentation five-term exact sequence identifies its initial H2(G;Z) with the kernel of R/[F,R]→Fab, namely (R∩[F,F])/[F,R]. This is M(G) by definition.

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

Superperfect group

Definition

Superperfect means H_1(G;Z)=H_2(G;Z)=0.

PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Universal central extension groups are superperfect

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. The total group of a universal central extension is superperfect.

Facts & Assumptions

Given: The stated choice and resolution hypotheses and a universal central extension u:U→G. Choice supplies a free presentation of U and the simultaneous lifts used by the free-presentation universal-extension theorem; it also implies the dependent-choice premise of the kernel identification.

Proof

technique · direct
1.1givenalgebra

For an abelian group A and a homomorphism ϕ:U→A, the maps x↦(u(x),0) and x↦(u(x),ϕ(x)) from U to the split central extension G×A→G are both over G. Universality makes them equal, so every such ϕ vanishes. Taking A=Uab shows that U is perfect.

2.1step 1.1algebra

Let e:E↠U be any central extension. The composite [E,E]→U→G is surjective because e([E,E])=[U,U]=U. If x∈[E,E] maps to 1 in G, then e(x)∈ker⁡u⊆Z(U), whence [x,E]⊆ker⁡e⊆Z(E) and therefore [x,[E,E]]=1. Thus [E,E]→G is a central extension.

3.1step 2.1algebra

Universality of u gives a map s:U→[E,E] over G. Both e∘s and id⁡U are maps from U to the central extension u:U→G over G, so uniqueness gives e∘s=id⁡U. Consequently every central extension of U splits.

4.1step 1.1step 3.1algebra∎

Since U is perfect, the free-presentation theorem under Choice gives a universal central extension v:V→U. Under the resolution hypotheses, its kernel is M(U) by Kernel of the universal central extension. Step 3.1 gives a homomorphic section, so centrality yields V≅M(U)×U. The argument of step 1.1 applied to v makes V perfect. Abelianizing this product gives M(U)=0. Also Uab=0 by step 1.1, so H1(U;Z)=H2(U;Z)=0 and U is superperfect.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Universal coefficients in degree two

Statement

Assume the Axiom of Choice and supplied projective and injective resolution data for group (co)homology. For a trivial G-module A, there is a natural exact sequence

0→Ext⁡Z1(Gab,A)→H2(G;A)→Hom⁡(M(G),A)→0.

It admits a splitting after choices; no natural splitting is asserted.

Facts & Assumptions

Given: The choice and resolution hypotheses above. Use the explicit free bar resolution P∙→Z over ZG, and put C∙=Z⊗ZGP∙. The bar-comparison theorem identifies Hom⁡ZG(P∙,A) with the derived cohomology computed from the supplied injective resolution.

[L1]

The cohomological universal-coefficient theorem gives the natural degree-two short exact sequence for a degreewise free integral chain complex (The universal coefficient theorem for cohomology over a PID).

[L2]

This sequence splits after choices of complements, with no natural splitting asserted (The cohomology universal-coefficient sequence splits nonnaturally).

Proof

technique · direct
1.1L1givenalgebra

Each Cn is free abelian on Gn. Because A has trivial G-action, the tensor-Hom adjunction gives a natural isomorphism Hom⁡Z(C∙,A)≅Hom⁡ZG(P∙,A). The latter cochain complex computes H∗(G;A) by The bar cochain complex computes group cohomology, while H∗(C∙) computes integral group homology under the supplied resolution data. Choice permits [L1] to be applied to the free integral complex C∙. In degree two it gives 0→Ext⁡Z1(H1(G;Z),A)→H2(G;A)→Hom⁡Z(H2(G;Z),A)→0.

2.1L2step 1.1algebra∎

Since H1(G;Z)=Gab and H2(G;Z)=M(G), this is the displayed sequence. The splitting qualification follows from [L2].

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Central extensions of perfect groups

Statement

Assume the Axiom of Choice and supplied projective and injective resolution data for group (co)homology. For a perfect group G and a trivial G-module A, equivalence classes of central extensions of G by A are naturally in bijection with Hom⁡(M(G),A).

Facts & Assumptions

Given: The stated choice and resolution hypotheses, a perfect group G, and an abelian group A with trivial G-action.

Proof

technique · direct
1.1givenalgebra

Perfectness gives Gab=0, hence Ext⁡Z1(Gab,A)=0. The degree-two universal-coefficient sequence therefore identifies H2(G;A) naturally with Hom⁡(M(G),A).

2.1step 1.1algebra∎

The extension-classification theorem identifies H2(G;A) with equivalence classes of extensions inducing the trivial action, namely central extensions. Composing the two bijections proves the claim.

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

Positive-degree homology of a finite group is order-torsion

Statement

For finite G and n>0, ∣G∣ annihilates Hn(G;Z).

Facts & Assumptions

Given: Let G be finite and n>0.

[L1]

Weibel's Theorem 6.5.8 states that ∣G∣ annihilates Hn(G;A) for every finite group G, every G-module A, and every n>0.

Proof

technique · direct
1.1L1given

The cited theorem of Weibel states that, for a finite group G, multiplication by ∣G∣ annihilates Hn(G;A) for every n>0 and every G-module A. Apply it to the trivial module A=Z.

2.1step 1.1∎

Thus multiplication by ∣G∣ is zero on Hn(G;Z), as claimed.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Multiplier of a finite group is finite

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. For finite G, M(G) is finite abelian.

Proof

Given: The stated choice and resolution hypotheses and a finite group G.

1.1given

The finite-presentation lemma gives a finite presentation of G; the finitely-presented-multiplier corollary makes M(G) finitely generated under the stated hypotheses. The finite-group homology torsion lemma says ∣G∣ annihilates this positive-degree integral homology group.

2.1step 1.1algebra∎

A finitely generated abelian group of bounded exponent is finite, so M(G) is finite.

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

Schur covering group

Definition

For finite G, a Schur cover is a stem extension with kernel isomorphic to M(G).

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Existence of Schur covering groups

Statement

Assume the Axiom of Choice and supplied projective-resolution data for group homology. Every finite group has a Schur covering group.

Facts & Assumptions

Given: The stated choice and resolution hypotheses. Let G=F/R be a finite presentation and put A=R/[F,R] and M=(R∩[F,F])/[F,R]. Choice implies the dependent-choice premise of Hopf formula for the Schur multiplier and supports the group-homology data used to identify its kernel with M(G).

Proof

technique · direct
1.1givenalgebra

The quotient A/M≅R/(R∩[F,F]) embeds in the finite-rank free abelian group Fab, so it is free abelian. Thus 0→M→A→A/M→0 splits. Let S/[F,R] be the image of a splitting, a complement to M in A. Because [F,R]≤S≤R, conjugation by any f∈F preserves S, so S is normal in F.

2.1step 1.1algebra∎

The extension R/S→F/S→G is central because [F,R]≤S. Projection A→A/(S/[F,R]) restricts to an isomorphism from M, so R/S≅M≅M(G) by Hopf's formula. Since every element of M comes from R∩[F,F], the kernel R/S lies in [F/S,F/S]. Thus it is a stem extension with multiplier kernel. The kernel is finite by Multiplier of a finite group is finite, hence F/S is finite because G is finite. This is a Schur cover.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Projective representations and the multiplier

Projective factor sets connect to M(G), but K× factor-set theory is intentionally outside this page.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Multiplier defined as H²(G,C×)

Statement

For every group G, the Schur multiplier is defined as H2(G;C×).

Facts & Assumptions

Given: Use the convention in Schur multiplier.

Refutation

technique · direct
1.1given

Schur multiplier defines M(G)=H2(G;Z). The group H2(G;C×) is a degree-two cohomology group with different coefficients and is not the specified definition. No comparison theorem is needed to refute a claim about which definition this library uses.

2.1step 1.1contradiction∎

It is therefore false to present H2(G;C×) as this library's definition of the multiplier.

False statementConstruction: Literature-sourcedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

FALSE: the numerator in Hopf's formula is presentation-independent

Statement

For every pair of free presentations G=F/R=F′/R′ of the same group, the numerator subgroups R∩[F,F] and R′∩[F′,F′] in Hopf's formula are isomorphic.

Facts & Assumptions

Given: The trivial group has free presentations 1=Z/Z and 1=F(a,b)/F(a,b).

[F1]

Hopf's quotient for F/R has numerator R∩[F,F] and denominator [F,R] (Hopf-formula quotient).

[F2]

Reduced words distinguish the nonempty commutator word aba−1b−1 from the identity in F(a,b) (Reduced words form the free group on an alphabet).

[L1]

With dependent choice and supplied resolution data, the quotients (R∩[F,F])/[F,R] from two free presentations are isomorphic through M(G) (Hopf formula is presentation-independent).

Refutation

technique · direct
1.1givenF1algebra

In the first presentation F=R=Z, so the numerator R∩[F,F]=[Z,Z] is trivial.

2.1givenF1F2step 1.1

In the second presentation F=R=F(a,b), so the numerator is [F(a,b),F(a,b)]. It contains the commutator aba−1b−1, which is a nonempty reduced word and hence nonidentity by [F2]. The two numerator groups are therefore not isomorphic.

3.1F1L1step 1.1step 2.1∎

The denominators are respectively trivial and [F(a,b),F(a,b)], so both Hopf quotients are trivial. This agrees with the qualified invariant comparison in [L1]; it does not make their numerators isomorphic.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

Every group has a universal central extension

Statement

Every group has a universal central extension.

Facts & Assumptions

Given: Take the nontrivial abelian group C2.

Refutation

technique · contradiction
1.1givenassume-contraalgebra

Suppose a universal central extension u:U↠C2 exists. The split extension C2×C2→C2 is central. There are two maps over C2 from U to it: x↦(u(x),0) and x↦(u(x),u(x)). They are distinct because u is surjective and C2 is nontrivial.

2.1step 1.1discharge-contradiction∎

This contradicts the uniqueness required of a universal central extension. Thus C2 is a counterexample to the stated assertion, independently of any choice premise.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Every central extension is stem

Statement

Every central extension is a stem extension.

Facts & Assumptions

Given: Consider the split central extension C2→C2×C2→C2.

Refutation

technique · direct
1.1givenalgebra

Its kernel is central, but the total group is abelian, so its commutator subgroup is trivial and does not contain the nontrivial kernel.

2.1step 1.1contradiction∎

The extension is central but not stem, refuting the assertion.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-09-24 (gpt-6-sol)Open item page →

All finite Schur covers are unique

Statement

Assuming the Axiom of Choice and supplied projective-resolution data for group homology, every finite group has a unique Schur covering group up to isomorphism.

Facts & Assumptions

Given: The stated choice and resolution hypotheses. Let V=C2×C2.

Refutation

technique · direct
1.1givenalgebra

The abelian-multiplier theorem gives M(V)≅⋀2V≅C2. In D8=⟨r,s∣r4=s2=1, srs=r−1⟩, the center and commutator subgroup are both ⟨r2⟩≅C2, and the quotient is V. In Q8={±1,±i,±j,±k}, the center and commutator subgroup are both {±1}≅C2, and its quotient is also V. Both quotient maps are therefore finite stem extensions with multiplier kernel and hence Schur covers.

2.1step 1.1contradiction∎

The group D8 has five nonidentity involutions whereas Q8 has one, so the two covers are not isomorphic. The stated uniqueness claim is false.

False statementConstruction: Literature-sourcedVerification: AI-generatedverified 2026-09-24 (gpt-6-sol)Open item page →

Universal coefficients split naturally

Statement

Assume the Axiom of Choice and supplied projective and injective resolution data for group (co)homology. For groups G and trivial G-modules A, the degree-two universal-coefficient short exact sequence splits naturally in G and A.

Facts & Assumptions

Given: The stated choice and resolution hypotheses. Fix A=C2 with trivial action and V=C2×C2, written as F22. Write pG:H2(G;A)→Hom⁡(M(G),A) for the universal-coefficient map.

[L1]

Universal coefficients in degree two supplies the degree-two universal-coefficient map pG under the stated hypotheses. The contradiction uses the hypothesized natural section only for finite groups.

[L2]

A cyclic group has zero Schur multiplier (Multiplier of a cyclic group).

[L3]

For an abelian group B, M(B)≅⋀2B (Multiplier of an abelian group), and alternating bilinear maps factor through its exterior square (Alternating universal property).

[L4]

Classes in H2(G;A) naturally classify central extensions of G by A when the action is trivial (H^2 classifies extensions with fixed abelian kernel action). Under this classification, restriction to a subgroup pulls back the extension, and zero represents a split extension: restricting a factor set gives the pullback factor set, and a homomorphic section has zero factor set.

Refutation

technique · contradiction
1.1L1L2assume-contra

Suppose there are splitting homomorphisms sG:Hom⁡(M(G),A)→H2(G;A) natural in G, with pGsG=id. For every subgroup inclusion i:L↪V with L≅C2, [L2] gives M(L)=0, so naturality forces i∗sV(λ)=sL(λ∘M(i))=sL(0)=0 for every λ:M(V)→A.

2.1L3step 1.1constructalgebra

The map b((x1,x2),(y1,y2))=x1y2+x2y1 is alternating and bilinear to A. It takes value 1 on the standard basis pair, so [L3] supplies a nonzero homomorphism λ:M(V)→A. Put α=sV(λ). Then pV(α)=λ≠0.

3.1L4step 1.1step 2.1

Represent α by a central extension 1→A→E→πV→1. Its restriction to each of the three order-two subgroups L≤V is zero by step 1.1. Hence each preimage π−1(L) is a split central extension, isomorphic to C2×C2, and every element of that preimage has square 1.

4.1step 3.1choosealgebra

Every element of E either belongs to the kernel A, or maps to a nonzero vector of V and therefore belongs to one of these three preimages. Thus every element of E has square 1. For x,y∈E, this gives xy=(xy)−1=y−1x−1=yx, so E is abelian. Choose lifts u,v of the two standard basis vectors of V. Since u2=v2=1 and uv=vu, the map (a,b)↦uavb is a homomorphic section of π.

5.1L4L1step 2.1step 4.1discharge-contradiction∎

This section makes α=0, contradicting pV(α)=λ≠0. Therefore no splitting can be natural in the group variable even for the fixed coefficient group C2, and in particular none is natural in both variables. Under the Axiom of Choice, the individual sequences split after choices by the separate splitting theorem cited in [L1].

5 · Examples, counterexamples and false statements

None yet.

Sources