All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Generates quotient point if is fiber of y

Binius.BinaryBasefold.generates_quotient_point_if_is_fiber_of_y

Plain-language statement

x is in the fiber of y under qMap_total_fiber iff y is the iterated quotient of x. That is, for binary field, the fiber of y is exactly the set of all x that map to y under the iterated quotient map.

Exact Lean statement

theorem generates_quotient_point_if_is_fiber_of_y
    (i : Fin ℓ) (steps : ℕ) (h_i_add_steps : i.val + steps ≤ ℓ)
    (x : sDomain 𝔽q β h_ℓ_add_R_rate (i := ⟨i, by omega⟩))
    (y : sDomain 𝔽q β h_ℓ_add_R_rate (i := ⟨i.val + steps, by omega⟩))
    (hx_is_fiber : ∃ (k : Fin (2 ^ steps)), x = qMap_total_fiber 𝔽q β (i := ⟨i, by omega⟩)
      (steps := steps) (h_i_add_steps := by
        simp only; exact fin_ℓ_steps_lt_ℓ_add_R i steps h_i_add_steps) (y := y) k) :
    y = iteratedQuotientMap 𝔽q β h_ℓ_add_R_rate i (k := steps) (h_bound := h_i_add_steps) x

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem generates_quotient_point_if_is_fiber_of_y    (i : Fin ℓ) (steps : ) (h_i_add_steps : i.val + steps  ℓ)    (x : sDomain 𝔽q β h_ℓ_add_R_rate (i := i, by omega))    (y : sDomain 𝔽q β h_ℓ_add_R_rate (i := i.val + steps, by omega))    (hx_is_fiber :  (k : Fin (2 ^ steps)), x = qMap_total_fiber 𝔽q β (i := i, by omega)      (steps := steps) (h_i_add_steps := by        simp only; exact fin_ℓ_steps_lt_ℓ_add_R i steps h_i_add_steps) (y := y) k) :    y = iteratedQuotientMap 𝔽q β h_ℓ_add_R_rate i (k := steps) (h_bound := h_i_add_steps) x := by -- Get the fiber index `k` and the equality from the hypothesis.  rcases hx_is_fiber with k, hx_eq  let basis_y := sDomain_basis 𝔽q β h_ℓ_add_R_rate    (i := i.val + steps, by omega) (h_i := by apply Nat.lt_add_of_pos_right_of_le; omega)  apply basis_y.repr.injective  ext j  conv_rhs =>    rw [getSDomainBasisCoeff_of_iteratedQuotientMap]  have h_repr_x := qMap_total_fiber_repr_coeff 𝔽q β i (steps := steps)    (h_i_add_steps := by omega) (y := y) (k := k) (j := j + steps, by simp only; omega)  simp only at h_repr_x  rw [hx_eq] at h_repr_x  simp only [fiber_coeff, add_lt_iff_neg_right, not_lt_zero', ↓reduceDIte, add_tsub_cancel_right,    Fin.eta] at h_repr_x  exact h_repr_x.symm
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/ProofSystem/Binius/BinaryBasefold/Prelude.lean:306-328

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