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.

Stable leaves

Definition

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

The leaf L is stable when every open neighbourhood W of L in M contains a saturated neighbourhood of L (Saturated neighbourhoods of a leaf); equivalently, when the saturated neighbourhoods of L form a fundamental system of neighbourhoods of L.

More generally, a subset B⊆M is stable in the sense of Reeb when for every open neighbourhood W of B there is an open neighbourhood W′⊆W of B such that every leaf of F meeting W′ is contained in W. For a leaf B=L this is equivalent to stability of L: if such a W′ exists, then its saturation U=⋃{L′:L′ a leaf and L′∩W′≠∅} is open and saturated (each box carries an open set to its open plaque saturation, and finite plaque transport carries this property along every leaf), contains L, and satisfies U⊆W by the property of W′, so U is a saturated neighbourhood of L inside W; conversely a saturated neighbourhood U⊆W of L is itself a neighbourhood W′⊆W of L every leaf meeting which is contained in U⊆W.

Stability of a leaf is a neighbourhood property: it depends only on the germ of the foliation along L, since both quantifiers involve neighbourhoods of L. This is the property that the local and global Reeb stability theorems below establish under their finiteness hypotheses.

Depends on

Used by

Dependency tree · two levels

4 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