Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Saturated neighbourhoods of a leaf

Definition

Let F be a regular foliation of a smooth manifold M (Regular foliation atlases) and let L be a leaf of F (Leaves of a regular foliation).

An open set U⊆M is saturated, or invariant, for F when it is a union of leaves of F; equivalently, when for every x∈U the whole leaf of F through x is contained in U. The equivalence is immediate from the definitions: a union of leaves has the pointwise property, and conversely the set of leaves meeting U covers U by the pointwise property, so U is their union.

A saturated neighbourhood of L is a saturated open set U⊆M with L⊆U. If U is saturated then F restricts to a regular foliation of U: restrict the foliation charts to their intersections with U and take connected components of their slices as plaques. These restricted charts form an atlas of the open submanifold U (Regular foliation atlases). Since U contains every leaf meeting it, every plaque chain in such a leaf remains in U, so the restricted leaves are exactly the leaves of F meeting U (Leaves of a regular foliation).

The neighbourhood conclusion of Reeb stability below is stated as the existence, for every neighbourhood W of L in M, of a saturated neighbourhood U⊆W of L; this property of L is recorded separately below as stability of the leaf.

Depends on

Used by

Dependency tree · two levels

3 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