Alphabeta Math
CounterexampleConstruction: 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.

The same middle group can support inequivalent extension maps

Statement refuted

Two extensions are equivalent whenever 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]

The false statement above is the claim to be refuted (FALSE: equivalent extensions mean only that the middle groups are isomorphic).

Counterexample

technique · direct
1.1givenalgebra

The map π is surjective, with kernel {0,3‾,6‾}. Both i1 and i2 identify C3 with that kernel, so 1→C3→i1E→πC3→1,1→C3→i2E→πC3→1 are two extensions of C3 by C3 with the same middle group E.

2.1step 1.1algebra

Any automorphism of E=C9 has the form ϕu(x‾)=ux‾ with u∈(Z/9Z)×. If an extension equivalence existed, it would satisfy ϕ∘i1=i2 and π∘ϕ=π. The first identity gives 3u≡6(mod9), so u≡2(mod3). The second gives u≡1(mod3). This contradiction shows that no extension equivalence can exist.

3.1L1step 2.1∎

Thus the same middle group supports two inequivalent extension structures, refuting [L1].

Depends on

Used by

Nothing in the library uses this result yet.

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