Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 graph form at a nonsingular derivative minor

Statement

Let 1≤q≤n, let U⊆Rn be open, and let F:U→Rq be C1 in the sense of Continuously differentiable maps, local inverses, and local diffeomorphisms. Suppose F(x∗)=0 and some q×q minor of the derivative matrix DF(x∗) is invertible. This nonsingular-minor hypothesis is the explicit full-row-rank condition used here. If q<n, then after permuting coordinates x=(u,v)∈Rn−q×Rq, there are open neighborhoods P of u∗ and Q of v∗ and a unique C1 map φ:P→Q such that

F(u,v)=0⟺v=φ(u)((u,v)∈P×Q).

Its derivative is

Dφ(u)=−DvF(u,φ(u))−1DuF(u,φ(u)).

Thus the local zero set is a graph over n−q free coordinates. If q=n, the zero is locally isolated, so the local graph dimension is zero. Here “local graph dimension k” means a local graph parameterized by an open subset of Rk, with a singleton counted as dimension zero.

Facts & Assumptions

Given: The open domain, C1 map, zero, dimensions, and invertible derivative minor in the Statement.

[F1]

Continuously differentiable maps, local inverses, and local diffeomorphisms: a map is C1 when it is totally differentiable everywhere and the entries of its derivative matrix are continuous.

[F2]

Invertible Euclidean linear maps: a square linear map is invertible when it has a two-sided linear inverse.

[L1]

The Euclidean implicit function theorem with derivative formula: for an open set W⊆Rm+q and a C1 map G:W→Rq with m,q≥1, (a,b)∈W, G(a,b)=0, and invertible second-block derivative DyG(a,b), there are open neighborhoods P,Q and a unique C1 map φ:P→Q with G(u,v)=0 exactly when v=φ(u) on P×Q. After shrinking these neighborhoods, DyG(u,φ(u)) is invertible and Dφ(u)=−DyG(u,φ(u))−1DxG(u,φ(u)).

[L2]

The Euclidean inverse function theorem: a C1 map between open subsets of Rn with invertible derivative at a point is a local C1 bijection with a C1 inverse.

[L3]

Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0: linear maps between Euclidean spaces have coordinate matrices and are bounded, hence continuous; a coordinate permutation is an invertible linear map.

[L4]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): composing a C1 map with a linear coordinate permutation preserves total differentiability and the derivative formula; [L3] and 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 make that permutation a homeomorphism, so it preserves open domains.

Proof

technique · reduction
1.1F1F2L1L3L4givenconstruct

First suppose q<n. Choose the coordinate permutation that puts the columns of the stated invertible minor into the second block v∈Rq, and write the remaining coordinates as u∈Rn−q. Composing F with the inverse permutation preserves openness and the C1 property by [F1], [L3], and [L4]; its second-block derivative at (u∗,v∗) is exactly the chosen invertible minor in the sense of [F2]. Since n−q≥1 and q≥1, [L1] applies and gives the neighborhoods, unique graph φ, equivalence, and displayed derivative formula.

2.1step 1.1algebra

The graph map u↦(u,φ(u)) is one-to-one because its first coordinate is u, and its inverse on the graph is coordinate projection. Its parameter domain P is open in Rn−q, so this is the claimed local graph dimension.

3.1F2L2givenalgebra∎

Now suppose q=n. The selected minor is the whole square derivative matrix DF(x∗), so it is invertible by [F2]. Apply [L2] on neighborhoods V of x∗ and W of 0. Injectivity of F∣V and F(x∗)=0 imply F(x)=0 for x∈V exactly when x=x∗. Thus the local zero set is a singleton and has the stated zero-dimensional graph form.

Depends on

Dependency tree · 2 levels

Sources