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.

14 results · all verified · 10 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 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Constant Rank, Submersions, Immersions and Regular Level Sets

1 · Prerequisites

2 · Summary

The Euclidean inverse function theorem turns an invertible derivative into local coordinates, while higher inverse regularity preserves the Ck class. Rank, nullity, kernels, images, matrix rank, and finite-dimensional orthogonal decomposition describe which derivative coordinates can be inverted and which remain free. These results supply the algebraic and analytic inputs for rank persistence, coordinate normal forms, and tangent kernels.

Differential rank, rectangular minors, submersions, immersions, regular values, level sets, and their tangent spaces are defined first. Nonzero minors make rank lower semicontinuous and provide source coordinates for the constant-rank normal form. Its maximal-rank cases yield local projection and inclusion theorems, openness of submersions, and local graph descriptions of regular levels. Curve velocities identify the tangent kernel intrinsically, after which a finite-dimensional factorization argument proves the vector-valued Lagrange multiplier theorem and its scalar-constraint form.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The rank of a derivative and constant-rank Euclidean maps

Definition

Let m,n1, let URm be open, and let f:URn be C1 (Ck Euclidean maps and diffeomorphisms). The rank of f at aU is rankaf:=rankDf(a), where rank is the dimension of the image (Rank and nullity of a linear map with finite-dimensional domain). In the standard bases, this is also the rank of the Jacobian matrix Jf(a) (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case).

For SU and 0rmin{m,n}, the map f has constant rank r on S when rankDf(x)=r for every xS. On the empty set this condition is vacuous, so it may hold for more than one r; every assertion that needs a determined rank will assume S is nonempty or specify r.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Submatrices and minors of a rectangular matrix

Definition

Let A=(aij)Mm×n(R) be a matrix over a commutative ring (Finite rectangular matrices over a commutative ring, their entries, rows and columns). For increasing lists of distinct row indices I=(i0,,ir1) and column indices J=(j0,,js1), the submatrix A[I,J] is the r×s matrix whose (p,q) entry is aipjq.

When r=s1, the (I,J)-minor is detA[I,J] (For n1, the determinant over a commutative ring by the Leibniz formula, and detA for a real matrix), and it is called an r-rowed minor. The positive-size condition is part of the terminology here: no determinant of an empty matrix is introduced.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A matrix has rank at least r exactly when it has a nonzero r-rowed minor

Statement

Let AMm×n(R) and let 1rmin{m,n}. Then rankAr if and only if some r-rowed minor of A is nonzero (Submatrices and minors of a rectangular matrix). Equivalently, the rank of A is the largest positive size of a nonzero minor when A0, and it is 0 when every entry is zero (The rank of a matrix equals the rank of the linear map xAx).

Facts & Assumptions

Given: A real m×n matrix A and a natural r with 1rmin{m,n}.

Proof

technique · direct
1.1

Suppose first that the (I,J)-minor is nonzero, and write B=A[I,J] for the corresponding r×r submatrix.

given
1.2

Conversely, suppose rankAr. Choose r independent columns and form the resulting m×r matrix C. Its column rank and hence its row rank are r, so its rows span Rr and contain r independent rows.

givenL1choose
2.1

By [L2], B is invertible. If a linear combination of the r columns of A indexed by J vanishes, restricting that equality to the rows in I gives Bc=0, hence c=0. Those columns are independent, so rankAr.

step 1.1L1L2
3.1

The r×r submatrix determined by those columns and rows has rank r, so [L2] makes its determinant nonzero. This is an r-rowed minor of A, proving the converse and the equivalence.

step 1.2L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Differential rank is lower semicontinuous

Statement

Let f:URmRn be C1 on an open set. For every natural r, the locus Ur:={xU:rankDf(x)r} is open. Thus xrankDf(x) is lower semicontinuous. In particular the submersion locus, the immersion locus, and every locus on which the derivative has the largest possible rank are open.

Facts & Assumptions

Given: A C1 map f:URmRn and a natural number r.

[L2]

Each fixed-size determinant is a polynomial in the matrix entries, while the first partial derivatives of a C1 map are continuous; sums, products, and composites of continuous Euclidean maps are continuous, and the empty set and whole metric space are open (For every fixed finite size at least one, the determinant of a real square matrix is a polynomial in its matrix entries, Ck Euclidean maps and diffeomorphisms, Ck Euclidean maps are closed under componentwise algebra and composition, 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).

Proof

technique · direct
1.1

If r=0, then Ur=U; if r>min{m,n}, then Ur=. Both sets are open.

givenL2
1.2

