Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Dependent equality constraints have nonunique multiplier vectors

Statement refuted

Refuted: that the multiplier vector produced by the Lagrange multiplier rule is unique without any independence hypothesis on the constraint derivatives — equivalently, that the conclusion of The multiplier vector is unique when the constraint gradients are independent remains true when surjectivity of DG(u) is dropped.

The witness is the finite-dimensional problem X=R2, G(x,y)=(x,2x) and I(x,y)=x2+y2 (The Lagrange multiplier rule for finitely many regular constraints, Fréchet derivative between Banach spaces). On the level set G=0, which is the y-axis, the point u=(0,0) is the strict global minimiser of I, and DI(u)=0, while DG1(u)=(1,0) and DG2(u)=(2,0) are linearly dependent, so DG(u) is not surjective. The stationarity equation DI(u)=λ1DG1(u)+λ2DG2(u) holds exactly for the pairs with λ1+2λ2=0, a one-parameter family of multiplier vectors. Hence surjectivity of DG(u), equivalently independence of the constraint gradients, is what makes the multiplier unique.

Facts & Assumptions

Given: The maps G:R2→R2, G(x,y)=(x,2x), and I:R2→R, I(x,y)=x2+y2, with components G1(x,y)=x, G2(x,y)=2x, and the point u=(0,0).

[F1]

Fréchet derivative between Banach spaces: I and the components G1,G2 are differentiable everywhere with DI(x,y)=(2x,2y) as a linear functional, DG1≡(1,0) and DG2≡(2,0), and DG(x,y):R2→R2 is the linear map (ξ,η)↦(ξ,2ξ).

[F2]

The Lagrange multiplier rule for finitely many regular constraints, The multiplier vector is unique when the constraint gradients are independent: the multiplier rule asserts the existence of multipliers when DG(u) is surjective, and the uniqueness lemma shows that surjectivity is precisely the hypothesis that rules out the degeneracy exhibited here.

Counterexample

technique · direct

Given: The maps and point above.

1.1givenF1

The level set {G=G(u)}={(x,y):x=0} is the y-axis, and I(0,y)=y2≥0 with equality only for y=0; hence u=(0,0) is the strict global minimiser of I on the level set.

1.2givenF1

The derivatives at u are DI(u)=(0,0)=0, DG1(u)=(1,0) and DG2(u)=(2,0) by [F1]; the map DG(u):(ξ,η)↦(ξ,2ξ) has image {(a,2a):a∈R}≠R2, so DG(u) is not surjective, and DG2(u)=2 DG1(u) shows that the two constraint gradients are linearly dependent.

2.1step 1.2F1algebra

A pair (λ1,λ2)∈R2 satisfies λ1DG1(u)+λ2DG2(u)=DI(u) exactly when (λ1+2λ2,0)=(0,0), that is, exactly when λ1+2λ2=0; the solution set is the line of all pairs (−2t,t), t∈R, a one-parameter family.

3.1step 1.1step 1.2step 2.1F2∎

The stationarity equation therefore holds for infinitely many multiplier vectors although the constrained minimiser is unique, so the claim that uniqueness of the multiplier follows from stationarity alone is false; the uniqueness statement of [F2] genuinely requires the surjectivity, equivalently the independence, hypothesis.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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