Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Rule (3.6) gives (1+2γkμB)/γk2=(1−2γk+1μCη)/γk+12(1+2\gamma_k\mu_B)/\gamma_k^2 = (1-2\gamma_{k+1}\mu_C\eta)/\gamma_{k+1}^2(1+2γk​μB​)/γk2​=(1−2γk+1​μC​η)/γk+12​

Proved
ThreeOpSplitting.Accel.stepsize_identity_part1

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

accelerationp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1stepsize

Let μB≥0\mu_B \ge 0μB​≥0, μC>0\mu_C > 0μC​>0, η∈(0,1)\eta \in (0,1)η∈(0,1) and γ0>0\gamma_0 > 0γ0​>0, and let (γk)k≥0(\gamma_k)_{k \ge 0}(γk​)k≥0​ be generated by the stepsize rule (3.6). Then for every k≥0k \ge 0k≥0

1+2γkμBγk2=1−2γk+1μCηγk+12.\frac{1 + 2\gamma_k\mu_B}{\gamma_k^2} = \frac{1 - 2\gamma_{k+1}\mu_C\eta}{\gamma_{k+1}^2}.γk2​1+2γk​μB​​=γk+12​1−2γk+1​μC​η​.

This identity is what the rule (3.6) is designed for: it matches the coefficient of ∥xBk+1−x∗∥2\|x_B^{k+1} - x^*\|^2∥xBk+1​−x∗∥2 on the left of (3.9), divided by γk2\gamma_k^2γk2​, with the coefficient of ∥xBk+1−x∗∥2\|x_B^{k+1} - x^*\|^2∥xBk+1​−x∗∥2 on the right of (3.9) at the next step, divided by γk+12\gamma_{k+1}^2γk+12​, so that (3.9) telescopes.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Accel_Stepsizes

open Filter Topology
Formal statement
namespace ThreeOpSplitting.Accel

/-- Proof of Theorem 3.3, Part 1 (p. 845): the rule (3.6) ensures
`(1 + 2γ_kμ_B)/γ_k² = (1 - 2γ_{k+1}μ_Cη)/γ_{k+1}²` for all `k ≥ 0`. -/
theorem stepsize_identity_part1 (μB μC η γ0 : ℝ)
    (hμB : 0 ≤ μB) (hμC : 0 < μC) (hη0 : 0 < η) (hη1 : η < 1) (hγ0 : 0 < γ0) (k : ℕ) :
    (1 + 2 * stepsPart1 μB μC η γ0 k * μB) / stepsPart1 μB μC η γ0 k ^ 2
      = (1 - 2 * stepsPart1 μB μC η γ0 (k + 1) * μC * η) / stepsPart1 μB μC η γ0 (k + 1) ^ 2 := by sorry

end ThreeOpSplitting.Accel
Source
Davis and Yin, A Three-Operator Splitting Scheme and its Optimization Applications, Set-Valued Var. Anal. 25 (2017), https://doi.org/10.1007/s11228-017-0421-z, p. 845, Section 3.3, proof of Theorem 3.3, Part 1 (unnumbered display)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let μB,μC,η,γ0\mu_B, \mu_C, \eta, \gamma_0μB​,μC​,η,γ0​ be real numbers with

μB≥0,μC>0,0<η<1,γ0>0.\mu_B \ge 0,\qquad \mu_C > 0,\qquad 0 < \eta < 1,\qquad \gamma_0 > 0.μB​≥0,μC​>0,0<η<1,γ0​>0.

Let (γj)(\gamma_j)(γj​) be the sequence that starts at γ0\gamma_0γ0​ and satisfies

γj+1=−2γj2μCη+(2γj2μCη)2+4(1+2γjμB)γj22(1+2γjμB).\gamma_{j+1} = \frac{-2\gamma_j^2\mu_C\eta + \sqrt{(2\gamma_j^2\mu_C\eta)^2 + 4(1+2\gamma_j\mu_B)\gamma_j^2}}{2(1+2\gamma_j\mu_B)}.γj+1​=2(1+2γj​μB​)−2γj2​μC​η+(2γj2​μC​η)2+4(1+2γj​μB​)γj2​​​.

Here the square root of a negative number is read as 000, and division by 000 gives 000.

The theorem states that for every k∈Nk \in \mathbb{N}k∈N, including k=0k = 0k=0,

1+2γkμBγk2=1−2γk+1μCηγk+12.\frac{1 + 2\gamma_k\mu_B}{\gamma_k^2} = \frac{1 - 2\gamma_{k+1}\mu_C\eta}{\gamma_{k+1}^2}.γk2​1+2γk​μB​​=γk+12​1−2γk+1​μC​η​.

The quotients in this identity use the same convention that division by 000 gives 000. If some γk+1\gamma_{k+1}γk+1​ were 000, the right side would be read as 000, and similarly for γk\gamma_kγk​ on the left. The statement itself does not say that the γj\gamma_jγj​ are nonzero. For k=0k = 0k=0 the left side is (1+2γ0μB)/γ02(1 + 2\gamma_0\mu_B)/\gamma_0^2(1+2γ0​μB​)/γ02​ with the given γ0>0\gamma_0 > 0γ0​>0. The case μB=0\mu_B = 0μB​=0 is allowed.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me