Alphabeta Math
Session-authored (Fable 5 assisted)
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.

12 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Inverse Function Theorem Completed

1 · Prerequisites

2 · Summary

Multivariable total differentiation and the Euclidean inverse and implicit function theorems supply local C1 inverses, implicit solution maps, and their derivative formulas. The Newton-contraction estimate makes invertibility of the derivative stable near a regular point. Euclidean compactness controls proper maps, while polygonal connectedness of connected open sets lets one-variable constancy propagate along finitely many line segments. Higher mixed-partial notation supplies the Ck language used for regularity.

Componentwise Ck closure and smooth matrix inversion first upgrade local inverses and parametrized implicit solutions. The regular locus is then open; regular maps are open, and injectivity turns their local inverses into a diffeomorphism onto the image. Proper regular maps have finite diffeomorphic sheets with constant fibre cardinality over a connected target. The Jacobian sign gives local orientation and is constant on a connected regular domain, while vanishing total derivative is equivalent to constancy on a connected open domain.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Ck Euclidean maps and diffeomorphisms

Definition

Let kN, let m,q1, let URm be open, and let f:URq. A map f:URq is of class Ck when each component is of class Ck. Each scalar component uses the word-derivative convention of Ck maps and multi-index derivative notation in Euclidean space, whose source dimension is positive. The map is smooth, or C, when it is Ck for every kN.

Let n1 and let U,VRn be open. A bijection f:UV is a Ck diffeomorphism when both f and f1 are Ck. For k1, a local Ck diffeomorphism at aU is a restriction fP:PQ between open neighbourhoods of a and f(a) that is a Ck diffeomorphism. At k=1 this agrees with Continuously differentiable maps, local inverses, and local diffeomorphisms: continuous first partial derivatives give the required total derivative by If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, while continuity of the total derivative gives continuity of its matrix entries and hence of the first partial derivatives.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-21Open item page →

Ck Euclidean maps are closed under componentwise algebra and composition

Statement

Let kN. Finite componentwise sums and products of Ck Euclidean maps are Ck, and a composite of composable Ck Euclidean maps is Ck. Scalar multiples are included among the finite componentwise operations. The assertions remain valid on an empty open domain.

Facts & Assumptions

Given: Open Euclidean domains and maps for which the displayed sums, products, scalar multiples, or composites are defined. We use induction on derivative order (The principle of mathematical induction).

[F1]

A map f:URq is of class Ck when each component is of class Ck (Ck Euclidean maps and diffeomorphisms).

[L1]

If f is totally differentiable at a and g is totally differentiable at f(a), then gf is totally differentiable at a and D(gf)(a)=Dg(f(a))Df(a) (The chain rule for total derivatives: D(gf)(a)=Dg(f(a))Df(a)).

[L3]

If every first partial derivative exists near a point and is continuous there, then the map is totally differentiable there and its total derivative has matrix equal to its Jacobian (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).

[L5]

Total differentiability gives every directional and partial derivative by applying the total derivative to the corresponding direction vector (A total derivative computes every directional derivative, and its matrix is the Jacobian).

Proof

technique · induction
1.1

At order k=0, [F1] reduces the assertions to scalar component functions, and [L4] supplies closure under the stated operations; on an empty domain all these assertions are vacuous.

F1L4givenbase
1.2

Fix rN and assume that all the closure assertions hold through order r.

ih
2.1

Consider maps of class Cr+1. For a sum, scalar multiple, or componentwise product, [L2] on each coordinate line expresses every first partial derivative as a finite sum of products of Cr functions. For a composite, [L3] supplies total differentiability, [L1] gives its total derivative, and [L5] identifies the first partials with the columns of that derivative; hence every first partial is a finite sum of products of first partials of the factors. The hypothesis in step 1.2 makes all these first partials Cr, so [F1] makes the resulting maps Cr+1. Together with the base case, this proves the result through every finite k.

step 1.1step 1.2F1L1L2L3L5givenalgebradischarge-induction
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-21Open item page →

Matrix inversion preserves Ck regularity where the determinant is nonzero

Statement

Let m,n1, let URm be open, and let rN. If the entries of A:UMn(R) are Cr and detA never vanishes, then the entries of A1 are Cr.

