wolfe_linopt_run
For 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 (k + 1) → (Fin n → ℝ), wolfe_linopt_run atoms k S w asserts that for every i : Fin k, wolfe_major_cycle atoms (S i.castSucc) (S i.succ) (w i.castSucc) (w i.succ) holds, and for every q ∈ atoms, 0 ≤ ∑ i : Fin n, w (Fin.last k) i * (q i - w (Fin.last k) i).
Statement
def wolfe_linopt_run {n : ℕ} (atoms : Set (Fin n → ℝ)) (k : ℕ) (S : Fin (k + 1) → Finset (Fin n → ℝ)) (w : Fin (k + 1) → (Fin n → ℝ)) : Prop
- Defined in
- arXiv:2611.12680 Sec. 2.2
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- 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'…
- Used by 1
- wolfe_linopt_run_terminal_optimalityFor any dimension n : ℕ, set of atoms atoms : Set (Fin n → ℝ), run length k : ℕ, corrals S : Fin (k + 1) → Finset (Fin n → ℝ), and vectors…
Read back from the Lean
Given an ambient dimension n, a set atoms ⊆ ℝⁿ, a step count k : ℕ, a sequence of k + 1 finite subsets S₀, ..., Sₖ of ℝⁿ, and a sequence of k + 1 vectors w₀, ..., wₖ in ℝⁿ:
wolfe_linopt_run asserts that:
1. For every index i ∈ {0, ..., k - 1} (represented by Fin k), a Wolfe major cycle transition occurs from (Sᵢ, wᵢ) to (Sᵢ₊₁, wᵢ₊₁) with respect to atoms.
2. The final iterate wₖ satisfies the termination/optimality condition: for every q ∈ atoms, the inner product ⟨wₖ, q - wₖ⟩ is non-negative, i.e., ∑ⱼ wₖ(j) * (q(j) - wₖ(j)) ≥ 0.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A complete Wolfe run of length k under the linopt rule. -/ def wolfe_linopt_run {n : ℕ} (atoms : Set (Fin n → ℝ)) (k : ℕ) (S : Fin (k + 1) → Finset (Fin n → ℝ)) (w : Fin (k + 1) → (Fin n → ℝ)) : Prop := (∀ i : Fin k, wolfe_major_cycle atoms (S i.castSucc) (S i.succ) (w i.castSucc) (w i.succ)) ∧ (∀ q ∈ atoms, 0 ≤ ∑ i : Fin n, w (Fin.last k) i * (q i - w (Fin.last k) i))