Assume 1rmin{m,n} and fix aUr. By [L1], one r-rowed minor M(a) of Jf(a) is nonzero.

givenL1choose
2.1

By [L2], the same minor M(x) is a continuous scalar function of x. Its nonzero locus contains an open neighbourhood V of a, and [L1] gives VUr.

step 1.2L1L2
3.1

Every point of Ur therefore has an open neighbourhood inside it, and the two exceptional cases were settled in step 1.1. Hence Ur is open for every r, proving all stated consequences.

step 1.1step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-24Open item page →

Submersions and immersions between Euclidean open sets

Definition

Let m,n1, let URm and VRn be open, and let f:UV be C1.

The map is an immersion or submersion when the corresponding condition holds at every point of U.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Regular and critical points, regular and critical values, and level sets

Definition

Let m,n1, let URm be open, and let f:URn be C1.

  • A point aU is a regular point of f when f is a submersion at a, and a critical point otherwise (Submersions and immersions between Euclidean open sets).
  • A value cRn is a regular value when every af1({c}) is a regular point. A value that is not regular is a critical value. In particular every value outside f[U] is regular by vacuous truth.
  • The level set or fibre over c is f1(c):={xU:f(x)=c}.

Regularity is a condition on the derivative at points of the fibre, not a claim that the fibre is nonempty.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The tangent space to a regular level set

Definition

Let f:URmRn be C1, let c be a regular value, and let af1(c) (Regular and critical points, regular and critical values, and level sets). For af1(c) regular, Ta(f1(c)):=kerDf(a). This kernel (Kernel and image of a linear map) is the tangent space to the regular level set at a.

Since Df(a) is surjective, rank-nullity gives dimTa(f1(c))=mn (Rank-nullity: dimFV=nullityT+rankT). Thus the definition introduces an existing linear subspace of the asserted dimension; it makes no assignment when the fibre is empty because there is then no point a.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A nonzero rank minor supplies the source coordinates for the constant-rank theorem

Statement

Let k1, let f:URmRn be Ck, and suppose rankDf(a)=r. After permuting source and target coordinates, if r>0 the leading r×r minor of Df(a) is nonzero and Φ(x)=(f0(x),,fr1(x),xr,,xm1) is a local Ck diffeomorphism at a. If r=0, the same conclusion holds with Φ equal to the identity map. Empty coordinate blocks are omitted.

Facts & Assumptions

Given: The map f, the point a, and r=rankDf(a).

[L2]

A real square matrix is invertible exactly when its determinant is nonzero; a C1 map between equal-dimensional Euclidean open sets with invertible derivative at a point is a local C1 diffeomorphism there, and a Ck map has a Ck local inverse (A finite square real matrix is invertible if and only if its determinant is nonzero, The Euclidean inverse function theorem, A local inverse of a Ck regular map is Ck, Ck Euclidean maps and diffeomorphisms).

Proof

technique · direct
1.1

If r=0, take Φ=idU; it is a Ck diffeomorphism on every open neighbourhood of a.

given
1.2

Suppose r>0. By [L1], choose a nonzero r-rowed minor and permute coordinates so it is the leading minor. The derivative DΦ(a) is block triangular with that r×r block and an identity block of size mr on its diagonal.

givenL1choose
2.1

Its determinant is the nonzero leading minor, including the full-rank case r=m where the identity block is empty. Thus [L2] makes DΦ(a) invertible and Φ a local Ck diffeomorphism at a.

step 1.2L2algebra
3.1

Steps 1.1 and 2.1 cover every possible rank and give the asserted source coordinates.

step 1.1step 2.1
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

In source rank coordinates, the remaining components depend only on the rank coordinates

Statement

Assume the hypotheses of A nonzero rank minor supplies the source coordinates for the constant-rank theorem and that f has constant rank r near a. In the source coordinates y=Φ(x), shrink to a rectangular neighbourhood P×QRr×Rmr and write g=fΦ1,g(u,v)=(u,h(u,v)). Then h(u,v) is independent of v. When r=0, g is locally constant; when r=m, the v block is empty; and when r=n, the h block is empty.

Facts & Assumptions

Given: A Ck map of constant rank r near a and the local coordinates Φ from the source-coordinate lemma.

[L2]

A differentiable map with zero derivative on a nonempty connected open Euclidean set is constant (A differentiable map on a connected open Euclidean set has zero derivative exactly when it is constant).

Proof

technique · direct
1.1

Shrink the coordinate image to a product of open rectangles P×Q around Φ(a). By [L1], g is Ck, has constant rank r, and its first r components are the coordinates u.

givenL1
2.1

