Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Local slice for a free proper action

Statement

Let a Lie group G act smoothly, freely, and properly on a smooth manifold M. For every x∈M there is an embedded submanifold S⊆M through x such that

A:G×S⟶G⋅S,A(g,s)=g⋅s,

is a diffeomorphism onto an open saturated neighborhood of x. In particular, its restriction near (e,x) is a diffeomorphism onto a neighborhood of x, and gS∩S≠∅ implies g=e.

Facts & Assumptions

Given: A smooth free proper left action of G on M and a point x∈M.

[F1]

Properness means that the action-graph map Θ(g,y)=(g⋅y,y) has compact inverse images of compact subsets. Free and proper Lie-group actions.

[F2]

The constant-rank theorem gives local normal forms for constant-rank maps, and a smooth map with invertible differential is locally a diffeomorphism. The constant-rank theorem for manifolds, The smooth inverse function theorem on manifolds.

Proof

technique · construct a transverse submanifold and use properness to exclude returns
1.1givenF2algebra

Let Φx:G→M be the orbit map. From Φx∘Lg=(y↦g⋅y)∘Φx and the fact that both outside maps are diffeomorphisms, Φx has constant rank. Its fibre over x is the stabilizer Gx={e} by freeness. If d(Φx)e had a nonzero kernel, the constant-rank normal form [F2] would make the local fibre through e positive-dimensional, contradicting that it is a singleton. Thus d(Φx)e is injective.

2.1F2F3step 1.1construct

By [F3], choose a complement N to d(Φx)e(TeG) in TxM. In a chart at x, the inverse image of the coordinate subspace corresponding to N is, after shrinking, an embedded submanifold S0 through x with TxS0=N. The differential of A0:G×S0→M, A0(g,s)=g⋅s, at (e,x) is (X,v)↦d(Φx)eX+v, hence is an isomorphism. By [F2], there are an identity neighborhood V⊆G and a neighborhood of x in S0, again denoted S0, on which A0∣V×S0 is a diffeomorphism onto an open neighborhood of x.

3.1F1F4step 2.1

Choose a compact neighborhood C of x and shrink S0 into its interior. Properness makes P=Θ−1(C×C) compact. Its projection to G is therefore the compact transporter K={g∈G:gC∩C≠∅}. The set K∖V is compact by [F4].

4.1givenF4step 3.1construct

For every g∈K∖V, freeness gives g⋅x≠x. Choose disjoint neighborhoods of these two points. Continuity of the action then supplies neighborhoods Og of g and Ng of x such that g′Ng∩Ng=∅ for all g′∈Og. The Og cover the compact set K∖V, so finitely many suffice. Intersect their corresponding Ng and shrink S0 to a submanifold neighborhood S of x inside that finite intersection and inside C. Then gS∩S=∅ for g∈K∖V; it is also empty for g∉K because S⊆C.

5.1step 2.1step 4.1

If gS∩S≠∅, step 4.1 gives g∈V. For s,t∈S with g⋅s=t, the two points (g,s) and (e,t) of V×S0 have the same image under the injective local map from step 2.1, so g=e and s=t. Consequently A:G×S→G⋅S is bijective.

6.1F2step 2.1step 5.1∎

The differential of A is invertible at every (g,s): at (e,s) this follows after the preceding shrinking from the local diffeomorphism in step 2.1, and arbitrary g follows by translation in the source and the action diffeomorphism in the target. Thus A is a bijective local diffeomorphism, hence a diffeomorphism onto its open image. Its image is saturated by definition and contains x. The construction uses only a finite subcover in step 4.1 and no choice principle.

Depends on

Dependency tree · 2 levels

Sources