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.
Finite-budget regularized gradient on a Stiefel constraint
Definition
For integers , define the real Stiefel constraint set
Equip with the Frobenius inner product and norm . Let , let be a real Hilbert space, let be open and contain , and let be continuously Fréchet differentiable. Given data , a reference matrix , and , define the residual and regularized objective by
Supply an ambient gradient oracle satisfying for every and , an initial frame , a residual tolerance , a finite integer budget , and a step schedule with every . For a square matrix , put . The tangent-projection and metric-dual calculation for this objective, well-definedness of every tangent polar call, and finite-budget feasibility are justified by the finite-budget return and feasibility lemma. No smoothness beyond is required. The procedure is:
-
Set the current frame to and the schedule index to . If , return .
-
While , compute and the Stiefel gradient . If , return .
-
Set and form the polar-retracted candidate
-
Evaluate and . If , return . Otherwise accept as the current frame. If its residual is at most , return ; otherwise increment by one and repeat the loop.
-
When , return .
This procedure is restricted to the stated finite-dimensional real Stiefel constraint and the displayed polar retraction. It gives no convergence, global-optimality, or noisy-data stability guarantee, and it makes no finite-precision claim. It does not apply to positivity constraints or other nonlinear manifolds without a separately specified compatible retraction and proof.
Definition references
Finite-budget return, tangent metric-dual formula, and feasibility ↗
Nonlinear forward maps on real Hilbert spaces
Real Stiefel and Grassmann metric conventions
Stiefel tangent space and orthogonal projection
Polar retraction formula and domain
The polar map is a Stiefel retraction
Absil, Mahony, and Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3, Example 3.6.2
Absil, Mahony, and Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 4, Example 4.1.3
Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds, §§3.8 and 7.3
Depends on
Used by
Dependency tree · two levels
20 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
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 3 (2008) (standard reference, not scraped)
- P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization Algorithms on Matrix Manifolds, Chapter 4 (2008) (standard reference, not scraped)
- Nicolas Boumal, An Introduction to Optimization on Smooth Manifolds (2023 prepublication) (standard reference, not scraped)