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.
Regular common level sets are Lagrangian submanifolds
Statement
For a completely integrable system on a -manifold, every nonempty regular common level is an -dimensional Lagrangian submanifold. At each point,
Facts & Assumptions
Given: A completely integrable system and a nonempty regular fibre.
At a regular value, is an embedded codimension- submanifold and . A regular level set is an embedded submanifold, The tangent space of a regular level set is the kernel.
The functions pairwise Poisson commute, and the are independent on the dense open regular locus. Completely integrable Hamiltonian system.
In a -dimensional symplectic vector space an isotropic -plane is Lagrangian, and a submanifold is Lagrangian exactly when its tangent spaces are Lagrangian subspaces. Equivalent characterizations of Lagrangian subspaces, Isotropic, coisotropic, symplectic, and Lagrangian submanifolds.
Proof
By [F1], has dimension and . For every , , so each is tangent.
The bundle isomorphism sends to . Since is a regular fibre, [F1] says has rank , so these vectors are independent. By dimension they span . Their mutual symplectic pairings are the zero brackets from [F2], so is isotropic.
Apply [F3] at every point: the -dimensional isotropic tangent spaces are Lagrangian. Thus is a Lagrangian submanifold and the displayed spanning formula holds.
Depends on
Used by
Dependency tree · two levels
15 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
- Ana Cannas da Silva, Lectures on Symplectic Geometry (standard reference, not scraped)