wolfe_minor_reaches_eq_of_corral
If a support T : Finset (Fin n → ℝ) is a Wolfe corral with center w, then for any ambient weights lam : (Fin n → ℝ) → ℝ, any state final reachable from (T, lam) under the reflexive-transitive closure of wolfe_minor_step has final.1 = T.
Statement
theorem wolfe_minor_reaches_eq_of_corral {n : ℕ}
(T : Finset (Fin n → ℝ)) (lam : (Fin n → ℝ) → ℝ) (w : Fin n → ℝ)
(hcorral : is_wolfe_corral T w)
(final : Finset (Fin n → ℝ) × ((Fin n → ℝ) → ℝ))
(hreach : Relation.ReflTransGen wolfe_minor_step (T, lam) final) :
final.1 = T- Source
- arXiv:2611.12680 Sec. 2.2
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- is_wolfe_corralA non-empty finite set S of atoms in ℝ^n is a corral with affine minimizer w if w is an affine combination of S with strictly positive…
- wolfe_minor_stepFor states (T, lam) and (T', lam') in Finset (Fin n → ℝ) × ((Fin n → ℝ) → ℝ), wolfe_minor_step asserts that T is not a Wolfe corral, and…
- is_affine_minimizerFor a finite set T of vectors in ℝ^n, a vector w : Fin n → ℝ, and ambient weights μ : (Fin n → ℝ) → ℝ, is_affine_minimizer T w μ asserts…
Read back from the Lean
For any natural number $n$, finite set $T \subseteq \mathbb{R}^n$, function $\lambda : \mathbb{R}^n \to \mathbb{R}$, point $w \in \mathbb{R}^n$, and state $\text{final} \in \mathrm{Finset}(\mathbb{R}^n) \times (\mathbb{R}^n \to \mathbb{R})$: if $(T, w)$ satisfies is_wolfe_corral, and $\text{final}$ is reachable from the initial state $(T, \lambda)$ by zero or more steps of the relation wolfe_minor_step (i.e. Relation.ReflTransGen wolfe_minor_step (T, lam) final), then the first component of $\text{final}$ is equal to $T$.
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 proof analyzes whether the reflexive-transitive path from (T, lam) to final has length zero or at least one, using Relation.ReflTransGen.cases_head. If zero steps are taken, final is (T, lam) and the claim holds by definition. If at least one step is taken, the definition of wolfe_minor_step requires that T cannot be a Wolfe corral, which directly contradicts the hypothesis that T is a corral with center w.
If zero steps are taken, final.1 = T holds trivially; thus it suffices to derive a contradiction assuming at least one minor step is taken.
By Relation.ReflTransGen.cases_head, reaching final from (T, lam) means either zero steps occurred (so final = (T, lam)), or there was an initial transition to some intermediate state c. When zero steps occur, final.1 = (T, lam).1 = T holds by reflexivity, closing this case.
uses
Relation.ReflTransGen.cases_headrcases Relation.ReflTransGen.cases_head hreach with rfl | ⟨c, hstep, _⟩ · rfl
Taking even one minor step from (T, lam) is impossible, which eliminates the remaining case.
Unpacking the intermediate state c into (T', lam') and expanding the definition of wolfe_minor_step, any transition out of (T, lam) explicitly requires that T is not a Wolfe corral (¬ ∃ w', is_wolfe_corral T w'). But the hypothesis hcorral shows that w is a corral center for T, directly contradicting that requirement. Applying False.elim closes the branch.
uses
False.elim· rcases c with ⟨T', lam'⟩ dsimp [wolfe_minor_step] at hstep exact False.elim (hstep.1 ⟨w, hcorral⟩)
Relation.ReflTransGen.cases_head- If an element b is reachable from an element a under the reflexive-transitive closure of a relation r, then either a = b (zero steps) or there exists an intermediate state c such that r a c holds and b is reachable from c.
False.elim- The principle of explosion (ex falso quodlibet): any proposition can be derived from False.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- If the initial support is already a corral, no minor cycle can occur and the support is preserved. -/theorem wolfe_minor_reaches_eq_of_corral {n : ℕ} (T : Finset (Fin n → ℝ)) (lam : (Fin n → ℝ) → ℝ) (w : Fin n → ℝ) (hcorral : is_wolfe_corral T w) (final : Finset (Fin n → ℝ) × ((Fin n → ℝ) → ℝ)) (hreach : Relation.ReflTransGen wolfe_minor_step (T, lam) final) : final.1 = T := by rcases Relation.ReflTransGen.cases_head hreach with rfl | ⟨c, hstep, _⟩ · rfl · rcases c with ⟨T', lam'⟩ dsimp [wolfe_minor_step] at hstep exact False.elim (hstep.1 ⟨w, hcorral⟩)