Lemma 3 (corrected: C1 on [A I]) — a feasible direction d from μ_* with dᵀAʲ = 0 on E₀ ∪ E₁ and dᵀx = 0 is zero
ProvedRLPBidPrice.Unbiased.lemma3_direction_eq_zeroLet be a 0/1 incidence matrix with nonzero columns, , , and satisfying Condition C1′ (whenever lies in the span of a set of columns of , that set spans ). Let be an optimal dual price vector, i.e. a minimizer of over . Let be a feasible direction from : for some ,
Fix and define
If for all and , then .
In the paper this is the step showing that no nonzero feasible direction leaves constant, which is how uniqueness of is obtained.
Formalization Note. The context of Eqs. (15)–(17) — the optimal , the feasible direction with its , and the step used in — is carried as hypotheses. is written d ⬝ᵥ (fun i => A i j).
Correction. The printed lemma assumes Condition 1 (only the columns of ); it is stated here under C1′ (the columns of ). With the printed condition it is false: for with rows , , and (for instance), is optimal and gives and with , while Condition 1 holds at .
import Mathlib import Definitions.Def_RLPBidPrice_Unbiased_Model open MeasureTheory Matrix
namespace RLPBidPrice.Unbiased
theorem lemma3_direction_eq_zero {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (r : Fin n → ℝ)
(hA : IsIncidence A) (hr : 0 ≤ r) (x : Fin m → ℝ) (hx : 0 ≤ x)
(hC1 : ConditionOnePrime A x) (y₀ : Fin n → ℝ) (hy₀ : 0 ≤ y₀)
(μs : Fin m → ℝ) (hμs : IsDualOpt A r x y₀ μs)
(d : Fin m → ℝ) (ε : ℝ) (hε : 0 < ε)
(hfeas : ∀ h ∈ Set.Icc (0 : ℝ) ε, 0 ≤ μs + h • d)
(h : ℝ) (hh : h ∈ Set.Ioc (0 : ℝ) ε)
(E₀ E₁ : Set (Fin n))
(hE₀ : E₀ = {j | r j - μs ⬝ᵥ (fun i => A i j) > 0})
(hE₁ : E₁ = {j | r j - μs ⬝ᵥ (fun i => A i j) = 0 ∧
r j - μs ⬝ᵥ (fun i => A i j) - h * d ⬝ᵥ (fun i => A i j) > 0})
(hdA : ∀ j ∈ E₀ ∪ E₁, d ⬝ᵥ (fun i => A i j) = 0)
(hdx : d ⬝ᵥ x = 0) :
d = 0 := by sorry
end RLPBidPrice.Unbiased
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a real matrix whose entries are all or and whose every column has a nonzero entry. Assume with and with . Assume satisfies Condition C1′:
for all finite and , if is a real linear combination of , then those vectors span .
Let with . Let be dual-optimal: and for all , where
The remaining data and hypotheses are:
- a vector and a real with for every ;
- a real ;
- the sets
Since , is the set of with and ;
- for every ;
- .
Conclusion: .
Degenerate cases.
- must be empty. Its members satisfy , but the hypothesis requires on . So the hypotheses can hold together only when no has and .
- C1′ restricts . Take and . Then C1′ forces every , so every . In particular, for and the hypotheses cannot be satisfied and the statement is vacuous.
- If , holds trivially.
- enters only through the dual optimality of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.