Corollary 3.1, p. 17 — ‖Θ̂ − Θ*‖∞ ≲ r₁ + r₄ (blocks (B.1)–(B.3))
ProvedLagrangeRank.Debias.corollary_3_1Let and . There are constants , depending only on and not on the dimension, such that the following holds for every .
Let and , and let with . Suppose
Then, with and the block-inverse matrices of p. 16,
In the paper, , , and , so this is Corollary 3.1, , on the three blocks (B.1)–(B.3) that its proof bounds. These are the blocks the proofs of Lemma A.1 and Theorem 3.1 use.
Formalization Note. The is made quantitative: and are chosen after and before . The smallness is the paper's "recall " (p. 43). The hypothesis is Assumption 3.3 at combined with Assumption 3.1. The printed claim is the -norm of the whole difference; its last row contains , which needs column sums of that Assumption 3.4 does not control, and the proof (B.1)–(B.3) bounds only the three blocks stated here.
import Mathlib import Definitions.Def_LagrangeRank_Debias_Setting
namespace LagrangeRank.Debias
open Matrix
theorem corollary_3_1 (c1 c2 c3 L2 : ℝ) (hc3 : 0 < c3) :
∃ C δ : ℝ, 0 < C ∧ 0 < δ ∧
∀ (d : ℕ) (OmHat OmStar : Matrix (Fin d) (Fin d) ℝ) (gHat gStar : Fin d → ℝ)
(ρ1 ρ4 : ℝ),
0 ≤ ρ1 → 0 ≤ ρ4 → ρ1 + ρ4 ≤ δ →
l1Norm gStar ≤ c1 → l1Norm (gHat - gStar) ≤ L2 * ρ1 →
rowSumNorm OmStar ≤ c2 → c3 ≤ gStar ⬝ᵥ (OmStar *ᵥ gStar) →
rowSumNorm (OmHat - OmStar) ≤ ρ4 →
|(thetaBlock OmHat gHat - thetaBlock OmStar gStar).toBlocks₂₂ () ()|
≤ C * (ρ1 + ρ4) ∧
‖fun k => (thetaBlock OmHat gHat - thetaBlock OmStar gStar).toBlocks₁₂ k ()‖
≤ C * (ρ1 + ρ4) ∧
rowSumNorm (thetaBlock OmHat gHat - thetaBlock OmStar gStar).toBlocks₁₁
≤ C * (ρ1 + ρ4) := by sorry
end LagrangeRank.Debias
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.