Normalizing the final introspection error #
The paper's final soundness estimate absorbs any fixed concave power and
constant multiple into a * (x^a * ε^b + x^(-b)). The coefficient and the new
exponent are explicit here, including the normalization a ≥ 1, 0 < b ≤ 1.
No induction estimate is assumed or encoded by the definitions in this file.
theorem
MIPRE.Introspection.errorProfile_nonneg
{a b x ε : ℝ}
(ha : 0 ≤ a)
(hx : 0 ≤ x)
(hε : 0 ≤ ε)
:
The exponent after k square roots.
Equations
- MIPRE.Introspection.rootExponent k = (1 / 2) ^ k
Instances For
Applying the square root a fixed finite number of times.
Equations
Instances For
theorem
MIPRE.Introspection.errorProfile_iteratedRoot
{C a b x ε : ℝ}
(k : ℕ)
(hC : 0 ≤ C)
(ha : 0 ≤ a)
(hx : 1 ≤ x)
(hε : 0 ≤ ε)
:
C * iteratedRoot k (errorProfile a b x ε) ≤ errorProfile (powerCoefficient C a (rootExponent k)) (b * rootExponent k) x ε
Every fixed stack of square roots is absorbed with explicit exponent b / 2^k.
theorem
MIPRE.Introspection.errorProfile_scaled_power
{C a b c r x ε : ℝ}
(hC : 0 ≤ C)
(ha : 0 ≤ a)
(hc : 0 ≤ c)
(hr0 : 0 ≤ r)
(hr1 : r ≤ 1)
(hx : 1 ≤ x)
(hε : 0 ≤ ε)
:
C * errorProfile a b x (c * ε) ^ r ≤ errorProfile (powerCoefficient (C * max 1 (c ^ b) ^ r) a r) (b * r) x ε
Constant rescaling of the input error followed by a concave power is absorbed too.