PR #6453: the strictification tail and the compiler grid
ProvedPr6453.strictificationThe strictification of the PR #6453 certificate and its compiler grid, at the printed constants.
The recursion is charged in blocks of levels after a split at and a rounding by . The checks are: the block estimate applies, , so the decay of one block of levels beats ; the rounding is sound, ; the shifted exits and the complementary capacity fit, ; the compensated capacity exceeds ; the compiler's initial range is respected, at the tested saving ; the absorbed tail finishes, ; the coarse block bound on the other hand cannot fund the claim, , which is the certificate's own negative control; and the integer test exponent fits the compiler grid .
Two of these are the ones that carry the strictification. The absorbed tail is tight: the exact decay is about , against an absorbed reserve of , so the margin is a factor — while the coarse bound overshoots by eight orders of magnitude, which is exactly why the certificate keeps the exact tail and records the coarse one as a rejected alternative. The other is the capacity: , proved by raising the integer inequality to the -th power.
import Definitions.Def_Pr6453_RankMoments import Definitions.Def_Pr6453_Strictification set_option autoImplicit false
namespace Pr6453
theorem strictification :
(decay : ℝ) ^ 128 < 1 / 16 ∧
(cutoff : ℕ) ^ 64 < floor' ^ 63 ∧
2 * ((cutoff : ℕ) ^ power) ^ 64 ≤ (145 ^ power) ^ 63 ∧
(theta : ℝ) ^ logarithmPower < (etaLower : ℝ) ∧
(145 : ℝ) ^ ((power : ℝ) * (tested : ℝ)) < 2 ^ logarithmPower ∧
1 / (1 + (power : ℝ) * (reserve : ℝ)) + 4 * (decay : ℝ) ^ power < 1 ∧
1 < 1 / (1 + (power : ℝ) * (reserve : ℝ)) + 4 * ((1 : ℝ) / 16) ^ (power / 128) ∧
H = 138100200000000 ∧ integerTestExponent < H := by
sorry
end Pr6453