wolfe_linopt_run_terminal_optimality
For any dimension n : ℕ, set of atoms atoms : Set (Fin n → ℝ), run length k : ℕ, corrals S : Fin (k + 1) → Finset (Fin n → ℝ), and vectors w : Fin (k + 1) → (Fin n → ℝ), if wolfe_linopt_run atoms k S w holds, then for every q ∈ atoms, 0 ≤ ∑ j : Fin n, w (Fin.last k) j * (q j - w (Fin.last k) j).
Statement
theorem wolfe_linopt_run_terminal_optimality {n : ℕ} {atoms : Set (Fin n → ℝ)} {k : ℕ}
{S : Fin (k + 1) → Finset (Fin n → ℝ)} {w : Fin (k + 1) → (Fin n → ℝ)}
(hrun : wolfe_linopt_run atoms k S w) :
∀ q ∈ atoms, 0 ≤ ∑ j : Fin n, w (Fin.last k) j * (q j - w (Fin.last k) j)- Source
- arXiv:2611.12680 Lemma 1(c)
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- wolfe_linopt_runFor a set atoms : Set (Fin n → ℝ), a natural number k : ℕ, a family of subsets S : Fin (k + 1) → Finset (Fin n → ℝ), and vectors w : Fin…
- wolfe_major_cycleFor a set atoms : Set (Fin n → ℝ), finite subsets S, S' : Finset (Fin n → ℝ), and vectors w, w' : Fin n → ℝ, wolfe_major_cycle atoms S S'…
Read back from the Lean
Let $n, k \in \mathbb{N}$, $\mathit{atoms} \subseteq (\mathrm{Fin}\, n \to \mathbb{R})$, $S : \mathrm{Fin}(k + 1) \to \mathrm{Finset}(\mathrm{Fin}\, n \to \mathbb{R})$, and $w : \mathrm{Fin}(k + 1) \to (\mathrm{Fin}\, n \to \mathbb{R})$. Assuming $hrun : \mathrm{wolfe\_linopt\_run}\ \mathit{atoms}\ k\ S\ w$, the theorem asserts that for every $q \in \mathit{atoms}$, $$0 \le \sum_{j : \mathrm{Fin}\, n} w(\mathrm{Fin.last}\, k)(j) \cdot (q(j) - w(\mathrm{Fin.last}\, k)(j)).$$
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that the final iterate of a Wolfe linopt run satisfies the first-order optimality condition over the set of atoms. By definition, `wolfe_linopt_run` is a conjunction whose second clause is precisely this terminal optimality statement. The proof is immediate by projecting onto the second component of the hypothesis.
For every atom q ∈ atoms, the terminal iterate w(Fin.last k) satisfies 0 ≤ ∑ j, w(Fin.last k) j * (q j - w(Fin.last k) j).
By definition, the predicate `wolfe_linopt_run atoms k S w` is a conjunction whose second component is precisely the assertion that the terminal iterate w(Fin.last k) satisfies this optimality condition for all q ∈ atoms. The proof simply extracts this second conjunct (`hrun.2`) from the hypothesis `hrun`.
∀ q ∈ atoms, 0 ≤ ∑ j : Fin n, w (Fin.last k) j * (q j - w (Fin.last k) j) := hrun.2
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The terminal affine minimizer in a Wolfe linopt run satisfies global optimality over the atoms. -/theorem wolfe_linopt_run_terminal_optimality {n : ℕ} {atoms : Set (Fin n → ℝ)} {k : ℕ} {S : Fin (k + 1) → Finset (Fin n → ℝ)} {w : Fin (k + 1) → (Fin n → ℝ)} (hrun : wolfe_linopt_run atoms k S w) : ∀ q ∈ atoms, 0 ≤ ∑ j : Fin n, w (Fin.last k) j * (q j - w (Fin.last k) j) := hrun.2