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.
Holonomy is a germ, not a globally defined return map
Remark
Assume Countable Choice (The Axiom of Countable Choice ()). The holonomy of a leafwise path is a germ of a local diffeomorphism between local transversals, not a globally defined return map: a representative is defined only on some open neighbourhood of the base point in the transversal, and different representatives of the same germ may differ arbitrarily far from that point. Indeed, the construction of A leafwise path determines a germ of a transverse diffeomorphism composes finitely many chart transports, each of which is produced by the inverse function theorem on a neighbourhood of one point of the path; the resulting map is defined only on a neighbourhood of the base point, and The holonomy germ is independent of the foliation chart chain compares only germs, so nothing in the construction defines values away from the base point, and no global continuation is asserted.
The Poincaré return map of a periodic orbit of a flow is the special case in which the first-return construction defines a map on a fixed section; that is additional structure, not part of the general definition. Statements about "the" return map along a leaf loop must therefore be read as statements about the holonomy germ, as in The holonomy representation and the holonomy group of a leaf, where only the germ is used.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
32 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
- Leiden NCG seminar, Noncommutative Geometry of Foliations (2023 seminar notes) (standard reference, not scraped)
- Eckhard Meinrenken, Lie Groupoids and Lie Algebroids, lecture notes (University of Toronto MAT1341, Fall 2017) (standard reference, not scraped)