Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_degree_lt
theoremverifiedformalizationimported Lean
tailPolynomial n coeffs has degree < n by construction.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_degree_lt (n : ℕ) (coeffs : Fin n → F) : (tailPolynomial (F := F) n coeffs).degree < n
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_degree_lt`
- 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.tailPolynomial_degree_lt← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_degree_lt (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:39): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeffCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomialThe tail polynomial determined by the first
ncoefficients.
- 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
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in /-- `tailPolynomial n coeffs` has degree `< n` by construction. -/ theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_degree_lt (n : ℕ) (coeffs : Fin n → F) : (tailPolynomial (F := F) n coeffs).degree < n := _root_.Polynomial.mem_degreeLT.1 (((_root_.Polynomial.degreeLTEquiv F n).symm coeffs : _root_.Polynomial.degreeLT F n)).2