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.
Foliation components as mutual positive transverse-accessibility classes
Definition
Let F be a C² cooriented codimension-one foliation on a smooth manifold M without boundary. Its foliation component containing a leaf A is the saturated subset The equivalence classes of leaves under mutual positive transverse accessibility partition the leaf set; their unions partition M into saturated subsets. This is Novikov’s connected component of the foliation. It is not defined as an ordinary connected component of M or M minus a leaf, and it differs from one-direction positive reach alone. A boundary leaf L of a distinct component means and , with boundary in the ambient topology. This definition does not assert that a component’s closure is a manifold with boundary.
Remarks
The partition assertion also has a finite, choice-free justification, so it does not require importing the standing hypothesis of the cited preorder lemma. Two points of a connected leaf are joined by a finite plaque path: the points reachable by finite plaque paths and their complement are open in the leaf. Smooth the finitely many corners. Given a genuine positive segment and such initial and terminal plaque paths, choose a positive transverse field and defining form near their compact images using finitely many chart bumps. For its flow, the transverse error along a displaced leafwise path is bounded by , whereas its offset contributes at least for some . Choose offsets with and , vanishing at the desired outer endpoints, and interpolate their small endpoint values along the original positive segment. This adjusts both endpoints and allows two genuine positive segments to concatenate; chartwise smoothing keeps their transverse derivatives positive. Equality cases are immediate. Transitivity, formal reflexivity and symmetry of mutual accessibility now give an equivalence relation, whose classes partition the leaves and whose saturated unions partition without choosing class representatives.
Depends on
- Positive transverse accessibility between leaves
- Positive transverse accessibility is a preorder
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
- The equivalence classes of an equivalence relation are nonempty, cover $A$, and are pairwise equal or disjoint; conversely every such cover arises from exactly one equivalence relation
- Interior, closure, boundary, exterior, derived set and isolated point in a topological space
Used by
Dependency tree · two levels
27 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 (standard reference, not scraped)