Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passverified 2026-09-24 (gpt-6-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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