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.
Limit cycles of a leaf
Definition
Assume Countable Choice . Let be a transversely oriented codimension-one foliation, a leaf, and . For a chosen side of , let be the subgroup of classes whose one-sided normal- fence holonomy germ is the identity. The quotient is Novikov’s one-sided limit-cycle group. A class is a limit cycle on side precisely when its image in is nonidentity, equivalently its one-sided holonomy germ is nonidentity. The two groups and record ordinary right and left limit cycles.
Remarks
The separate limitwise-nullhomotopy subgroup is defined later on this page as a set of classes in whose sufficiently small displaced loops are nullhomotopic in their leaves. Its containment in is part of that definition; it is distinct from the ordinary limit-cycle quotient defined here.
Depends on
- One-sided trivial-holonomy classes form a normal subgroup
- The holonomy representation and the holonomy group of a leaf
- Local transversals to a regular foliation
- Germs of local diffeomorphisms at a point
- Based loops and the fundamental group
- Leaves of a regular foliation
- The countable-choice principle used in the foliation pair
Used by
Dependency tree · two levels
31 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
- S. P. Novikov, The Topology of Foliations (English translation by J. A. Zilber; complete PDF of the translation) (standard reference, not scraped)