AFTD Auto-Formalizing Theoretical Domains

singleton_is_wolfe_corral

theoremverified

For any point p in ℝ^n, the singleton set {p} is a corral with affine minimizer p.

Statement

theorem singleton_is_wolfe_corral {n : ℕ} (p : Fin n → ℝ) :
    is_wolfe_corral {p} p
Source
arXiv:2611.12680 Sec. 2.2
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • 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…

Read back from the Lean

For any natural number $n$ and any vector $p : \text{Fin } n \to \mathbb{R}$, the singleton set $\{p\}$ is a Wolfe corral for $p$ (i.e., is_wolfe_corral {p} p).

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

To show that a singleton set {p} is a Wolfe corral with affine minimizer p, we verify the conditions of `is_wolfe_corral`. The singleton set is nonempty, the affine orthogonality condition holds trivially because the only point in {p} is p itself, and p is represented as a convex combination of points in {p} using weight 1.

  1. To show that {p} is a Wolfe corral with minimizer p, it suffices to show that {p} is nonempty, that the orthogonality condition holds, and that assigning weight 1 to p gives a valid convex combination.

    We supply the witnesses required by the definition of `is_wolfe_corral`: the singleton {p} is nonempty by `Finset.singleton_nonempty`, and we choose the constant function c(x) = 1 as the weight function.

    line 4

    uses Finset.singleton_nonempty

      refine ⟨Finset.singleton_nonempty p, ?_, fun _ => 1, ?_, ?_, ?_⟩
  2. For every q ∈ {p}, the inner product ∑ i, p i * (q i - p i) vanishes.

    Let q ∈ {p}. By `Finset.mem_singleton.mp`, q must equal p. Substituting p for q turns each term in the sum into p i * (p i - p i) = 0, so the sum evaluates to 0.

    lines 5–7

    uses Finset.mem_singleton.mp

      · intro q hq
        rw [Finset.mem_singleton.mp hq]
        simp
  3. The sum of the coefficients over {p} is 1.

    The sum of the constant function 1 over the singleton set {p} consists of a single term 1, which equals 1.

    line 8

      · simp
  4. The coefficient at each element of {p} is strictly positive.

    The weight assigned to any element is 1, and 0 < 1 holds by `Real.zero_lt_one`.

    lines 9–10

    uses Real.zero_lt_one

      · intro q _
        exact Real.zero_lt_one
  5. The weighted combination of elements in {p} recovers p.

    The sum over the singleton {p} is 1 • p, which simplifies directly to p.

    line 11

      · simp
Finset.singleton_nonempty
A singleton finite set {a} is nonempty.
Finset.mem_singleton.mp
If an element belongs to the singleton set {a}, it is equal to a.
Real.zero_lt_one
The real number 0 is strictly less than 1.

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

/-- Every singleton set {p} is a corral with affine minimizer p. -/theorem singleton_is_wolfe_corral {n : ℕ} (p : Fin n → ℝ) :    is_wolfe_corral {p} p := by  refine ⟨Finset.singleton_nonempty p, ?_, fun _ => 1, ?_, ?_, ?_⟩  · intro q hq    rw [Finset.mem_singleton.mp hq]    simp  · simp  · intro q _    exact Real.zero_lt_one  · simp
See it in the graphDiscuss this resultChallenge it