If r<n and r<m, any nonzero partial derivative hi/vj would join the identity r×r block of Dg to form a nonzero (r+1)-rowed minor, contradicting constant rank r by [L1]. Hence all derivatives of vh(u,v) vanish.

step 1.1L1algebra
3.1

For each fixed u, the rectangle Q is connected and [L2] makes vh(u,v) constant. If r=0, the same argument applies to all components on the connected rectangle; if r=m or r=n, the relevant block is empty and the conclusion is immediate.

step 2.1L2
4.1

Thus, after shrinking, g(u,v)=(u,h(u)) in every rank regime.

step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The Euclidean constant-rank normal form

Statement

Let k1, let f:URmRn be Ck, and suppose f has constant rank r on a neighbourhood of a. There are local Ck coordinate diffeomorphisms α at a and β at f(a), both sending the distinguished point to 0, such that βfα1(u,v)=(u,0) for (u,v)Rr×Rmr near 0. The final zero lies in Rnr; every zero-dimensional block is omitted.

Facts & Assumptions

Given: The stated Ck map, point, and constant rank r.

[L1]

Source rank coordinates make fΦ1 equal to (u,h(u)) after shrinking, and a differentiable map with zero derivative on a connected open set is constant (A nonzero rank minor supplies the source coordinates for the constant-rank theorem, In source rank coordinates, the remaining components depend only on the rank coordinates, A differentiable map on a connected open Euclidean set has zero derivative exactly when it is constant).

[L2]

Finite sums, differences, componentwise maps, and composites of Ck Euclidean maps are Ck (Ck Euclidean maps are closed under componentwise algebra and composition).

Proof

technique · direct
1.1

Translate the source and target distinguished points to 0 and apply [L1], obtaining g(u,v)=(u,h(u)) on a product neighbourhood.

givenL1
2.1

Define the target shear β(z,w)=(z,wh(z)). It is a Ck diffeomorphism with explicit inverse (z,w)(z,w+h(z)) by [L2].

step 1.1L2construct
3.1

The composite satisfies β(g(u,v))=(u,0). When r=0, [L1] makes f locally constant before the target translation; when r=m or r=n, the empty blocks make the same displayed formula literal.

step 1.1step 2.1L1
4.1

Taking α to be the translated source coordinate map gives the asserted local normal form.

step 3.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A Euclidean submersion is locally a coordinate projection

Statement

Let k1 and let f:URmRn be Ck. Near a submersion point there are Ck coordinates in which the map is (u,v)u. If m=n, it is a local Ck diffeomorphism.

Facts & Assumptions

Given: A submersion point a of f.

[L1]

At a submersion point Df(a) is surjective and has rank n (Submersions and immersions between Euclidean open sets); the rank-at-least-n locus is open (Differential rank is lower semicontinuous).

[L2]

A constant-rank-n map has local normal form (u,v)(u,0) with the target zero block in R0 (The Euclidean constant-rank normal form).

Proof

technique · direct
1.1

By [L1], Df has rank at least n on a neighbourhood of a; it cannot have larger rank, so its rank is constantly n there.

givenL1
2.1

Apply [L2]. Because nr=0, its normal form is exactly the projection (u,v)u.

step 1.1L2
3.1

If m=n, the v block is also empty, so the normal form is the identity and f is a local Ck diffeomorphism.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A Euclidean immersion is locally the canonical inclusion and is locally an embedding

Statement

Let k1 and let f:URmRn be Ck. Near an immersion point there are Ck coordinates in which the map is the canonical inclusion u(u,0). After restricting its domain, f is an embedding onto its local image. If m=n, it is a local Ck diffeomorphism.

Facts & Assumptions

Given: An immersion point a of f.

[L1]

At an immersion point Df(a) is injective and has rank m, and the rank-at-least-m locus is open (Submersions and immersions between Euclidean open sets, Differential rank is lower semicontinuous).

[L2]

An embedding is an injective map whose corestriction is a homeomorphism onto its image (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological); the constant-rank normal form at rank m is u(u,0) (The Euclidean constant-rank normal form).

Proof

technique · direct
1.1

By [L1], the derivative has constant rank m near a.

givenL1
2.1

By [L2], coordinate diffeomorphisms turn the restriction of f into i(u)=(u,0). This map is injective and its inverse on i[U] is the continuous projection onto the first m coordinates.

step 1.1L2
3.1

Conjugating by the coordinate diffeomorphisms shows that the restricted f is an embedding. If m=n, the zero block is empty and the normal form is a local diffeomorphism.

step 2.1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

Euclidean submersions are open maps

Statement

