All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Sqrt le J

JohnsonBound.sqrt_le_J

Plain-language statement

The binary Johnson bound 1 - √(1-δ) is at most the q-ary bound J q δ.

Exact Lean statement

lemma sqrt_le_J {q δ : ℚ} (hq : q > 1) (hx0 : 0 ≤ δ) (hx1 : δ ≤ 1)
    (hqx : q / (q - 1) * δ ≤ 1) :
    1 - √(1 - δ) ≤ J q δ

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma sqrt_le_J {q δ : } (hq : q > 1) (hx0 : 0  δ) (hx1 : δ  1)    (hqx : q / (q - 1) * δ  1) :    1 - √(1 - δ)  J q δ := by  unfold J  set frac := q / (q - 1) with hfrac  have hfrac_ge : frac  1 := by    rw [hfrac, ge_iff_le, one_le_div] <;> grind  have hx' : 1 - δ  0 := by grind only  have hfracx' : 1 - frac * δ  0 := by grind only  suffices 1 - √(1 - δ)  (1 / frac) * (1 - √(1 - frac * δ)) by grind only  field_simp  norm_cast  by_cases hδ : δ = 0  · simp [hδ]  · have hδ_pos : (0 : ) < δ := lt_of_le_of_ne hx0 (Ne.symm hδ)    have hfracx'2 : 1 - δ * frac  0 := by linarith [mul_comm frac δ]    rw [division_by_conjugate (b := ↑(1 - δ)) (by exact_mod_cast hx') (by positivity)]    rw [division_by_conjugate (b := ↑(1 - δ * frac))        (by exact_mod_cast hfracx'2) (by positivity)]    simp only [one_pow]    push_cast    rw [show (1 : ) - (1 - (δ : )) = δ from by ring,        show (1 : ) - (1 - (δ : ) * (frac : )) = δ * frac from by ring,        div_mul_eq_mul_div]    have hsqrt_le : √(1 - ↑δ * ↑frac)  √(1 - ↑δ) := by      apply sqrt_le_sqrt      nlinarith [show (1 : )  ↑frac from by exact_mod_cast hfrac_ge,                 show (0 : )  ↑δ from by exact_mod_cast hx0]    exact div_le_div_of_nonneg_left (by positivity) (by positivity) (by linarith)
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/JohnsonBound/Basic.lean:64-92

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.31.0

Affine gaps lifted to interleaved codes

affine_gaps_lifted_to_interleaved_codes

Project documentation

This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose coeff

ArkLib.Lattices.Ajtai.gadgetDecompose_coeff

Plain-language statement

The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record