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.
Bilevel learning, hypergradients, and implicit layers — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Automatic differentiation and backpropagation
- Automatic differentiation and computational graphs
- Banach-Space Differential Calculus and Banach Manifolds
- Bilevel learning, hypergradients, and implicit layers
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
A scalar ridge penalty and its validation hypergradient
Example
Let the hyperparameter be and the inner state be . For one unit-feature, unit-response training datum, define the scalar ridge objective , and define the validation objective . The unique inner minimizer is , so and . The local hypergradient formula gives the same derivative.
Example references
Facts & Assumptions
Given: , , and . Verify the stationary branch, direct outer derivative, and hypergradient.
Smooth bilevel stationary problems and their hypergradients: , , , and gradients are column vectors.
Hypergradient of a smooth local stationary branch: for an invertible stationary Hessian, .
Verification
Differentiate the inner loss: and . Thus its stationary point is . Completing the square gives , so this stationary point is the unique global minimizer.
Substitution into the outer loss gives , whose direct derivative is .
At , the mixed derivative is , the state derivative is , and . Formula [F2] therefore gives , agreeing with step 2.1.
A singular Hessian leaves the minimizing branch undetermined
Example
For and state , let and outer objective . The global minimizer set is and the inner Hessian is , which is singular. The two smooth minimizing branches and give outer objectives and , with derivatives and . Thus without a branch-selection rule the minimizing set determines no unique hypergradient, and the nonsingular-Hessian hypothesis of the local formula fails.
Example references
Facts & Assumptions
Given: The smooth inner loss and outer objective in the example. Verify the minimizing set, Hessian, and the two branch derivatives.
Smooth bilevel stationary problems and their hypergradients: a local stationary branch is a selection satisfying the stationarity residual equation.
Hypergradient of a smooth local stationary branch: an invertible state Hessian at a stationary base point guarantees a unique local stationary branch and its inverse-Hessian hypergradient formula.
Verification
The inner loss is nonnegative and equals zero exactly when , independently of . Therefore its full global minimizer set is .
Its state gradient is and its Hessian is , whose kernel contains and is therefore singular.
The maps and are both and lie in the minimizing set from step 1.1 for every . Their outer objectives are and , so their derivatives are respectively and .
Since these two admissible selections yield distinct derivatives and step 1.2 violates the invertibility hypothesis in [F2], the input does not determine one hypergradient through the argmin set, and the local formula does not apply.
An exact primal state can have a wrong finite-unroll derivative
Example
Fix and define for , with initialization , recurrence , and outer objective . The exact fixed-point branch is , so the exact hypergradient of is . For every finite , the -step iterate is . At it equals the exact state and its fixed-point residual is zero, but its derivative is . Thus an exact primal state and zero primal residual do not force the finite-unroll derivative to equal the implicit hypergradient.
Example references
Facts & Assumptions
Given: , , , and . For comparison with the stationary-branch formula, set on ; both and are polynomials, so they meet the and assumptions on these open domains. The stationarity equation is , which is equivalent to because . Compare the exact fixed-point derivative with the derivative of a finite iterate at .
Smooth bilevel stationary problems and their hypergradients: the exact stationary branch defines the outer objective whose derivative is the implicit hypergradient.
Finite fixed-point iteration sensitivity error bounds and the limits of residual control: a finite contraction iterate differentiates its finite composition, and its derivative can differ from the fixed-point sensitivity even with zero primal residual.
Hypergradient of a smooth local stationary branch: for a inner objective and outer objective with invertible stationary Hessian, the local branch hypergradient is .
Verification
Solving gives . Since , the unique fixed point is , and therefore has derivative . Also .
For , . If , then . Induction gives the displayed finite-iterate formula for every .
The inner objective has , so its stationary branch is the same as the fixed-point branch. Here , , , and . Formula [F3] therefore gives , verifying the exact hypergradient under the bilevel prerequisites.
At , step 1.2 gives and the fixed-point residual is . The stopped outer objective is , so .
Because and , , hence . Thus the zero residual at the exact state does not make the finite-unroll derivative equal to the exact hypergradient.
Sources
- Stephen Gould et al., On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization, §3
- MIT OpenCourseWare 18.S096, Matrix Calculus for Machine Learning and Beyond, Lecture 4 Part 2, §6.3.1
- Stephen Gould et al., On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization, §3.2
- J. Lebl, Basic Analysis II, §8.5.1, Theorem 8.5.6
- MIT OpenCourseWare 18.S096, Matrix Calculus for Machine Learning and Beyond, Lecture 4 Part 2, §§6.3.1–6.3.2