Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

The holonomy cover of a leaf

Definition

Assume Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let F be a regular foliation of M, let L be a leaf with base point x, let T be a local transversal at x, let ρx:π1(L,x)→Diff⁡x(T) be the holonomy representation and let K=ker⁡ρx (The holonomy representation and the holonomy group of a leaf). The holonomy cover of L relative to T is the connected covering p:L^→L with p∗π1(L^,x^)=K supplied by The covering of a leaf associated with the holonomy kernel exists, equipped with a base point x^ over x. It exists and, by that lemma, is unique up to an isomorphism over L: the construction takes the universal cover L~→L, identifies π1(L,x) with its deck group and puts L^=L~/K, so the fibre of p over z∈L is the set of K-orbits in the universal-cover fibre over z.

By construction π1(L^,x^)≅K and the covering p:L^→L is the covering associated with the kernel of the holonomy representation; the covering class of p is the leaf-level input for the finite-holonomy normal model of the Reeb stability pair, which consumes the holonomy cover rather than the universal cover. The kernel K is independent of the choice of the local transversal T, because replacing T conjugates ρx and conjugation preserves kernels, so the holonomy cover of L does not depend on T up to isomorphism over L.

Depends on

Used by

Dependency tree · two levels

42 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