Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 isotropy of the holonomy groupoid is the leaf holonomy group

Statement

Assume Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let F be a regular foliation, x∈M, L the leaf through x, T a local transversal at x and ρx:π1(L,x)→Diff⁡x(T) the holonomy representation (The holonomy representation and the holonomy group of a leaf). Then the isotropy group Hol⁡(F)(x,x) of the holonomy groupoid (The holonomy groupoid of a foliation) is canonically isomorphic to the holonomy group Hol⁡(L,x)=ρx(π1(L,x)): the map sending the holonomy class of a leaf loop at x to its holonomy germ is a group isomorphism. In particular the isotropy is trivial if and only if the holonomy representation is trivial.

Facts & Assumptions

Given: A regular foliation F, a point x∈M with leaf L, a local transversal T at x, the holonomy representation ρx, and the holonomy groupoid Hol⁡(F).

[F1]

Arrows x→x of Hol⁡(F) are the holonomy classes of leaf loops at x, where two leaf loops are holonomy-equivalent exactly when their holonomy germs agree; the isotropy group consists of these arrows with composition induced by concatenation and identity the class of the constant loop (The holonomy groupoid of a foliation, Based loops and the fundamental group).

[F2]

The holonomy germ ha(T,T) of a leaf loop a at x is well defined and invariant under leafwise homotopy relative to endpoints; the holonomy representation is ρx([a])=ha−1(T,T), it is a homomorphism, and Hol⁡(L,x)=ρx(π1(L,x)) (The holonomy representation and the holonomy group of a leaf, The holonomy germ is independent of the foliation chart chain).

[F3]

Holonomy germs satisfy ha∗b=hb∘ha; the germs of local diffeomorphisms of T at x form a group under composition, so equal germs compose to equal germs (Holonomy respects path concatenation and reversal, Germs of local diffeomorphisms at a point form a group).

Proof

technique · direct
1.1F1F2

The map is well defined and injective. Define Θ:Hol⁡(F)(x,x)→Diff⁡x(T) by Θ(class of a):=ha(T,T). If a,a′ are holonomy-equivalent leaf loops, then by definition their holonomy germs agree, ha(T,T)=ha′(T,T), so Θ is well defined; conversely if the germs agree then the loops are holonomy-equivalent, so Θ is injective.

1.2F1F3

The map is a homomorphism. The isotropy product is induced by concatenation, so for classes of leaf loops a,b at x, Θ([b]⋅[a])=Θ(class of a∗b)=ha∗b(T,T)=hb(T,T)∘ha(T,T)=Θ([b])∘Θ([a]), using multiplicativity of holonomy germs [F3]. The identity class is that of the constant loop, whose germ is the identity germ of T, so Θ preserves identities as well, and inverses are preserved because reversal inverts the germ.

2.1F2step 1.1step 1.2

The image is the holonomy group. Every holonomy class of a leaf loop at x is represented by a leaf loop a, and Θ of its class is ha(T,T)=ρx([a]−1) by [F2]; hence the image of Θ is exactly ρx(π1(L,x))=Hol⁡(L,x). Since Θ is an injective homomorphism onto this subgroup, it is a group isomorphism onto the holonomy group.

3.1step 2.1∎

Triviality criterion. The isotropy group is trivial exactly when its isomorphic image Hol⁡(L,x)=ρx(π1(L,x)) is trivial, that is, exactly when ρx is the trivial homomorphism. This proves the proposition and the stated criterion.

Depends on

Used by

Dependency tree · two levels

41 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