claimroutineinferred_dep
Specialization preserves non-membership with high probability
Random specialization keeps outside the span with probability
finishes the alignment failure estimate
Statement (paper)
For each fixed and each fixed evaluation set of size , when the entries are uniform and independent, the probability that the specialized column lies in the column span of the specialized matrix over is at most . Consequently, by a union bound over the finitely many such sets (depending only on ) and conditioning on injectivity, the alignment condition fails with probability tending to zero as .
In plain English
For fixed and a fixed evaluation set of size , with the entries uniform and independent, the specialized column lies in the column span of the specialized matrix with probability at most . A union bound over the finitely many sets , together with conditioning on injectivity, shows the alignment condition fails with probability tending to zero as .
Why it's here
The previous claim shows is outside the column span of when the are indeterminates. Here that fact is transferred to random field values: membership would force a nonzero polynomial in the of bounded degree to vanish, and the polynomial zero bound limits this probability to . Since ranges over finitely many sets depending only on , the union bound finishes the failure estimate for alignment, which is the last ingredient of the lemma on generic subspaces.
Classified routine:
Direct specialization of the previous claim via the Schwartz–Zippel (DeMillo–Lipton–Schwartz–Zippel) polynomial zero bound applied to a nonzero minor, followed by a union bound over finitely many evaluation sets.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.2 Generic spaces of characters
- Page
- —
- Label
—- Line
sections/02-latent.tex:337
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Specialization via polynomial zero bound" rests on claim-lem-latent-generic-1
- infoinferred_depoutline: "Specialization via polynomial zero bound" rests on claim-lem-latent-generic-3