Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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 deck group of the holonomy cover is the holonomy group

Statement

Assume ACω (The countable-choice principle used in the foliation pair). Let F be a regular foliation, L a leaf, x∈L, T a local transversal at x, ρx:π1(L,x)→Diff⁡x(T) the holonomy homomorphism with the convention ρx([a])=ha−1(T,T), and p:L^→L the holonomy cover, with x^∈p−1(x) and p∗π1(L^,x^)=ker⁡ρx (The holonomy cover of a leaf). Then:

  1. p is a regular covering, π1(L,x)/ker⁡ρx acts faithfully on L^ by deck transformations, and Deck⁡(p)≅π1(L,x)/ker⁡ρx≅Hol⁡(L,x)=ρx(π1(L,x));
  2. the deck action is a covering-space action, L^/Deck⁡(p)≅L, and the quotient map is p;
  3. the holonomy group acts through transverse germs via ρx; when those germs are realized on a common invariant transverse neighbourhood D, the diagonal action of H=Hol⁡(L,x) on L^×D is free and a covering-space action. In particular, when H is finite, p is a finite-sheeted covering of degree ∣H∣.

Traversal-order loop multiplication and composition-order germs require this reversed-loop convention, as in The holonomy representation and the holonomy group of a leaf. Forward transport is an antihomomorphism with the same image and kernel as sets. The reversed-loop convention makes the deck identification and diagonal action homomorphic.

Facts & Assumptions

Given: A regular foliation F, a leaf L with x∈L, a local transversal T at x, the holonomy representation ρx with kernel K=ker⁡ρx, and the holonomy cover p:L^→L with base point x^ over x.

[F1]

The holonomy cover is the connected covering p:L^=L~/K→L associated with K=ker⁡ρx, where L~→L is the universal cover, so that p∗π1(L^,x^)=K; K is normal in π1(L,x) because it is a kernel (The holonomy cover of a leaf, The covering of a leaf associated with the holonomy kernel exists, The homomorphism on fundamental groups induced by a pointed continuous map).

[F3]

The holonomy group is Hol⁡(L,x)=ρx(π1(L,x)), and K=ker⁡ρx; the first isomorphism theorem gives π1(L,x)/K≅Hol⁡(L,x) (The holonomy representation and the holonomy group of a leaf, First isomorphism theorem for groups: G/ker⁡f≅im⁡f).

[F4]

The deck group of a covering acts by a covering-space action, deck transformations are determined by their value at one point and act freely, and a connected regular covering has its deck group acting freely and transitively on each fibre, so its number of sheets is the order of that group (The deck group of a connected covering acts by a covering-space action, On a connected covering space, a deck transformation is determined by one point and the deck action is free).

[F5]

The library product traverses the first loop before the second, and transports satisfy ha∗b=hb∘ha and ha−1=ha−1 (Based loops and the fundamental group, Holonomy respects path concatenation and reversal).

Proof

technique · direct
1.1F1F2F5

(Convention and kernel.) By F5, ρx([a])=ha−1 satisfies ρx([a][b])=ρx([a])∘ρx([b]). Its image is the same set of transport germs as the forward assignment, and its kernel is the same subgroup K, because taking inverses preserves the identity. Therefore the holonomy cover of F1 is still the connected cover associated to this normal kernel. The universal-cover deck convention of F2 prepends a to a path when applying the deck transformation associated with [a]. Consequently the deck transformation corresponding to the germ hγ=ρx([γ−1]) prepends γ−1. This fixes the precise convention consumed by the normal model.

2.1F2F3F4step 1.1

(The deck group.) Since p∗π1(L^,x^)=K is normal in π1(L,x), the covering p is regular and [F2] gives Deck⁡(p)≅π1(L,x)/K [F1, F2]. By the first isomorphism theorem applied to the holonomy representation, π1(L,x)/K≅ρx(π1(L,x))=Hol⁡(L,x) [F3]. Hence Deck⁡(p)≅Hol⁡(L,x), the deck action is faithful by the determination property [F4].

3.1F2F4step 2.1

(Quotient and finite degree.) Regularity in step 2.1 makes the deck group transitive on each covering fibre, and F4 makes its action free. Thus each fibre is a torsor for Deck⁡(p), its quotient is L, and the induced quotient topology agrees with that of L in covering trivializations. The deck action is a covering-space action by F4. If H is finite, every fibre has exactly ∣H∣ points, so p is a finite-sheeted cover of that degree.

4.1F3F4step 3.1

(The diagonal action.) The germs of H act on the transversal T through ρx, and when they are realized on a common invariant transverse neighbourhood D the formula h⋅(y^,t):=(h y^,h t) defines an action of H on L^×D preserving the product foliation by the slices. It is free: if h⋅(y^,t)=(y^,t), then h fixes y^, so h is the identity deck transformation by freeness of the deck action [F4]. It is a covering-space action, being the product of the covering-space action on L^ and any action on D: a deck-separating neighborhood V gives the neighborhood V×D whose nonidentity translates are disjoint [F4]. This is the diagonal model used by the finite-holonomy normal construction.

5.1step 1.1step 2.1step 3.1step 4.1∎

Therefore the deck group of the holonomy cover is the holonomy group, the deck action is a covering-space action with quotient L, and the diagonal action on L^×D is free and a covering-space action; for finite H the cover is finite-sheeted of degree ∣H∣.

Depends on

Used by

Dependency tree · two levels

82 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