Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: multiplication by a fixed vector on a product of fields

Definition
Pr6453_CRT

by gustasmickus · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebracomplexity-theoryinteger-multiplication

Multiplication by a fixed vector on a product of fields.

mulLin x is the map y ↦ x * y on ι → K, as a K-linear map. This is the shape a word's action takes once its rows are indexed by CRT coordinates: the product ring ∏_i K is the CRT image of a ring modulo a product of coprime moduli, and there multiplication is coordinatewise, i.e. multiplication by the coordinate vector of one factor.

The accompanying theorems show that in this basis the matrix of multiplication by x is the diagonal matrix of x, that composing two such multiplications gives the diagonal matrix of the product, and that the CRT isomorphism ZMod (m*n) ≃+* ZMod m × ZMod n carries products to products.

Definition code
/-
PR #6453: multiplication by a fixed vector, on a product of fields.
-/
import Mathlib

set_option autoImplicit false

namespace CRTBasis

variable {ι : Type*} [Fintype ι] [DecidableEq ι]
variable {K : Type*} [Field K]

/-- Multiplication by a fixed vector `x`, as a `K`-linear map on the product ring `ι → K` — the
shape a word's action takes once its rows are indexed by the CRT coordinates. -/
def mulLin (x : ι → K) : (ι → K) →ₗ[K] (ι → K) where
  toFun y := x * y
  map_add' y z := by funext i; simp [mul_add]
  map_smul' c y := by
    funext i
    simp only [Pi.mul_apply, Pi.smul_apply, smul_eq_mul, RingHom.id_apply]
    ring

@[simp] theorem mulLin_apply (x y : ι → K) : mulLin x y = x * y := rfl

end CRTBasis
Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4, RESULT.json (module block: the identity L S A B Idle S^-1 C R = D_A D_B (U(q) plus q plus q^-1), six fields, four Gaussian characters).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me