AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff

theoremverifiedformalizationimported Lean

Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F : Type*} [Field F] in
@[simp]
theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff (n : ℕ) (coeffs : Fin n → F) (i : Fin n) :
    (tailPolynomial (F := F) n coeffs).coeff i = coeffs i
Formalizes
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff`
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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 13

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F : Type*} [Field F] in@[simp]theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_coeff (n : ℕ) (coeffs : Fin n → F) (i : Fin n) :    (tailPolynomial (F := F) n coeffs).coeff i = coeffs i := by  have h := congrFun    (LinearEquiv.apply_symm_apply (_root_.Polynomial.degreeLTEquiv F n) coeffs) i  simpa [tailPolynomial, _root_.Polynomial.degreeLTEquiv] using h
See it in the graphDiscuss this resultChallenge it