Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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: isomorphic middle groups force equivalent extensions with fixed kernel and quotient

Statement

If two extensions have isomorphic middle groups, then they are equivalent as extensions with fixed kernel and fixed quotient.

Facts & Assumptions

Given: The additive cyclic group E=Z/9Z, the kernel group N=Z/3Z, the quotient group Q=Z/3Z, and the inclusion j:NE given by j(aˉ)=3a.

[L1]

Equivalence of extensions fixes both the chosen kernel map and the chosen quotient map (Equivalence of group extensions with fixed kernel and fixed quotient).

Refutation

technique · direct
1.1

Define two quotient maps π1,π2:EQ by π1(xˉ)=xˉ(mod3),π2(xˉ)=2xˉ(mod3). Both are surjective homomorphisms with kernel {0ˉ,3ˉ,6ˉ}=imj, so they give two extensions of Q by N with the same middle group E.

givenalgebra
2.1

An equivalence in the sense of [L1] would be an automorphism φ:EE such that φj=j and π2φ=π1. Every automorphism of the additive cyclic group Z/9Z has the form φ(xˉ)=uxˉ for a unit u{1,2,4,5,7,8}. The condition φj=j gives 3u=3ˉ, so u1(mod3). But π2φ=π1 forces 2u=1ˉ in Q, so u2(mod3). This is impossible. Therefore the two extensions are not equivalent.

L1step 1.1algebra

Depends on

Used by

Dependency tree · two levels

3 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