Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (19) — bc1,c2=min⁡γ>0∑i=12log⁡((1−ci2)24γ+1+ci22+14γ)>0b_{c_1,c_2}=\min_{\gamma>0}\sum_{i=1}^2\log\big(\tfrac{(1-c_i^2)^2}{4}\gamma+\tfrac{1+c_i^2}{2}+\tfrac1{4\gamma}\big)>0bc1​,c2​​=minγ>0​∑i=12​log(4(1−ci2​)2​γ+21+ci2​​+4γ1​)>0

Proved
MaskedLinx.display_19_b_pos

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

linx-boundlog-determinantmatrix-analysismaximum-entropy-samplingp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let c1,c2c_1,c_2c1​,c2​ be real numbers with c12≤1c_1^2\le1c12​≤1, c22≤1c_2^2\le1c22​≤1 and c12≠c22c_1^2\ne c_2^2c12​=c22​. For γ>0\gamma>0γ>0 put

φ(γ)=∑i=12log⁡((1−ci2)24 γ+1+ci22+14γ).\varphi(\gamma)=\sum_{i=1}^{2}\log\Big(\frac{(1-c_i^2)^2}{4}\,\gamma+\frac{1+c_i^2}{2}+\frac1{4\gamma}\Big).φ(γ)=i=1∑2​log(4(1−ci2​)2​γ+21+ci2​​+4γ1​).

Then the minimum of φ\varphiφ over γ>0\gamma>0γ>0 is attained, and its value

bc1,c2:=min⁡γ>0φ(γ)b_{c_1,c_2}:=\min_{\gamma>0}\varphi(\gamma)bc1​,c2​​:=γ>0min​φ(γ)

is strictly positive. Concretely: there is γ0>0\gamma_0>0γ0​>0 with φ(γ0)≤φ(γ)\varphi(\gamma_0)\le\varphi(\gamma)φ(γ0​)≤φ(γ) for all γ>0\gamma>0γ>0, and φ(γ0)>0\varphi(\gamma_0)>0φ(γ0​)>0.

In the proof of Theorem 4.1, c1c_1c1​ and c2c_2c2​ are the off-diagonal entries of the two kinds of 2×22\times22×2 blocks of the witness matrices, and bc1,c2/8b_{c_1,c_2}/8bc1​,c2​​/8 is the slope of the linear gap.

Formalization Note For γ>0\gamma>0γ>0 every argument of the logarithm is positive, so no junk value of Real.log occurs.

Differences from the source:

  • encoding: b_{c₁,c₂} := min_{γ>0} … > 0 → there is γ₀ > 0 minimizing φ over γ > 0, and φ(γ₀) > 0; reason: the paper's min asserts attainment; the explicit minimizer avoids an ℝ-valued infimum with junk values
Preamble
import Mathlib
Formal statement
namespace MaskedLinx

/-- **Display (19): `b_{c₁,c₂} > 0`.**
Chen, Fampa, Lee, *Masking Anstreicher's linx bound for improved entropy bounds*,
arXiv:2106.02980v1, §4, proof of Theorem 4.1, display (19), p.13:
"Thus we can choose c₁² ≠ c₂², then for all possible values of c₁,c₂,
b_{c₁,c₂} := min_{γ>0} Σ_{i=1}^{2} log(((1−cᵢ²)²/4)γ + (1+cᵢ²)/2 + 1/(4γ)) > 0."
The surrounding text fixes `c₁² ≤ 1`, `c₂² ≤ 1`.

The statement asserts both that the minimum over `γ > 0` is attained (at some `γ₀ > 0`) and
that its value is positive.

**Formalization Note.** For `γ > 0` every argument of `Real.log` is positive, so no junk value
of the logarithm is involved. -/
theorem display_19_b_pos (c₁ c₂ : ℝ) (h₁ : c₁ ^ 2 ≤ 1) (h₂ : c₂ ^ 2 ≤ 1)
    (hne : c₁ ^ 2 ≠ c₂ ^ 2) :
    let φ : ℝ → ℝ := fun γ =>
      Real.log ((1 - c₁ ^ 2) ^ 2 / 4 * γ + (1 + c₁ ^ 2) / 2 + 1 / (4 * γ)) +
      Real.log ((1 - c₂ ^ 2) ^ 2 / 4 * γ + (1 + c₂ ^ 2) / 2 + 1 / (4 * γ))
    ∃ γ₀ : ℝ, 0 < γ₀ ∧ (∀ γ : ℝ, 0 < γ → φ γ₀ ≤ φ γ) ∧ 0 < φ γ₀ := by sorry

end MaskedLinx
Source
Chen, Fampa, Lee, Masking Anstreicher's linx bound for improved entropy bounds, arXiv:2106.02980v1, §4, proof of Theorem 4.1, display (19), p.13 (the hypotheses c₁² ≤ 1, c₂² ≤ 1 and c₁² ≠ c₂² from the same proof)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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