AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_add

theoremverifiedformalizationimported Lean

tailPolynomial is additive in its coefficient vector.

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_add (n : ℕ) (a b : Fin n → F) :
    tailPolynomial (F := F) n (a + b) = tailPolynomial n a + tailPolynomial n b
Formalizes
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_add`
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 2
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F : Type*} [Field F] in/-- `tailPolynomial` is additive in its coefficient vector. -/theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.tailPolynomial_add (n : ℕ) (a b : Fin n → F) :    tailPolynomial (F := F) n (a + b) = tailPolynomial n a + tailPolynomial n b := by  simp [tailPolynomial]
See it in the graphDiscuss this resultChallenge it