Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Compact connected regular fibres are tori

Statement

This item assumes ACω, namely countable choice. In the propagated dependency chain, that assumption is required through Stabilizer of the Rn-action on a compact connected regular fibre is a full lattice; after those interfaces are fixed, the remaining local or finite argument makes no additional countable-family choice.

Every compact connected regular fibre of a completely integrable system on a 2n-dimensional symplectic manifold is diffeomorphic to the torus Tn=Rn/Zn.

Facts & Assumptions

Given: ACω and such a compact connected regular fibre N.

[A1]

ACω is countable choice and is required here through Stabilizer of the Rn-action on a compact connected regular fibre is a full lattice; after those supplied interfaces are fixed, the remaining local or finite calculation makes no additional countable-family choice.

Proof

technique · direct
1.1

Choose a lattice basis γ1,,γn of Γ. The linear isomorphism A:RnRn sending the standard basis to this basis carries Zn onto Γ.

A1F1
2.1

Therefore A descends to a diffeomorphism Rn/ZnRn/Γ, which composed with [F1] identifies Tn with N. For n=0, both are a point.

F1step 1.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