Coarse-graining support: Support.Book.Ch05.Theorems.Section57.BadScaleTailTwoBranch #
Imported from the Apache-2.0 CoarseGraining development at commit
c7ddd76c08ade64fed1b8d2ca51be14dfee8deb4.
Two-branch bad-scale tails #
This file starts the theorem-facing bad-scale tail assembly. The first step is still fixed-pair: in the mixed bottom range, use the localized and crude mechanisms separately for the same selected scale and then keep the better of the two tails by taking the maximum of their stretched-exponential exponents.
Deterministic comparison turning an exponent-level maximum into a tail-parameter maximum, with explicit denominator domination.
Convert a max-exponent soft fixed-pair estimate into the weighted row shape used by the bad-scale summation lemmas.
Exact fixed-pair mixed-bottom estimate with the better of the localized and crude mechanisms retained as a maximum of exponents.
Concrete mixed-bottom fixed-pair estimate in the weighted row shape, with
the corrected finite bad-scale exponent. The only remaining denominator
conditions are explicit algebraic domination conditions for the chosen
normalizing denominator Den.
Summed high-bottom component estimate with the corrected finite
interpolated exponent, conditional only on the explicit denominator choice and
the deterministic lower cutoff 1 <= A.