Facts & Assumptions

[L1]

For an invertible square matrix, A1=det(A)1adj(A). (If det(A) is a unit, then A1=det(A)1adj(A))

[L2]

The function det:Mn(R)R is evaluation of the polynomial σSnsgn(σ)x1,σ(1)xn,σ(n). (For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries)

[L3]

Finite componentwise sums and products of Ck Euclidean maps are Ck, and a composite of composable Ck Euclidean maps is Ck (Ck Euclidean maps are closed under componentwise algebra and composition).

Proof

technique · direct
1.1

Every cofactor and the determinant are polynomial expressions in the Cr entries of A, so they are Cr by [L2] and [L3]; [L1] identifies the only remaining factor needed for the inverse.

L1L2L3
1.2

On R{0}, repeated differentiation of h(t)=t1 gives h(j)(t)=(1)jj!tj1. This formula follows by induction from the reciprocal and product rules, and every derivative displayed is continuous on that domain.

givenalgebra
2.1

Since detA never vanishes, its image lies in the domain of step 1.2. Thus (detA)1 is Cr by composition, and [L1] together with step 1.1 and [L3] makes every entry of A1 Cr.

step 1.1step 1.2L1L3
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A local inverse of a Ck regular map is Ck

Statement

Let k,n1, let URn be open, and let f:URn be Ck, with Df(a) invertible. Then every local inverse supplied by the inverse function theorem at a is Ck. In its inverse neighbourhood it satisfies

Dg(y)=Df(g(y))1.

Facts & Assumptions

Given: The hypotheses in the Statement and the Ck closure theorem Ck Euclidean maps are closed under componentwise algebra and composition.

[L1]

The inverse function theorem supplies an inverse g:WV that is C1 and satisfies Dg(y)=Df(g(y))1 (The Euclidean inverse function theorem).

[L2]

If the entries of A:UMn(R) are Cr and detA never vanishes, then the entries of A1 are Cr (Matrix inversion preserves Ck regularity where the determinant is nonzero).

Proof

technique · direct
1.1

By [L1], the local inverse exists, is C1, and satisfies Dg=(Dfg)1 throughout its domain.

L1
2.1

Suppose 1r<k and g is Cr. Because f is Ck, the entries of Df are Ck1, hence Cr when r<k; closure under composition makes Dfg Cr, and [L2] makes Dg Cr. Therefore g is Cr+1. Starting from step 1.1 and repeating this finite bootstrap reaches Ck.

step 1.1L2givenalgebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

The regular locus of a square-dimensional C1 map

Definition

Let n1, let URn be open, and let f:URn be C1 in the sense of Continuously differentiable maps, local inverses, and local diffeomorphisms. A point aU is regular when the linear map Df(a) is invertible (Invertible Euclidean linear maps). The regular locus is

Reg(f):={aU:Df(a) is invertible}.

Its complement in U is the singular locus of f.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

The regular locus of a C1 Euclidean map is open

Statement

Let n1. For a C1 map f:URn on an open URn, the regular locus Reg(f) (The regular locus of a square-dimensional C1 map) is open in U. The empty regular locus is included.

Facts & Assumptions

Given: The map and domain in the Statement, with openness understood in the metric topology The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement.

[L1]

At a point a where Df(a) is invertible, there is R>0 such that Df(x) is invertible for every xB(a,R) (Newton maps are uniform contractions near a point with invertible derivative).

Proof

technique · direct
1.1

Fix aReg(f). By [L1], some R>0 has B(a,R)Reg(f), so a is an interior point of the regular locus.

L1given
2.1

Every point of the regular locus is interior by step 1.1; if the locus is empty, it is open by definition. Thus Reg(f) is open.

step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A C1 map with everywhere-invertible derivative is open

Statement

