Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ
theoremverifiedformalizationimported Lean
If the tail polynomial has degree < n, then the sharing polynomial has degree < n + 1.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ (secretValue : F) (tail : _root_.Polynomial F) {n : ℕ} (hdeg : tail.degree < n) : (sharingPolynomial secretValue tail).degree < (n + 1 : WithBot ℕ)
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ`
- Lean proof
- By Samuel Schlesinger, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:90): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.natDegree_sharingPolynomial_leIf the tail polynomial has degree
< n, then the sharing polynomial has natural degree at mostn. - Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomialThe standard Shamir sharing polynomial
s + X * q(X). - Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_evalCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.natDegree_sharingPolynomial_leIf the tail polynomial has degree
- Used by 1
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_tailPolynomial_lt_succThe coefficient-vector version of
degree_sharingPolynomial_lt_succ.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_tailPolynomial_lt_succThe coefficient-vector version of
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F : Type*} [Field F] in/-- If the tail polynomial has degree `< n`, then the sharing polynomial has degree `< n + 1`. -/theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succ (secretValue : F) (tail : _root_.Polynomial F) {n : ℕ} (hdeg : tail.degree < n) : (sharingPolynomial secretValue tail).degree < (n + 1 : WithBot ℕ) := by by_cases hsharing : sharingPolynomial secretValue tail = 0 · simp [hsharing] · rw [_root_.Polynomial.degree_eq_natDegree hsharing] exact_mod_cast Nat.lt_succ_of_le (natDegree_sharingPolynomial_le secretValue tail hdeg)