Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Thurston stability: groups of orientation-preserving C¹ interval germs are locally indicable

Statement

Let G be a nontrivial finitely generated subgroup of Diff⁡01,+(R), the group of germs at 0 of C1 orientation-preserving local diffeomorphisms of R fixing 0 (C¹ germs of local diffeomorphisms at a point, C¹ germs of local diffeomorphisms form a group). Then there is a surjective homomorphism G↠Z; that is, Diff⁡01,+(R) is locally indicable.

Facts & Assumptions

Given: A nontrivial finitely generated subgroup G≤Diff⁡01,+(R) with a finite generating set g1,…,gm, and representatives of these germs defined near 0 and fixing 0.

[F1]

Diff⁡01,+(R) is a group under composition of germs, its elements are germs of C1 local diffeomorphisms with positive derivative at 0, and a subgroup is a subset containing the identity and closed under products and inverses (C¹ germs of local diffeomorphisms form a group, Group and abelian group, Subgroup).

[F2]

A C1 local diffeomorphism of R fixing 0 with derivative 1 at 0 can be written near 0 as g(x)=x+y(g)(x) with y(g)(0)=0 and y(g)′(0)=0; the derivative of a C1 map is continuous, so for every ϵ>0 there is a neighbourhood of 0 on which ∣y(g)′∣<ϵ (Continuously differentiable maps, local inverses, and local diffeomorphisms, C¹ germs of local diffeomorphisms at a point).

[F3]

The image of a finitely generated group under a homomorphism is finitely generated (Images of finitely generated and of finite groups are finitely generated and finite).

[F4]

Every finitely generated abelian group is isomorphic to Zr⊕(finite torsion) for a unique r≥0; a nonzero finitely generated torsion-free abelian group therefore has r≥1 and admits a surjection onto Z (The fundamental theorem of finitely generated abelian groups from PID modules).

Proof

technique · direct, following Calegari's proof of Theorem 2.119
1.1F1F2F3F4

(The derivative homomorphism.) For a germ g∈G choose a representative and set d(g):=log⁡g′(0); the value is well defined because representatives agree near 0 and the derivative at 0 is a germ invariant, and d(gh)=d(g)+d(h) by the chain rule, so d:G→R is a homomorphism into the additive group of the reals [F1]. If d(G)≠{0}, then d(G) is a nonzero finitely generated subgroup of R by [F3], hence torsion-free, and [F4] shows d(G)≅Zr with r≥1; projecting onto one free coordinate gives a surjective homomorphism G↠Z, and the theorem is proved. Henceforth assume d(G)={0}, that is, every element of G has derivative 1 at 0.

2.1F2step 1.1

(Normalized displacements.) Shrink a common domain so that every generator is defined and satisfies [F2]; then gj(x)=x+y(gj)(x) with y(gj)′(0)=0. Since G is nontrivial, some generator is not the identity germ, so the open set {x:w(x)>0}, where w(x):=max⁡j∣y(gj)(x)∣, accumulates at 0. Fix an enumeration of the rationals and, for every n≥1, let xn be the rational of least index lying in the nonempty open set {x:∣x∣<1/n, w(x)>0}; then xn→0 and wn:=w(xn)>0, and this selection is canonical, so no choice principle is used. The vectors an:=(y(gj)(xn)/wn)j=1m lie in the compact cube [−1,1]m and have maximum norm 1; passing to a convergent subsequence, write a=(a1,…,am) for its limit, so max⁡j∣aj∣=1 and a≠0.

3.1F2step 2.1

(Word estimates.) Fix a word w in the letters gj±1 and let ej(w)∈Z be the signed exponent sum of the letter gj in w. We claim that the displacement of the corresponding element, as a function of x, satisfies y(w)(xn)=wn∑j=1mej(w) aj+o(wn). This follows by induction on the length of w from two estimates: (i) for generators, y(gj)(xn)=wnaj+o(wn) by step 2.1; (ii) the composition formula g∘h(x)=x+y(h)(x)+y(g)(x+y(h)(x)) and the continuity of y(g)′ with y(g)′(0)=0 give y(g)(x+y(h)(x))=y(g)(x)+o(∣y(h)(x)∣), so composing adds the displacements up to o(wn) uniformly over words whose letters are taken from the fixed finite set, because every partial displacement is O(wn) by the induction hypothesis and the increment is taken at points xn+O(wn)→0. For an inverse letter, applying the same composition formula to g−1∘g at xn gives y(g−1)(xn)=−y(g)(xn)+o(wn). Multiplying these estimates through the word proves the displayed formula.

4.1F1step 3.1

(The limiting homomorphism.) Define v(g):=lim⁡ny(w)(xn)/wn for any word w representing g∈G. The value is independent of the chosen word: if w,w′ represent the same germ, then the displacement function of w′w−1 vanishes identically near 0, since w′w−1 is the identity germ, while step 3.1 applied to the word w′w−1 gives ∑jej(w′w−1)aj as its normalized limit; hence the two normalized limits agree. Moreover v(gh)=v(g)+v(h), because concatenating representatives concatenates words and signed exponent sums are additive; and v is nontrivial because v(gj)=aj with max⁡j∣aj∣=1 [F1]. Thus v:G→R is a nonzero homomorphism.

5.1F3F4step 1.1step 4.1∎

(Surjection onto Z.) The image v(G) is a nonzero finitely generated subgroup of R by [F3], so it is torsion-free and [F4] identifies it with Zr for some r≥1; projecting onto one free coordinate gives a surjective homomorphism G↠Z. Since every nontrivial finitely generated subgroup G was handled in one of the two cases, Diff⁡01,+(R) is locally indicable.

Depends on

Used by

Dependency tree · two levels

36 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