Let n1, let URn be open, and let f:URn be C1. Suppose Df(x) is invertible for every xU. Then f maps every open subset of U to an open subset of Rn. Thus f is an open map (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Facts & Assumptions

Given: The map in the Statement and an open subset OU.

[L1]

At every point with invertible derivative, there are open sets V,WRn on which the map restricts to a C1 diffeomorphism onto W (The Euclidean inverse function theorem).

Proof

technique · direct
1.1

Let yf[O] and choose xO with f(x)=y. Apply [L1] at x and replace its source neighbourhood by its intersection with O; the image of that smaller neighbourhood is an open neighbourhood of y contained in f[O].

L1givenchoose
2.1

Thus every point of f[O] is interior. If O=, its image is the open empty set, so f[O] is open in every case.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

An injective regular C1 map is a diffeomorphism onto its image

Statement

Let n1, let URn be open, and let f:URn be injective and C1. Suppose Df(x) is invertible for every xU, equivalently U=Reg(f) (The regular locus of a square-dimensional C1 map). Then f[U] is open and f:Uf[U] is a C1 diffeomorphism. Its inverse g satisfies

Dg(f(x))=Df(x)1(xU).

Facts & Assumptions

[L1]

Let f:URn be C1 and suppose Df(x) is invertible for every xU. Then f maps every open subset of U to an open subset of Rn (A C1 map with everywhere-invertible derivative is open).

[L2]

For the local inverse g supplied by the inverse function theorem, Dg(y)=Df(g(y))1(yW). (The Euclidean inverse function theorem)

Proof

technique · direct
1.1

By [L1], f[U] is open and the continuous bijection f:Uf[U] is open. Therefore its inverse g:f[U]U is continuous.

L1given
2.1

Fix yf[U]. The unique global inverse agrees near y, by injectivity, with the local inverse from [L2]. Hence g is C1 near every image point and satisfies Dg(y)=Df(g(y))1 there. This proves the stated global C1 diffeomorphism and derivative formula.

step 1.1L2given
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-21Open item page →

An injective regular Ck map is a Ck diffeomorphism onto its image

Statement

Let k,n1, let URn be open, and let f:URn be an injective Ck map whose derivative is invertible everywhere. Then f[U] is open and the corestriction f:Uf[U] is a Ck diffeomorphism.

Facts & Assumptions

Given: The hypotheses in the Statement and the Ck diffeomorphism convention of Ck Euclidean maps and diffeomorphisms.

[L1]

Under the corresponding C1 hypotheses, f[U] is open and f:Uf[U] is a C1 diffeomorphism (An injective regular C1 map is a diffeomorphism onto its image).

[L2]

If f is Ck for k1, then every local inverse supplied by the inverse function theorem is Ck (A local inverse of a Ck regular map is Ck).

Proof

technique · direct
1.1

Since a Ck map with k1 is C1, [L1] supplies the open image and the unique global C1 inverse g:f[U]U.

L1
2.1

Around each yf[U], the inverse g agrees with the unique local inverse of f. By [L2] that restriction is Ck. Thus g is locally, and hence globally, Ck, so the corestriction is a Ck diffeomorphism.

step 1.1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

The parametrized implicit function theorem with Ck regularity

Statement

Let k,m,n1 and pN, let URm+n+p be open, and let F:URn be Ck. Suppose F(a,b,λ0)=0 and DyF(a,b,λ0) is invertible. Then there are neighbourhoods and a unique Ck map φ solving F(x,φ(x,λ),λ)=0. More precisely, on suitable open neighbourhoods P of (a,λ0) and Q of b,

F(x,y,λ)=0y=φ(x,λ),

and

Dφ(x,λ)=DyF(x,φ(x,λ),λ)1D(x,λ)F(x,φ(x,λ),λ).

When no parameter block is present, this is the ordinary Ck implicit function theorem.

Facts & Assumptions

Given: The dimensions and hypotheses in the Statement. The block map used below is Ck by Ck Euclidean maps are closed under componentwise algebra and composition, and matrix inversion has the regularity of Matrix inversion preserves Ck regularity where the determinant is nonzero.

[L1]

With an invertible second-block derivative, the C1 implicit theorem gives open neighbourhoods P of a and Q of b, and a unique C1 map solving the equation, together with its derivative formula (The Euclidean implicit function theorem with derivative formula).

[L2]

If a map is Ck for k1, every local inverse supplied by the inverse function theorem is Ck (A local inverse of a Ck regular map is Ck).

[L3]

A C1 map with invertible derivative has a local C1 inverse (The Euclidean inverse function theorem).

Proof

technique · direct
1.1

Put U~={(x,λ,y):(x,y,λ)U} and F~(x,λ,y)=F(x,y,λ). The coordinate permutation is linear, so U~ is open and F~ is Ck. Regard u=(x,λ) as the first variable block and apply [L1] to F~. It gives neighbourhoods P,Q, a unique C1 map φ:PQ, the equivalence F(x,y,λ)=0 if and only if y=φ(x,λ), and the combined-block derivative formula.

L1givenalgebra
2.1

On U~, the block map H(x,λ,y)=(x,λ,F(x,y,λ)) is Ck. Its derivative at the base point is block triangular with identity on the first block and invertible block DyF on the second, so [L3] supplies a local inverse G. By [L2], G is Ck. The identity H(G(u,z))=(u,z) forces G(u,z)=(u,ψ(u,z)); hence uψ(u,0) is a Ck solution of the equation. After intersecting the neighbourhoods, uniqueness in step 1.1 identifies this solution with φ.

step 1.1L2L3givenalgebra
3.1

Step 1.1 already supplies the displayed derivative formula for the unique C1 solution, while step 2.1 upgrades that same solution to Ck. Thus all regularity, equivalence, uniqueness, and derivative claims hold, including p=0.

step 1.1step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Proper maps between Euclidean open sets

Definition

Let URm and VRn be open, with their Euclidean metric topologies (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). A continuous map f:UV is proper when f1[K] is compact in U for every compact subset K of V. Continuity and compactness have the meanings of Continuity of a map between metric spaces, at a point and globally, in the ε-δ form and Open cover, subcover, compact metric space, and compact subset of a metric space.

Compactness here is intrinsic to the displayed subspaces. In particular, properness concerns compact subsets of V, not merely subsets compact in the ambient space by an unstated convention.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A proper Euclidean local diffeomorphism has finite diffeomorphic sheets near every target point

Statement

Let n1, let U,VRn be nonempty open sets, let V be connected, and let f:UV be a proper C1 map such that Df(x) is invertible for every xU. Then f is surjective, every fibre is finite, and every yV has an open neighbourhood whose preimage is a finite disjoint union of open sets, each carried C1-diffeomorphically onto that neighbourhood by f.

Facts & Assumptions

[L1]

A continuous map f:UV is proper when f1[K] is compact in U for every compact subset K of V (Proper maps between Euclidean open sets).

[L2]

A C1 map with everywhere-invertible derivative maps every open subset of its domain to an open subset of Rn (A C1 map with everywhere-invertible derivative is open).

[L3]

If K is a compact subset of a metric space X and f:XY is continuous into a metric space Y, then f[K] is compact in Y (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).

[L4]

A closed subset F of a compact metric space X is compact (A closed subset of a compact metric space is compact).

Proof

technique · direct
1.1

The map f is closed. Indeed, let AU be closed and let y lie in the closure of f[A]. Choose a compact closed target ball K about y contained in V. By [L1], f1[K] is compact; Af1[K] is compact by [L4], and its image is compact by [L3], hence closed in V. Every sufficiently small neighbourhood of y meets that image, so yf[A].

L1L3L4given
2.1

By [L2], f[U] is open, and by step 1.1 it is closed. It is nonempty, so connectedness of V gives f[U]=V. For yV, [L1] makes f1(y) compact. Local injectivity makes this fibre discrete, and its cover by neighbourhoods meeting the fibre in one point has a finite subcover; hence the fibre is nonempty and finite.

step 1.1L1L2given
3.1

Write f1(y)={x1,,xs}. Choose pairwise disjoint open local-inverse neighbourhoods Oi of the xi, with open images Wi. The closed set UiOi has closed image by step 1.1 and that image omits y. Therefore W:=(iWi)f[UiOi] is an open neighbourhood of y. Its preimage is the disjoint union of Oif1[W], and each restriction is a C1 diffeomorphism onto W.

step 1.1step 2.1givenchoose

Remarks

The neighbourhood property just proved is the one named by Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings . The simply-connected one-sheet consequence is A connected covering of a locally path-connected simply connected space is one-sheeted and trivial . Neither later result is used above.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

A proper Euclidean local diffeomorphism over a connected target has constant finite fibre cardinality

Statement

Under the hypotheses of A proper Euclidean local diffeomorphism has finite diffeomorphic sheets near every target point, there is a positive natural number d such that every fibre of f is equinumerous with a set of size d (Equinumerous sets, AB and AB).

Facts & Assumptions

Given: A proper regular C1 map f:UV with nonempty source and connected target V (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).

[L1]

Every yV has an open neighbourhood whose preimage is a finite disjoint union of open sets, each carried C1-diffeomorphically onto that neighbourhood by f (A proper Euclidean local diffeomorphism has finite diffeomorphic sheets near every target point).

Proof

technique · direct
1.1

Over a neighbourhood supplied by [L1], every fibre meets each sheet exactly once. Sending a fibre point to its unique sheet gives a bijection from every fibre there to the same nonempty finite sheet index set. Thus fibre cardinality is locally constant.

L1
2.1

For each positive natural d, let Vd be the set of target points with fibre cardinality d. Step 1.1 makes every Vd open, and the Vd form a disjoint cover of V. If two were nonempty, one and the union of all the others would disconnect V. Hence exactly one Vd is nonempty, and it is all of V.

step 1.1given
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Local orientation of a regular C1 Euclidean map

Definition

Let n1, let URn be open, and let f:URn be C1. At a regular point, the derivative matrix is invertible (The regular locus of a square-dimensional C1 map, A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms), so its determinant is a nonzero real number (An invertible square matrix over a commutative ring has unit determinant, Ordered field).

A regular C1 map is locally orientation-preserving where detDf>0 and locally orientation-reversing where detDf<0. These are the two possible signs of the Jacobian determinant The Jacobian determinant of a square-dimensional C1 map is the determinant of its Jacobian matrix at a regular point.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

The Jacobian sign of a regular C1 map is constant on a connected domain

Statement

Let n1, let URn be nonempty, open, and connected, and let f:URn be C1 with invertible derivative everywhere. Then either detDf(x)>0 for every xU or detDf(x)<0 for every xU. Thus f has one local orientation throughout U (Local orientation of a regular C1 Euclidean map).

Facts & Assumptions

Proof

technique · direct
1.1

The entries of Df are continuous, and [L1] expresses xdetDf(x) as a polynomial in them. Hence the Jacobian determinant is continuous on U.

L1given
2.1

By [L2], its image is a connected subset of R. Regularity excludes zero. If the image contained both a negative and a positive value, order-convexity would force it to contain zero, a contradiction. Nonemptiness therefore leaves exactly one sign throughout U.

step 1.1L2given
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-21Open item page →

A differentiable map on a connected open Euclidean set has zero derivative exactly when it is constant

Statement

Let m,q1, let URm be nonempty, open, and connected, and let f:URq be totally differentiable at every point (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(h2) remainder, Vector-valued functions f:ARm, their limits and continuity, with the dictionary to the metric notions). Then Df=0 on U if and only if f is constant on U.

Facts & Assumptions

Given: The map and domain in the Statement, with polygonal paths interpreted by Polygonal paths and polygonally connected subsets of Rn.

[L1]

Let URn be open. Then U is connected if and only if it is path-connected, if and only if it is polygonally connected (For an open subset of Rn, connectedness, path-connectedness and polygonal connectedness are equivalent).

[L2]

If g is totally differentiable at a and h is totally differentiable at g(a), then hg is totally differentiable at a and D(hg)(a)=Dh(g(a))Dg(a) (The chain rule for total derivatives: D(gf)(a)=Dg(f(a))Df(a)).

Proof

technique · direct
1.1

For the implication from constancy to zero derivative, a constant map has increment zero for every displacement. The zero linear map therefore leaves an identically zero remainder, so Df(a)=0 at every aU.

givenalgebra
2.1

For the implication from zero derivative to constancy, fix x,yU. By [L1], a finite polygonal path in U joins them. On each affine segment, [L2] makes every scalar component of the composite differentiable with derivative zero; [L3] makes that composite constant on the segment. The endpoint values agree successively along the finite path, so f(x)=f(y). Since x,y were arbitrary, f is constant.

L1L2L3given

5 · Examples, counterexamples and false statements

None yet.

Sources