Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2, p. 44 — ξ_u, ξ_v ∈ PB(ξ̃, C_p) and ⟨ξ_u,U⟩ = (u−C)/(u+C) ≤ 1 = ⟨ξ_v,U⟩, ⟨ξ_v,V⟩ = (v−C)/(v+C) ≤ 1 = ⟨ξ_u,V⟩

Proved
LuoSunLiu.PLBLower.two_point_construction

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

linear-banditslower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perturbed-linear-bandit

Let ξ~∈Rd\tilde\xi\in\mathbb R^dξ~​∈Rd have positive entries, let ju≠jvj_u\neq j_vju​=jv​ be two coordinates with u=ξ~juu=\tilde\xi_{j_u}u=ξ~​ju​​, v=ξ~jvv=\tilde\xi_{j_v}v=ξ~​jv​​, and let CCC satisfy 0≤C<u0\le C<u0≤C<u and C<vC<vC<v. Let U,V,ξu,ξvU,V,\xi_u,\xi_vU,V,ξu​,ξv​ be the two actions and two parameters of the two-point construction, and Cp=2CC_p=2CCp​=2C. Then

  1. ξu∈PB(ξ~,Cp)\xi_u\in PB(\tilde\xi,C_p)ξu​∈PB(ξ~​,Cp​) and ξv∈PB(ξ~,Cp)\xi_v\in PB(\tilde\xi,C_p)ξv​∈PB(ξ~​,Cp​), i.e. ∥ξu−ξ~∥∞≤C\|\xi_u-\tilde\xi\|_\infty\le C∥ξu​−ξ~​∥∞​≤C and ∥ξv−ξ~∥∞≤C\|\xi_v-\tilde\xi\|_\infty\le C∥ξv​−ξ~​∥∞​≤C;
  2. the inner products are
⟨ξu,U⟩=u−Cu+C≤1=⟨ξv,U⟩,⟨ξv,V⟩=v−Cv+C≤1=⟨ξu,V⟩.\langle\xi_u,U\rangle=\frac{u-C}{u+C}\le1=\langle\xi_v,U\rangle,\qquad \langle\xi_v,V\rangle=\frac{v-C}{v+C}\le1=\langle\xi_u,V\rangle.⟨ξu​,U⟩=u+Cu−C​≤1=⟨ξv​,U⟩,⟨ξv​,V⟩=v+Cv−C​≤1=⟨ξu​,V⟩.

So under ξu\xi_uξu​ the action VVV is optimal and UUU loses 2C/(u+C)2C/(u+C)2C/(u+C); under ξv\xi_vξv​ the action UUU is optimal and VVV loses 2C/(v+C)2C/(v+C)2C/(v+C). This is the first step of the proof of the Ω(CpT0)\Omega(C_pT_0)Ω(Cp​T0​) lower bound.

Formalization Note The statement is written with CCC and Cp=2CC_p=2CCp​=2C. It holds for any two distinct coordinates; the paper's choice of the smallest and second smallest entries is only needed in the per-period bound. The hypothesis 0≤C0\le C0≤C is the paper's implicit nonnegativity of the perturbation constant.

Preamble
import Mathlib
import Definitions.Def_LuoSunLiu_PLBLower_Model
import Definitions.Def_LuoSunLiu_PLBLower_TwoPoint
Formal statement
namespace LuoSunLiu.PLBLower

/-- Two-point construction (proof of Proposition 2, p. 44). With `C = C_p / 2`, i.e. `C_p = 2C`:
`ξ_u, ξ_v ∈ PB(ξ̃, C_p)`, `⟨ξ_u, U⟩ = (u − C)/(u + C) ≤ 1 = ⟨ξ_v, U⟩` and
`⟨ξ_v, V⟩ = (v − C)/(v + C) ≤ 1 = ⟨ξ_u, V⟩`, where `u = ξ̃_{ju}`, `v = ξ̃_{jv}`. -/
theorem two_point_construction {d : ℕ} (ξc : Fin d → ℝ) (hpos : ∀ i, 0 < ξc i)
    (C : ℝ) (hC0 : 0 ≤ C) (ju jv : Fin d) (hne : ju ≠ jv)
    (hCu : C < ξc ju) (hCv : C < ξc jv) :
    xiU ξc C ju jv ∈ PB ξc (2 * C) ∧ xiV ξc C ju jv ∈ PB ξc (2 * C) ∧
    xiU ξc C ju jv ⬝ᵥ actU ξc C ju = (ξc ju - C) / (ξc ju + C) ∧
    (ξc ju - C) / (ξc ju + C) ≤ 1 ∧
    xiV ξc C ju jv ⬝ᵥ actU ξc C ju = 1 ∧
    xiV ξc C ju jv ⬝ᵥ actV ξc C jv = (ξc jv - C) / (ξc jv + C) ∧
    (ξc jv - C) / (ξc jv + C) ≤ 1 ∧
    xiU ξc C ju jv ⬝ᵥ actV ξc C jv = 1 := by sorry

end LuoSunLiu.PLBLower
Source
Luo, Sun and Liu, arXiv:2109.07340v2, App. A, proof of Proposition 2, p. 44
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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