Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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.

The exponential map is globally injective on every connected Lie group

Statement refuted

The exponential map is globally injective on every connected Lie group.

Facts & Assumptions

Given: The additive quotient G=R/Z with its standard one-dimensional quotient charts.

[F1]

A Lie-group exponential evaluates the one-parameter subgroup with the specified initial velocity at time one. Exponential map of a Lie group.

[F2]

A Lie group has smooth multiplication and inversion. Lie group.

Refutation

technique · counterexample
1.1

Addition and negation descend to smooth operations in the quotient charts, so G is a one-dimensional Lie group. The quotient map π:RG is continuous and surjective; since R is connected, [F3] makes G connected.

F2F3
2.1

For XT0GR, the curve γX(t)=[tX] is a one-parameter subgroup with initial velocity X. Hence [F1] gives expG(X)=[X].

F1step 1.1
3.1

In particular, expG(0)=[0]=[1]=expG(1) although 01. Thus the exponential is not globally injective.

step 2.1algebra
4.1

The witness is nonempty, connected, and one-dimensional, so it also covers the lowest positive dimension. No metric, degeneracy, endpoint, choice, or biconditional occurs. The zero-dimensional connected case is harmless but cannot rescue the universal claim.

F1F2F3step 1.1step 2.1step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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