All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Indicator eq 1 of neg empty empty of pos nonempty

Polynomial.indicator_eq_1_of_neg_empty_empty_of_pos_nonempty

Plain-language statement

The indicator polynomial is a constant one polynomial if the set neg is empty while pos is not.

Exact Lean statement

lemma indicator_eq_1_of_neg_empty_empty_of_pos_nonempty
  {pos : Finset F}
  (h_pos : pos.Nonempty) :
  indicator pos ∅ = 1

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma indicator_eq_1_of_neg_empty_empty_of_pos_nonempty  {pos : Finset F}  (h_pos : pos.Nonempty) :  indicator pos ∅ = 1 := by  unfold indicator  rw [Finset.nonempty_iff_ne_empty] at h_pos  apply Polynomial.eq_of_degree_sub_lt_of_eval_finset_eq (pos ∪ ∅) _ _  · apply lt_of_le_of_lt (Polynomial.degree_sub_le _ _) (max_lt _ _)    · convert Lagrange.degree_interpolate_lt _ _      aesop    · simpa using Finset.card_pos.mpr (Finset.nonempty_of_ne_empty h_pos)  · have {x} {y} (hy : y  pos.erase x) :      (x - y)⁻¹ * (x - y) = 1 :=        inv_mul_cancel₀ (sub_ne_zero_of_ne (by aesop))    aesop      (add simp        [Polynomial.eval_prod,          Finset.prod_eq_zero_iff,          Lagrange.basis,          Lagrange.basisDivisor,          Finset.prod_eq_one])      (add safe [(by rw        [Polynomial.eval_finsetSum,        Finset.sum_eq_single x])])
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Data/Polynomial/Indicator.lean:49-72

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