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.
Positive transverse accessibility is a preorder
Statement
Assume and use Positive transverse accessibility between leaves for a C² cooriented foliation on a smooth manifold without boundary. If a genuine nonempty positive transverse segment joins leaves A to B, then for any x∈A and y∈B there is such a segment from x to y. This endpoint conclusion is not asserted merely from the formal A=B clause. The relation is reflexive and transitive, hence a preorder. The relation defined by and is an equivalence relation on the set of leaves.
Facts & Assumptions
Given: A C² cooriented codimension-one foliation of a smooth manifold without boundary, leaves , and a genuine nonempty positive transverse segment with , .
A positive transverse segment is a map whose transverse derivative is strictly positive in every positively signed foliated chart, and means that or such a nonempty segment runs from to (Positive transverse accessibility between leaves).
The connected components of an open subset of are polygonally connected by finitely many straight segments (Every connected component of an open subset of is open and polygonally connected).
Plaque transport along a finite plaque chain and transverse fences preserve the regularity of the transported curves (the sibling item lem-c2-plaque-transport-and-transverse-fences-preserve-c2-regularity); this supplier is an in-run item of the sibling page and the exact use is flagged in step 1.1.
For a compact set contained in an open set there is a smooth bump equal to one near the compact set and supported in the open set (A manifold bump for a compact set inside an open set).
A smooth vector field has a smooth local flow, with derivative bounds on compact flow domains (The fundamental theorem on flows).
Compactness of a subspace is equivalent to the finite-subcover property for ambient open covers (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it). The additional compactness facts used here follow directly: a compact set in a Hausdorff space is closed, since for an exterior point finitely many separating neighbourhoods covering the compact set have a common neighbourhood of that point disjoint from it. A product of two compact spaces is compact: refine an open cover to rectangles, each fibre over the first factor has a finite rectangle cover, whose first-factor neighbourhoods have an open intersection. The family of all intersections arising this way covers the first factor; a finite subcover yields a finite cover of the product. No simultaneous selection of a rectangle family for every fibre is made. Iterating gives finite products. Near a compact set in a manifold, choose finitely many smaller coordinate balls with compact Euclidean closures inside the specified chart neighbourhoods; these give the compact flow domains used below.
A function on a segment is Lipschitz with constant the supremum of its derivative, by the mean value theorem (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
A preorder is a reflexive and transitive relation (Preorder and monotone map), and an equivalence relation is a reflexive, symmetric and transitive relation (Equivalence relation, equivalence class, and the quotient set ).
The standing assumption is Countable Choice as recorded for this pair (The countable-choice principle used in the foliation pair).
Proof
Let be a leafwise path from to inside and a leafwise path from to inside . Such paths exist: cover each leaf by its foliated charts, whose plaques are convex and chartwise polygonally connected, use [F2] finitely many times to reach the target plaque, and smooth the finitely many corners inside plaque charts; the finite plaque transport preserves the regularity of the leafwise curves by [F3]. Only finitely many charts and plaques are selected.
Near the compact union of the three curves construct a smooth field and a form with and positive transverse: choose finitely many smooth ambient chart bumps over that union by [F4], take in each chart a constant vector that is positive for the continuous cooriented tangent planes on a smaller neighbourhood, and sum the bumped fields; patch the local positively cooriented annihilating forms of the atlas in the same finite way. On a compact flow domain the smoothness of and gives a uniform bound and, by [F5], a uniform interval of the flow on which the derivative is bounded; [F6] reduces the neighbourhood data to finitely many compact charts.
For a leafwise path near the union and a offset profile , the curve has transverse derivative , where because is tangent to ; hence on the compact parameter set for a constant by [F7] applied to . With the profiles on the initial path and on the terminal path one has , so choosing gives transverse derivative at least ; both profiles vanish at the outer endpoints, so starts at and ends at .
Along use a fixed profile scaled by that joins the positive offset at its start to the negative offset at its end; since , its perturbed transverse derivative stays positive for small , and the three pieces join into a piecewise positive path from to . At each of the two internal seams choose one foliated chart; the one-sided transverse-coordinate derivatives have a positive lower bound there, and mollifying the continuous piecewise chart curve with a nonnegative kernel keeps the transverse derivative positive, while the blending correction has derivative tending uniformly to zero and is made smaller than the lower bound; the resulting curve is , positive, agrees near the outer endpoint collars and still joins to .
Transitivity: if genuine segments realize and , apply the endpoint adjustment of step 3.1 to the second segment so that it starts at the actual endpoint of the first, concatenate the two, and smooth the single internal seam by the same chartwise mollification; the equality cases are immediate from the definition, so .
Reflexivity holds by the defining equality clause of [F1], and transitivity is step 4.1, so is a preorder in the sense of [F8]; the endpoint conclusion follows from step 3.1 applied to any genuine joining segment, and the formal equality clause alone is never used to produce an actual segment.
Mutual accessibility is reflexive and symmetric by definition and transitive by two applications of the transitivity in step 4.1, so it is an equivalence relation in the sense of [F8]; the construction used only finitely many charts, bumps, flow intervals and profiles, hence only the standing countable choice from [F9].
Depends on
- Positive transverse accessibility between leaves
- Preorder and monotone map
- Equivalence relation, equivalence class, and the quotient set $A/{\sim}$
- Every connected component of an open subset of $\mathbb{R}^n$ is open and polygonally connected
- A manifold bump for a compact set inside an open set
- The fundamental theorem on flows
- C² plaque transport and finite transverse fences preserve C² regularity
- The countable-choice principle used in the foliation pair
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
Used by
- Foliation components as mutual positive transverse-accessibility classes Definition
- A no-transversal leaf bounds a positive accessibility region with finite inward boundary Lemma
- A paired immersed cap sweep excludes a positive closed transversal Lemma
Cited to discharge well-definedness by Positive transverse accessibility between leaves.
Dependency tree · two levels
49 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)