Explicit punctured transitivity #
This file isolates the finite maximal-orbit argument used by the explicit punctured-transitivity proof. The only geometric input is a stated large-order-to-base-component hypothesis; the middle-game step is the proved Corvaja--Zannier escape theorem.
The finite maximal-orbit argument at a fixed prime. The hypotheses expose exactly the three frontiers consumed by the argument: the divisor-sensitive count forces the cubic middle-game bound, the upper range supplies the linear bound, and large order connects to one base component.
Explicit punctured transitivity. The closed cutoff supplies all numerical estimates; the large-order route and cage connectivity are the pointwise explicit endgame theorems.
Raw-expression form of the explicit endpoint. This displays the actual closed natural-number bound without requiring clients to unfold either sealed constant.
Elementary preliminary-route punctured transitivity. This is the paper's all-divisors Corvaja--Zannier route with the analytic Nicolas estimate replaced by the fully formalized elementary tenth-moment divisor bound.