Every C1 Euclidean submersion is an open map: if f:URmRn is a submersion and OU is open, then f[O] is open in Rn.

Facts & Assumptions

Proof

technique · direct
1.1

If O=, its image is open. Otherwise fix yf[O] and choose xO with f(x)=y.

givenchoose
2.1

Shrink the local source neighbourhood from [L1] so that it lies in O. In the local coordinates, [L2] shows that its image contains an open neighbourhood of y lying in f[O].

step 1.1L1L2
3.1

Every point of f[O] is therefore interior, so f[O] is open.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A constant-rank level set is locally a coordinate slice

Statement

Let f:URmRn be Ck, k1, and have constant rank r near a. Put c=f(a). In the source coordinates of the constant-rank theorem, there is a neighbourhood W of 0 such that α(f1(c))W=W({0}r×Rmr). Thus a nonempty constant-rank level set is locally a coordinate slice of dimension mr. If a level set is empty, the pointwise assertion has no instance.

Facts & Assumptions

Given: The map f, point a, value c=f(a), and constant rank r near a.

[L1]

The level set over c is f1(c)={x:f(x)=c} (Regular and critical points, regular and critical values, and level sets).

[L2]

Local coordinates may be chosen so that a and c become 0 and the map becomes (u,v)(u,0) (The Euclidean constant-rank normal form).

Proof

technique · direct
1.1

Apply [L2] and restrict to its source coordinate neighbourhood W.

givenL2
2.1

By [L1], a point in W represents a point of f1(c) exactly when (u,0)=(0,0), which is exactly the condition u=0; the vRmr coordinates are free.

step 1.1L1algebra
3.1

Pulling this slice back by α1 gives the stated local description. The formula also covers r=0 and r=m through the empty-block convention.

step 2.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

A regular level set is locally a Ck graph of dimension mn

Statement

Let f:URmRn be Ck, k1, and let c be a regular value. Near each point, a regular level set is a Ck graph over kerDf(a) of dimension mn.

More precisely, for af1(c) put K=kerDf(a) and E=K, so Rm=KE. There are neighbourhoods PK of 0 and QE of 0 and a Ck map g:PQ with g(0)=0 and Dg(0)=0 such that, near a, f1(c)={a+u+g(u):uP}. The empty fibre satisfies the regular-value convention vacuously, and when m=n the local graph has zero-dimensional domain and is the isolated point a.

Facts & Assumptions

Given: The stated map, regular value c, and a point af1(c).

[L2]

If K is a subspace of the finite-dimensional Euclidean inner-product space Rm, then Rm=KK; rank-nullity gives dimK=mn, and the inverse function theorem turns an invertible derivative into a local C1 diffeomorphism whose inverse is Ck when the original map is Ck (For a subspace W of a finite-dimensional inner product space, V=WW, Rank-nullity: dimFV=nullityT+rankT, The Euclidean inverse function theorem, A local inverse of a Ck regular map is Ck).

Proof

technique · direct
1.1

By [L1], f has constant rank n near a, and its fibre is a Ck coordinate slice. By [L2], put E=K, so Rm=KE and dimK=mn.

givenL1L2construct
2.1

The projection of that slice to K along E has derivative equal to the identity at a: its tangent there is K, because differentiating the normal-form slice and undoing the source coordinates gives kerDf(a). By [L2], this projection is a local Ck diffeomorphism.

step 1.1L2algebra
3.1

Inverting the projection writes the slice uniquely as a+u+g(u). Its derivative at 0 takes values both in E and in the tangent K, so Dg(0)=0; the zero-dimensional case is the same statement with P={0}.

step 2.1algebra
4.1

This gives the asserted graph and dimension at every point of a nonempty regular fibre, while the empty-fibre case is vacuous.

step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Tangent vectors to a regular level set are exactly its curve velocities

Statement

Let f:URmRn be Ck, k1, let c be a regular value, and let af1(c). A vector v lies in Ta(f1(c)) if and only if it is the velocity at zero of a C1 curve γ:(ε,ε)f1(c) with γ(0)=a.

Facts & Assumptions

Given: The map, regular value, point, and vector vRm.

[L2]

Locally the fibre is a+u+g(u) over K=kerDf(a), with g(0)=0 and Dg(0)=0 (A regular level set is locally a Ck graph of dimension mn).

Proof

technique · direct
1.1

For the forward direction, suppose γ lies in the fibre and γ(0)=a. Then fγ is constant, so [L1] gives Df(a)γ(0)=0 and hence γ(0)Ta(f1(c)).

givenL1
1.2

