claimroutine
Construction is effective for rational p_*
The whole latent construction is effective for rational
algorithmic part of the lemma
Statement (paper)
When is rational, all the choices in the construction (the threshold , the integers and , the rational , the field together with a generic rank- space, and the remaining products, isomorphisms, injections, quotients, function tables and rational noise laws) can be made effectively, by finite enumeration and binary linear algebra, so that the construction is a terminating deterministic algorithm.
In plain English
When is rational, every choice in the latent-space construction (the threshold , the integers and , the rational , the field with a generic rank- space, and the products, isomorphisms, injections, quotients, function tables and rational noise laws) can be made effectively. The construction is therefore a terminating deterministic algorithm.
Why it's here
This claim gives the algorithmic part of the lemma. Every parameter is an explicit finite choice, and the one existential step, picking a generic subspace, can be done by finite search because random subspaces are generic with probability tending to one (the generic-subspace lemma). Everything else is finite enumeration and binary linear algebra.
Classified routine:
Effectivity bookkeeping: every parameter is a finite explicit choice, and the one existential step, choosing a generic subspace, is done by finite search. That search terminates because of the earlier generic-subspace lemma (random subspaces are generic with probability tending to one); the rest is standard finite enumeration and binary linear algebra.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.5 Quotients and enlargement
- Page
- —
- Label
—- Line
sections/02-latent.tex:747
Leannot aligned
Phase 2 aligns this node to a Lean declaration.