Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 310 — Σⱼ pⱼwⱼ(p) = n for every p ∈ S_F

Proved
KhachiyanRound.BCD.lemma_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

d-optimal-designleveragep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a1,…,am∈Rna_1,\dots,a_m \in \mathbb{R}^na1​,…,am​∈Rn and let ppp be a point of the unit simplex with det⁡A(p)>0\det A(p) > 0detA(p)>0, where A(p)=∑ipiaiaiTA(p) = \sum_i p_i a_i a_i^{\mathsf T}A(p)=∑i​pi​ai​aiT​. With wj(p)=ajT[A(p)]−1ajw_j(p) = a_j^{\mathsf T}[A(p)]^{-1}a_jwj​(p)=ajT​[A(p)]−1aj​,

∑j=1mpj wj(p)=n.\sum_{j=1}^m p_j\, w_j(p) = n.j=1∑m​pj​wj​(p)=n.

The ppp-weighted average of the leverages is exactly the dimension. In particular max⁡jwj(p)≥n\max_j w_j(p) \ge nmaxj​wj​(p)≥n, so the accuracy ε(p)\varepsilon(p)ε(p) is nonnegative, and the identity is the complementary-slackness ingredient of the Kiefer–Wolfowitz conditions.

Formalization Note The page states the lemma in §2, whose standing assumptions are central symmetry (2.1), full dimension (2.2) and n≥2n \ge 2n≥2; the lemma uses none of them, and the Lean statement drops all three.

Preamble
import Mathlib
import Definitions.Def_LinearOptimization_Ellipsoid
import Definitions.Def_KhachiyanRound_BCD_Setting

open scoped Pointwise
Formal statement
namespace KhachiyanRound.BCD

theorem lemma_1 {ι : Type*} [Fintype ι] {n : ℕ} (a : ι → Fin n → ℝ)
    (p : ι → ℝ) (hp : p ∈ SF a) :
    ∑ j, p j * w a p j = (n : ℝ) := by sorry
end KhachiyanRound.BCD
Source
Khachiyan, Rounding of polytopes in the real number model of computation, Math. Oper. Res. 21 (1996), p. 310, Lemma 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me