Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Hypergradient of a smooth local stationary branch

Statement

Let p,d≥1, let Θ⊆Rp and W⊆Rd be open, and let f:Θ×W→R be C2 and g:W×Θ→R be C1. Here C1 means total differentiability with continuous derivative, and C2 means the derivative map is C1. Define F(θ,w)=∇wf(θ,w), H(θ,w)=DwF(θ,w), and B(θ,w)=DθF(θ,w). Suppose F(θ0,w0)=0 and H(θ0,w0) is invertible. Then there are open neighborhoods P⊆Θ and Q⊆W of θ0 and w0 and a unique C1 local stationary branch w∗:P→Q through (θ0,w0), meaning w∗(θ0)=w0 and F(θ,w∗(θ))=0 for every θ∈P. After shrinking P if necessary, H(θ,w∗(θ)) is invertible and

Dw∗(θ)=−H(θ,w∗(θ))−1B(θ,w∗(θ)).

Write H−T:=(H−1)T. For J(θ)=g(w∗(θ),θ), where ∂θg holds w fixed and gradients are column vectors, the hypergradient is

∇θJ(θ)=∂θg(w∗(θ),θ)−B(θ,w∗(θ))TH(θ,w∗(θ))−T∇wg(w∗(θ),θ).

The local branch need not be a global inner optimizer. In the separate global regime where, for every θ∈P, f(θ,⋅) is defined on all of Rd and, for some μ>0, satisfies f(θ,v)≥f(θ,u)+∇wf(θ,u)T(v−u)+μ2∥v−u∥22 for every u,v∈Rd, each stationary point is the unique global minimizer.

Facts & Assumptions

Given: Open parameter and state domains, the C2 inner objective, the C1 outer objective, a stationary point (θ0,w0), and an invertible inner Hessian at that point.

[F1]

Smooth bilevel stationary problems and their hypergradients: F=∇wf is the inner stationarity residual, H=DwF, B=DθF, and the local outer objective is J(θ)=g(w∗(θ),θ).

[F2]

The Euclidean implicit function theorem with derivative formula: for a C1 residual with zero value and invertible state-block derivative, there are neighborhoods with a unique C1 solution branch.

[L1]

The Euclidean implicit function theorem with derivative formula: after shrinking the neighborhoods, the state-block derivative stays invertible along the branch and its derivative is minus the inverse state Jacobian times the parameter Jacobian.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a composition of finite-dimensional totally differentiable maps is the composition of their derivatives.

Proof

1.1givenF1F2construct

Put F(θ,w)=∇wf(θ,w). Since f is C2, this residual is C1 on the open product domain; it vanishes at (θ0,w0) and its state derivative is the invertible matrix H(θ0,w0). Applying [F2] gives open neighborhoods and a unique C1 local branch w∗ through that point.

2.1step 1.1F1L1algebra

The derivative clause of [L1], evaluated along this branch after shrinking its parameter neighborhood, gives Dw∗(θ)=−H(θ,w∗(θ))−1B(θ,w∗(θ)).

2.2step 1.1F1F3algebra

The map θ↦(w∗(θ),θ) is C1, so [F3] applied to g and this map yields ∇θJ=∂θg+(Dw∗)T∇wg.

3.1step 2.1step 2.2algebra

Substitute step 2.1 into step 2.2 and use (H−1B)T=BTH−T. This is the asserted column-gradient hypergradient formula.

4.1givenstep 1.1algebra∎

In the stated global regime, fix any θ∈P and any stationary point u∈Rd, so ∇wf(θ,u)=0. For every v≠u, the strong-convexity inequality gives f(θ,v)≥f(θ,u)+μ2∥v−u∥22>f(θ,u). Thus this arbitrary stationary point is the unique global minimizer, proving the claim for every stationary point wherever the global regime holds.

Depends on

Used by

Dependency tree · two levels

12 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