A finite-dimensional row family has one bounded sampling set for every coefficient vector
ProvedWeilDefect.MarkerStability.finite_sampling_rows_determine_allactual-zero-samplingfinite-dimensionalintegral-gram
Let be a finite index set and let be ANY family of rows, indexed by an arbitrary set . There is ONE finite subset , of size at most , such that for EVERY coefficient vector ,
The same is chosen before . No injectivity, independence of the full row family, enumeration, finiteness of , or nonzero common-kernel assertion is assumed.
Preamble
import Mathlib.Data.Complex.Basic import Mathlib.Data.Matrix.Mul import Mathlib.LinearAlgebra.Dimension.StrongRankCondition import Mathlib.LinearAlgebra.Dimension.Constructions set_option autoImplicit false open Matrix open scoped BigOperators Classical noncomputable section
Formal statement
theorem WeilDefect.MarkerStability.finite_sampling_rows_determine_all
{I Ω : Type*} [Fintype I] (r : Ω → (I → ℂ)) :
∃ G : Finset Ω, G.card ≤ Fintype.card I ∧
∀ c : I → ℂ, (∀ ρ ∈ G, r ρ ⬝ᵥ c = 0) ↔ ∀ ρ : Ω, r ρ ⬝ᵥ c = 0 := by sorry
Source
monocap-tech/weil, WeilDefect/Screening/FiniteSampling.lean, exact declaration WeilDefect.MarkerStability.finite_sampling_rows_determine_all, compiling source a5af8470c9220c0783752dac5c5a25fc842dbe0d