claimroutineinferred_dep
Diagonal grid choice avoids all tests
Claim·§8.2 A complete grid with generic positions·inside lemGeneric complete grid with independent coordinates
Statement (paper)
One can choose the grids, index by index, so that for every fixed nonzero polynomial test over in the selected coordinates, the test does not vanish at the limiting grid. Equivalently, for each fixed , the first tests are feasible on a large set of indices, so the chosen prefix length satisfies on a large set, and each is nonzero in the limiting grid.
In plain English
Grids can be chosen index by index so that no fixed nonzero polynomial test over in the selected coordinates vanishes at the limiting grid. For each fixed , the first tests are feasible on a large set of indices, so the chosen prefix length satisfies there and each is nonzero on the limiting grid.
Why it's here
The grid count from the Jensen bound is , while each of the first tests kills at most tuples, a power-saving fraction. So for large a complete grid avoiding all of exists, and a diagonal choice over handles the whole countable family. This yields the algebraic independence used by the following claims.
Classified routine:
A standard diagonal argument over a countable family of polynomial tests, combining the Jensen grid count (claim-alg-generic-grid-2) with the power-saving vanishing bound (claim-alg-generic-grid-3). Each fixed test removes only a negligible fraction of the complete grids, so the counting goes through.
Uses
Used by
Sources
PaperOpen
- Section
- §8.2 A complete grid with generic positions
- Page
- —
- Label
—- Line
sections/07-algebra.tex:265
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Diagonal grid choice avoids all countable tests" rests on claim-alg-generic-grid-2
- infoinferred_depoutline: "Diagonal grid choice avoids all countable tests" rests on claim-alg-generic-grid-3