PR #6453: checking the incidence on basis pairs suffices
ProvedPr6453Incidence.spec_of_basisThe finite verification principle for the incidence of a word.
The incidence is the data that says which input rows carry the coefficients of the first multiplicand and which carry those of the second (enc), how the target rows are read as CRT coordinates (read), and what the product is in those coordinates (P). The word acts by a linear map on its rows. All four maps are linear in each slot, so if the word produces the right answer on the basis pairs — for all — then it produces it on every pair of coefficient vectors.
This is what makes an incidence checkable: for a word with 1152 polynomial coefficients it reduces the specification to 1152 x 1152 basis inputs. What it does not do is exhibit the incidence of a particular word — the certificate records the shape of the module but not which column carries which coefficient.
import Mathlib set_option autoImplicit false
namespace Pr6453Incidence
theorem spec_of_basis {ι κ n : Type*} [Fintype ι] [DecidableEq ι] [Fintype κ] [Fintype n]
(enc : (ι → ℚ) →ₗ[ℚ] (ι → ℚ) →ₗ[ℚ] (n → ℚ))
(M : (n → ℚ) →ₗ[ℚ] (n → ℚ))
(read : (n → ℚ) →ₗ[ℚ] (κ → ℚ))
(P : (ι → ℚ) →ₗ[ℚ] (ι → ℚ) →ₗ[ℚ] (κ → ℚ))
(hbasis : ∀ i j, read (M (enc (Pi.single i 1) (Pi.single j 1))) =
P (Pi.single i 1) (Pi.single j 1)) :
∀ a b : ι → ℚ, read (M (enc a b)) = P a b := by
sorry
end Pr6453Incidence