Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix B.1, p. 33 — (Σ̃ + λI)(β* − b) = (γ̃ − Σ̃b) − λb and ‖β* − b‖₂ ≤ (‖γ̃ − Σ̃b‖₂ + λ‖b‖₂)/(σ_min(Σ̃) + λ)

Proved
SynDigits.Ridge.population_coefficient_error

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

error-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1perturbation-boundridge-regression

Let Σ~∈Rm×m\tilde\Sigma \in \mathbb{R}^{m\times m}Σ~∈Rm×m be symmetric positive semidefinite, γ~,b∈Rm\tilde\gamma, b \in \mathbb{R}^mγ~​,b∈Rm, and λ≥0\lambda \ge 0λ≥0 with σmin⁡(Σ~)+λ>0\sigma_{\min}(\tilde\Sigma) + \lambda > 0σmin​(Σ~)+λ>0, where σmin⁡\sigma_{\min}σmin​ is the smallest singular value. Let β∗=(Σ~+λI)−1γ~\beta^* = (\tilde\Sigma + \lambda I)^{-1}\tilde\gammaβ∗=(Σ~+λI)−1γ~​. Then

(Σ~+λI)(β∗−b)=(γ~−Σ~b)−λb(\tilde\Sigma + \lambda I)(\beta^* - b) = (\tilde\gamma - \tilde\Sigma b) - \lambda b(Σ~+λI)(β∗−b)=(γ~​−Σ~b)−λb

and

∥β∗−b∥2≤1σmin⁡(Σ~)+λ(∥γ~−Σ~b∥2+λ∥b∥2).\|\beta^* - b\|_2 \le \frac{1}{\sigma_{\min}(\tilde\Sigma) + \lambda}\Big(\|\tilde\gamma - \tilde\Sigma b\|_2 + \lambda\|b\|_2\Big).∥β∗−b∥2​≤σmin​(Σ~)+λ1​(∥γ~​−Σ~b∥2​+λ∥b∥2​).

Combined with the structural split, this yields the second part of Theorem 4.1, the bound on the structural error ∥r∥2\|r\|_2∥r∥2​.

Formalization Note The hypothesis σmin⁡(Σ~)+λ>0\sigma_{\min}(\tilde\Sigma) + \lambda > 0σmin​(Σ~)+λ>0 makes Σ~+λI\tilde\Sigma + \lambda IΣ~+λI invertible, so β∗\beta^*β∗ is the genuine solution of (Σ~+λI)β∗=γ~(\tilde\Sigma + \lambda I)\beta^* = \tilde\gamma(Σ~+λI)β∗=γ~​ rather than Lean's junk value 000.

Differences from the source:

  • generalization: Σ̃ = (1/n)𝔼[ỸᵀỸ], γ̃ = (1/n)𝔼[ỸᵀỸ_v] for a random twin matrix → any positive semidefinite Sig, any vector gam; reason: every such expectation is symmetric PSD, so the statement specializes to the paper's; the argument uses only (Σ̃+λI)β* = γ̃ and Σ̃ ⪰ 0
  • encoding: (Σ̃+λI)⁻¹ exists (implicit) → 0 < sMin Sig + lam; reason: for PSD Σ̃ this excludes exactly the singular Σ̃ + λI, where the paper's β* and the bound's denominator are undefined; Lean's inverse returns 0 there
  • encoding: λ ≥ 0 (Ridge penalty, implicit) → 0 ≤ lam; reason: Ridge penalties are nonnegative; the printed λ‖b‖₂ equals ‖λb‖₂ only for λ ≥ 0
  • encoding: vectors in ℝⁿ, n×m matrices, ‖·‖₂, spectral norm, σ_min → Fin n → ℝ, Matrix (Fin n) (Fin m) ℝ, vnorm, GaussianMatrix.specNorm, GaussianMatrix.sMin; reason: Lean representation of the same objects; same instances
Preamble
import Mathlib
import Definitions.Def_GaussianMatrix_basic
import Definitions.Def_SynDigits_Ridge_Model
open Matrix GaussianMatrix
Formal statement
namespace SynDigits.Ridge

theorem population_coefficient_error {m : ℕ} (Sig : Matrix (Fin m) (Fin m) ℝ)
    (gam b : Fin m → ℝ) (lam : ℝ)
    (hSig : Sig.PosSemidef) (hlam : 0 ≤ lam) (hpos : 0 < sMin Sig + lam) :
    (Sig + lam • (1 : Matrix (Fin m) (Fin m) ℝ)) *ᵥ (betaStar Sig gam lam - b)
        = (gam - Sig *ᵥ b) - lam • b ∧
      vnorm (betaStar Sig gam lam - b)
        ≤ 1 / (sMin Sig + lam) * (vnorm (gam - Sig *ᵥ b) + lam * vnorm b) := by sorry

end SynDigits.Ridge
Source
Fan, Huang, Peng, Wang, Wu, SYN-DIGITS: A Synthetic Control Framework for Calibrated Digital Twin Simulation, arXiv:2604.07513v1, p. 33, Appendix B.1, proof of Theorem 4.1, "To bound ||b − β*||₂"
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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