For the reverse direction, suppose vTa(f1(c))=K. Using [L2], define γ(t)=a+tv+g(tv) for sufficiently small t. This curve lies in the fibre, satisfies γ(0)=a, and has γ(0)=v+Dg(0)v=v.

givenL1L2construct
2.1

The two implications are independent and exhaustive. In particular v=0 is realized by the same construction, or by the constant curve.

step 1.1step 1.2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A linear functional annihilating the kernel of a surjection is a unique transpose multiple

Statement

Let A:RmRn be a surjective linear map, with m,n1, and let :RmR be linear. If vanishes on kerA, then there is a unique λRn such that (v)=λ,Avfor every vRm. Equivalently, the row vector of is ATλ.

Facts & Assumptions

Given: The surjective linear map A and the linear functional vanishing on kerA.

Proof

technique · direct
1.1

For each standard basis vector ej, choose wjRm with Awj=ej, and define λj=(wj). These are finitely many choices.

givenL1choose
2.1

For vRm, put w=j<n(Av)jwj. Then Aw=Av by [L1] and linearity, so vwkerA and (v)=(w)=j<n(Av)jλj=λ,Av.

step 1.1L1L2algebra
3.1

If both λ and μ work, surjectivity gives v with Av=λμ; then 0=λμ,Av=λμ22, so λ=μ. This proves existence and uniqueness.

step 2.1L1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

Lagrange multipliers for a regular vector-valued level-set constraint

Statement

Let URm be open, let f:UR and G:URq be C1, and suppose a is a local maximum or minimum of f subject to G(x)=c. If DG(a) is surjective, then there is a unique λRq such that Df(a)v=λ,DG(a)v(vRm), or equivalently f(a)=DG(a)Tλ. This is a necessary condition, not a sufficient condition for a constrained extremum.

Facts & Assumptions

Given: The maps f,G, the regular constrained point a, and c=G(a).

[L1]

If c is a regular value of a C1 map on an open set, then at every point a of its fibre a vector lies in the tangent space exactly when it is the velocity at zero of a C1 curve through a inside that fibre (Tangent vectors to a regular level set are exactly its curve velocities).

[L4]

For a C1 map the locus where the derivative has rank at least r is open, so the submersion locus is open (Differential rank is lower semicontinuous); a value is regular when every point of its fibre is a submersion point (Regular and critical points, regular and critical values, and level sets).

[L2]

A local extremum is defined by the objective inequality on a neighbourhood, and if a differentiable function restricted to a differentiable curve has a local extremum, then its derivative along the curve is zero (Local and strict local extrema for scalar fields on Euclidean open sets, A constrained local extremum annihilates every velocity of a differentiable parametrization).

Proof

technique · direct
1.1

By [L4] the set W of points of U at which DG is surjective is open, and aW; on W every point of every fibre is a submersion point, so c is a regular value of GW and a is a local extremum of f subject to GW=c. Fix vkerDG(a). By [L1] applied to GW, choose a level-set curve γ with γ(0)=a and γ(0)=v inside GW1(c)G1(c). The constrained local extremum condition in [L2] makes fγ locally extremal at 0.

givenL1L2L4choose
2.1

By [L2], Df(a)v=0. Since v was arbitrary, the functional Df(a) vanishes on kerDG(a).

step 1.1L2
3.1

Apply [L3] to the surjection DG(a). It gives a unique λ with Df(a)v=λ,DG(a)v for all v, and the gradient representation turns this equality of functionals into f(a)=DG(a)Tλ.

step 2.1L3
4.1

The argument derives the multiplier equation from a constrained extremum and makes no converse assertion, as claimed.

step 3.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

For one regular constraint, the objective gradient is a scalar multiple of the constraint gradient

Statement

Let f,G:URmR be C1, and suppose a is a local maximum or minimum of f subject to G(x)=c. If G(a)0, then there is a unique scalar λ such that f(a)=λG(a).

Facts & Assumptions

Given: The functions, constrained local extremum, and nonzero constraint gradient.

[L1]

For a scalar function, the Jacobian is the row G(a)T (The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case), so DG(a):RmR is surjective exactly when G(a)0.

[L2]

At a constrained local extremum with DG(a) surjective, there is a unique λR such that f(a)=DG(a)Tλ (Lagrange multipliers for a regular vector-valued level-set constraint).

Proof

technique · direct
1.1

By [L1], the nonzero-gradient hypothesis makes DG(a) surjective.

givenL1
2.1

Apply [L2]. Since the transpose of the one-row matrix DG(a) sends λ to λG(a), its conclusion is the displayed equation.

step 1.1L2algebra
3.1

Uniqueness is part of [L2] and also follows directly from G(a)0.

step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources