Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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 profinite completions force the original groups to be isomorphic

Statement

If two groups have isomorphic profinite completions, then the groups are isomorphic.

Facts & Assumptions

Given: The groups G=Z and H=ZQ.

Refutation

technique · direct
1.1

Every homomorphism from the divisible group Q to a finite group is trivial: if F is finite of order m and ϕ:QF, then for any qQ one has q=mr for some rQ, so ϕ(q)=mϕ(r)=0. Therefore every finite quotient of H=ZQ factors through the projection onto Z.

givenalgebra
2.1

The finite quotients of both G and H are therefore exactly the finite cyclic groups Z/nZ, with the same transition maps. By [L1], both profinite completions are the inverse limit of that same system, namely Z^. But G and H are not isomorphic because H contains a nontrivial divisible subgroup and G does not.

L1step 1.1
3.1

Thus nonisomorphic groups can have isomorphic profinite completions. The statement is false.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

11 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