Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

False: every short exact sequence of groups splits

Statement

False claim: every short exact sequence of groups has a homomorphic section and therefore splits.

Facts & Assumptions

Given: A prime p and the sequence induced by multiplication by p and reduction modulo p,

1→Cp→Cp2→πCp→1.

[A1]

The false claim says that this short exact sequence has a section.

[L1]

A section is a homomorphism s satisfying πs=id⁡ (Group extensions, sections, complements, and split extensions).

Refutation

technique · contradiction
1.1L3algebra

The kernel of reduction π:Cp2→Cp is pCp2, which has order p by [L3], so the displayed sequence is short exact.

1.2A1L1L2L3assume-contraalgebra

Assume, for contradiction, that [A1] holds and let s be a section. Since πs is the identity, s is injective and its image H has order p. By [L2], H=⟨[a]p2⟩ for some a. Its generator has order p, so [L3] gives p2∣pa and hence p∣a. Thus H⊆pCp2; both subgroups have p elements, so H=ker⁡π.

2.1step 1.2A1L1discharge-contradiction∎

Hence πs is zero, contradicting [L1]. Therefore this sequence does not split and [A1] is false.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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