Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Regular value theorem for Banach manifolds

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let M and N be Ck Banach manifolds with k≥1 (Countable base Banach manifold and smooth map), and assume that the specified Ck atlas of M is maximal: every Ck chart compatible with all of its charts is already a member of that atlas. Let f:M→N be of class Ck, let q∈N and suppose that

Df(p):TpM→TqN  is surjective with complemented kernel for every p∈f−1(q).

Then f−1(q) is a split Ck submanifold of M (Split Banach submanifold) and

Tp(f−1(q))=ker⁡Df(p)for every p∈f−1(q).

Facts & Assumptions

Given: AC, Ck Banach manifolds M,N with k≥1, a maximal specified Ck atlas on M, a Ck map f:M→N, a point q∈N, and for every p∈f−1(q) a surjective Df(p) with complemented kernel.

[L1]

Tangents and differentials on Banach manifolds, the chart-independence of the differential, and functoriality (Tangent space and differential on a Banach manifold, Banach manifold differentials are chart independent); split submanifolds and their slices (Split Banach submanifold). A chart of a structured manifold means a member of its specified atlas; by the maximal-atlas hypothesis on M, every Ck chart compatible with that atlas is such a member (Countable base Banach manifold and smooth map).

[L2]

Implicit function theorem for Ck maps between Banach spaces, k≥1 (Implicit function theorem for Banach spaces); it is applied under the assumed AC.

[L3]

A bounded bijection between Banach spaces has a bounded inverse under DC (Bounded inverse theorem), and AC supplies DC (AC supplies the countable and dependent choices used in Banach integration).

[L4]

A complemented closed subspace has a closed complement with bounded projections; a bounded linear isomorphism carries a complemented subspace onto a complemented subspace (A complemented closed subspace of a normed space).

[L5]

Chain rule and the derivative of the identity for maps between open subsets of Banach spaces (Chain sum product and composition rules for Banach derivatives, Fréchet derivative between Banach spaces).

Proof

technique · direct
1.1L1L5

Fix p∈S:=f−1(q) and choose specified-atlas charts φ0:U→E of M at p and ψ:V→F of N at q. Put a:=φ0(p) and b:=ψ(q). The translated coordinate map φ:=φ0−a is a Ck chart compatible with the specified atlas of M; maximality therefore makes φ a chart of the structured manifold, and φ(p)=0. Writing L:=Df(p), the recentered coordinate representative f^(x):=ψ(f(φ−1(x)))−b is Ck on the open set Ω:=φ[U∩f−1[V]]⊆E, satisfies f^(0)=0, and has Df^(0)=Dψ(q)∘L∘Dφ(p)−1. Translations have identity derivative, so this follows from chart functoriality and the chain rule without requiring a translated target chart to belong to the atlas of N.

2.1step 1.1L1L4L5

The kernel of Df^(0) is K:=Dφ(p)[ker⁡L], a complemented subspace of E: the chart derivative Dφ(p) is a bounded linear isomorphism by [L1] and [L5] applied to φ∘φ−1=id, and [L4] transports the given complement of ker⁡L to a complement of K; moreover Df^(0) is surjective, because Dψ(q) and Dφ(p) are isomorphisms and L is onto.

3.1step 2.1L3L4algebra

Fix a topological direct sum E=K⊕E1 with bounded projections PK, PE1 existing by [step 2.1] and [L4], and let L1:=Df^(0)∣E1:E1→F. Then L1 is a bounded linear bijection: it is injective because ker⁡Df^(0)=K meets E1 only in 0, and surjective because Df^(0) is onto and agrees with L1 on E1; hence L1−1 is bounded by [L3] and AC supplies the DC that [L3] assumes.

4.1step 3.1L2

Define G:Ω′→F on the open set Ω′:={(w,u)∈K×E1:w+u∈Ω} by G(w,u):=f^(w+u). Then G is Ck, G(0,0)=0, and its partial derivative in the second variable at (0,0) is L1, a bounded linear isomorphism by [step 3.1]; by [L2] there are open neighbourhoods A⊆K of 0 and B⊆E1 of 0 and a Ck map h:A→B with {(w,u)∈A×B:f^(w+u)=0}={(w,h(w)):w∈A}.

5.1step 4.1L1L4L5algebra

The map Θ(w,u):=(w,u−h(w)) is a homeomorphism of A×E1 onto itself with inverse (w,v)↦(w,v+h(w)), and both maps are Ck. It carries the zero set {(w,h(w)):w∈A} of [step 4.1] onto the slice A×{0}. Let U1:=φ−1(A×B) and define Φ:=Θ∘φ∣U1. Its image Θ(A×B) is open, and Φ is a Ck chart compatible with every specified-atlas chart χ: on each overlap the two transitions are Φ∘χ−1=Θ∘φ∘χ−1,χ∘Φ−1=χ∘φ−1∘Θ−1, restricted to open domains, hence are Ck. Maximality of the specified atlas of M now implies that Φ is a chart of the structured manifold. Finally, Φ[U1∩S]=Φ[U1]∩(K⊕{0}), so Φ is the split chart required by the library definition.

6.1step 5.1L1L4L5algebra

In the charts Φ and ψ of [step 5.1], the coordinate representative of f is b+f^∘Θ−1; its derivative at 0 is Df^(0)∘DΘ(0)−1=Df^(0) because DΘ(0)=I. Indeed, h(0)=0 and Dh(0)=0, the latter by differentiating G(w,h(w))=0 at w=0 with [L5], which gives DKG(0,0)+L1 Dh(0)=0 and DKG(0,0)=Df^(0)∣K=0. Consequently the kernel of the differential of f at p, computed in the charts Φ and ψ, is exactly the set of classes [Φ,k] with k∈K, which by [step 5.1] is the tangent space of S at p; hence TpS=ker⁡Df(p).

7.1step 5.1step 6.1∎

Since p∈S was arbitrary, [step 5.1] gives a split chart for S at every one of its points, so S is a split Ck submanifold of M, and [step 6.1] identifies its tangent space at each p∈S with ker⁡Df(p).

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