Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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: equivalent extensions mean only that the middle groups are isomorphic

Statement

Two extensions are equivalent exactly when their middle groups are isomorphic.

Facts & Assumptions

Given: The middle group E=C9=Z/9Z, the quotient map

π(x)=x(mod3),

and the two kernel embeddings

i1(a)=3a,i2(a)=6a.

[L1]

Equivalent extensions must fix the chosen kernel and quotient maps (Equivalence of group extensions with fixed kernel and fixed quotient).

Refutation

technique · direct
1.1

The map π is surjective, with kernel {0,3,6}. Both i1 and i2 identify C3 with that kernel, so 1C3i1EπC31,1C3i2EπC31 are two extensions with the same middle group E.

givenalgebra
2.1

Any automorphism of E=C9 has the form ϕu(x)=ux with u(Z/9Z)×. If an extension equivalence ϕ existed, then [L1] would force ϕi1=i2 and πϕ=π. The first identity gives 3u6(mod9), so u2(mod3). The second identity gives uxx(mod3) for every x, hence u1(mod3). This is impossible. So no extension equivalence can exist.

L1step 1.1algebra
3.1

By [L1], the two extensions from step 1.1 are therefore not equivalent even though they have the same middle group. The statement is false.

L1step 2.1

Depends on

Used by

Dependency tree · two levels

7 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