All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Johnson e div ne J

JohnsonBound.johnson_e_div_ne_J

Plain-language statement

The ratio e/n cannot equal J'(q, d/n) under the Johnson hypothesis.

Exact Lean statement

lemma johnson_e_div_ne_J {n d e : ℕ} {q : ℚ}
    (hn_pos : 0 < n) (hd_pos : 0 < d) (hq : 1 < q)
    (h_muln : ((e : ℚ) / n : ℝ) ≤ 1 - ((1 - (d : ℚ) / n) : ℝ).sqrt)
    (h_J_bound : 1 - ((1 - (d : ℚ) / n) : ℝ).sqrt ≤ J' q (d / n))
    (hqx : q / (q - 1) * (d / n) ≤ 1) :
    ((e : ℚ) / n : ℝ) ≠ J' q (d / n)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma johnson_e_div_ne_J {n d e : } {q : }    (hn_pos : 0 < n) (hd_pos : 0 < d) (hq : 1 < q)    (h_muln : ((e : ) / n : )  1 - ((1 - (d : ) / n) : ).sqrt)    (h_J_bound : 1 - ((1 - (d : ) / n) : ).sqrt  J' q (d / n))    (hqx : q / (q - 1) * (d / n)  1) :    ((e : ) / n : )  J' q (d / n) := by  intro h_eq  set δ := (d : ) / n  set frac := q / (q - 1)  have h_frac_pos : 1 < frac := by rw [lt_div_iff₀] <;> linarith  have h_sqrt_eq : 1 - √(1 - δ) = (1 / frac) * (1 - √(1 - frac * δ)) := by    rw [show (1 : ) - √(1 - (δ : )) = (e : ) / n from      by        dsimp [δ] at h_muln h_J_bound h_eq         norm_cast at h_muln h_J_bound h_eq         exact le_antisymm (h_J_bound.trans_eq h_eq.symm) h_muln]    rw [h_eq]    rfl  have h_frac_eq : 1 - √(1 - δ) = δ / (1 + √(1 - δ))  (1 / frac) *      (1 - √(1 - frac * δ)) = δ / (1 + √(1 - frac * δ)) := by    constructor    · rw [eq_div_iff] <;> ring_nf <;> norm_num      · rw [sq_sqrt] <;> norm_num        exact_mod_cast div_le_one_of_le₀ (show (d : )  n by          exact_mod_cast Nat.le_of_lt_succ <| by            rw [ @Nat.cast_lt ]; push_cast            nlinarith [show (1 : )  d by exact_mod_cast hd_pos,              show (1 : )  n by exact_mod_cast hn_pos,              mul_div_cancel₀ (d : ) (by positivity : (n : )  0),              div_mul_cancel₀ (q : ) (by linarith : (q - 1 : )  0)]) (by positivity)      · positivity    · field_simp [frac] at *      linarith [mul_self_sqrt (show 0  1 - (frac : ) * δ by        exact sub_nonneg_of_le <| mod_cast hqx)]  have h_sqrt_eq' : √(1 - frac * δ) = √(1 - δ) := by grind  rw [sqrt_inj] at h_sqrt_eq' <;> norm_cast at * <;>    nlinarith [show (0 : ) < δ by positivity]
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/CodingTheory/JohnsonBound/Lemmas.lean:459-495

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