Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Isomorphic Lie algebras determine isomorphic connected Lie groups

Statement refuted

Assume countable choice. Connected real Lie groups with isomorphic Lie algebras are isomorphic as Lie groups.

Facts & Assumptions

Given: ACω and the usual Lie-group structures on the line and circle.

[L1]

Every connected integration is a discrete central quotient of the simply connected integration (Connected Lie groups are central quotients of simply connected integrations).

[L2]

Countable choice is the declared weak-choice assumption (The Axiom of Countable Choice (ACω)).

Counterexample

technique · line versus circle
1.1

The groups (R,+) and S1 are connected one-dimensional Lie groups. Each Lie algebra is one-dimensional with zero bracket, so their Lie algebras are isomorphic.

givenalgebra
2.1

The circle is compact, whereas R is not. A Lie-group isomorphism is a homeomorphism and would preserve compactness, so the groups are not isomorphic. Equivalently, they are the quotients R/0 and R/Z from the classification [L1]. This also displays the distinct discrete central kernels. Countable choice is the assumption [L2] used only through [L1]; the compactness witness itself is choice-free.

L1L2step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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