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.
Vanishing cycles of a codimension-one foliation
Definition
Assume Countable Choice . Let be a transversely oriented codimension-one regular foliation. A vanishing cycle supported on a leaf is a jointly family of loops , , such that: (i) each lies in one leaf of ; (ii) is nonzero in ; (iii) is null-homotopic in for every ; and (iv) for each , is transverse to . The nearby loops in (iii) have trivial holonomy because they are null-homotopic. Closure of this transverse family makes the supporting loop's holonomy the identity on the side approached by the family: its return map fixes every sufficiently close parameter on that side. Thus the supported loop is a nonlimit cycle on the approached side; its opposite-side holonomy may be nonidentity. The supported class instead determines a nonzero element of the distinct subgroup on the side approached by the family, as proved in A vanishing cycle determines a nonzero limitwise-nullhomotopy class. Here jointly means the trace map is , with one-sided derivatives at the parameter endpoints; transversality requires its parameter derivative to have nonzero normal component. Smooth foliation data with a smooth trace are included as a special case.
Depends on
- Leaves of a regular foliation
- Based loops and the fundamental group
- Simply connected topological spaces
- Smooth maps transverse to a regular foliation
- Smooth manifolds and their smooth charts
- Limit cycles of a leaf
- Limitwise-nullhomotopy subgroup of a leaf
- The countable-choice principle used in the foliation pair
- C² plaque transport and finite transverse fences preserve C² regularity
Used by
- A compressible leaf yields a vanishing cycle Lemma
- A null-homotopic closed transversal yields a vanishing cycle Lemma
- A vanishing cycle determines a nonzero limitwise-nullhomotopy class Lemma
- The first essential loop in a transverse family is a vanishing cycle Lemma
- Novikov's Reeb component theorem Theorem
Dependency tree · two levels
34 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
- Samuel Ranz, Approximately Holomorphic Techniques in Foliations: A Simple Proof of Novikov’s Theorem (PhD thesis, Universidad Autonoma de Madrid, 2024; complete PDF) (standard reference, not scraped)
- S. P. Novikov, The Topology of Foliations (English translation by J. A. Zilber; complete PDF of the translation) (standard reference, not scraped)