Part of the fixed-cut archive (Chapter The fixed cut: approach and lessons); this chapter holds the problems the fixed cut leaves, together with the obstructions that shaped them. None is needed for KLS, now proved; each is stated for the difficulty it isolates. The operator-to-trace upgrade below has a counterpart among the alternative mechanisms — the linear test of the moment map asks for an operator bound where only a trace bound is known (Section The linear test: the necessary linear-sector condition) — and the counterexamples of this chapter, Proposition 29.1 first, constrain any argument that follows a set through localization. We state the problems in decreasing order of strength.
By Corollary 30.1, this prefix form on the tight window is exactly what the argument uses; the stronger every-interval estimate Assumption 28.1 is not required. The projection-test ceiling of Chapter The static quadratic-chaos input and the two-tail obstruction (Remark 25.4) bears on the obvious proof method, although Letwin’s moment-map argument bypasses it for the intrinsic static quadratic chaos. A proof of the dynamic upgrade must therefore use cut-specific structure and covariance occupation. Its restriction to products is examined in Remark 27.3; a family of product cuts violating the prefix form for every choice of constants would refute it.
The propagation clause of the weighted package is the following rate. It is refuted by the product cylinders of Proposition 29.1 above, and stated here so that the refutation has a precise target.
Against this rate, Proposition 29.1 gives, for every proposed choice of constants, a product-cylinder witness with arbitrarily small additive and relative initial excess. Among pure powers of λmax(At) multiplying absolute excess in this slice-wise package, 5/2 is the weakest exponent statically consistent with the two-tail mode (Proposition 25.2); the time exponent was a deliberately stronger demand, not fixed by that static example. The near-worst bootstrap of Theorem 33.1 supplies a different, externally anchored unweighted bound. It is not a uniform superlinear-remainder statement of the form above. Proposition 29.2 proves that the superlinear remainder already fails after the global covariance weight is removed. Thus changing only the weight cannot repair the uniform package: the replacement must also change the remainder or impose an explicit near-worst-measure hypothesis.
A possible replacement, screened by the source, charges the weighted excess only on the aligned set Aκ,t={Qt≥κetWcut}, where Qt=Sμt(E)/st=st∥Kt∥HS2 and Wcut=(1+λcut(At,Kt))5/2 with the cut-oriented scale of Lemma 30.3. Its first positive result, Proposition 29.3 below, concerns the regular split class; general split laws are covered only through their regular approximants, because the interchange of the screened indicator with the approximation limit is not carried out.
Taken alone, this clause neither repairs that package nor implies KLS: it needs a companion propagation statement that survives the spectator products. The intrinsic quadratic-chaos input is Theorem 25.1. The mechanism of Chapter The fixed cut: Reilly, Jacobi and splitting formulas needs in addition a localization-uniform quantitative almost-stability trace theorem for the fixed cut, modulo tangential Jacobi zero modes and with all Reilly boundary terms controlled (Conjecture 34.1). Proposition 25.2 rules out a slice-wise shortcut. No implication between this statement, Conjecture 29.1, and Conjecture 31.1 is asserted.
The bound of Corollary 29.1 is conditional on the geometric completion. Before KLS was proved, it improved on Theorem 4.6: it would replace Ψn≲(logn)1/4 by Ψn≲1+loglogn in sufficiently large dimensions, and so CP,n≲logn by CP,n≲(1+loglogn)2, still growing with dimension. KLS, now proved (Chapter The proofs of KLS compared), gives Ψn=O(1) and supersedes both. The corollary is kept for its mechanism: the completion supplies the geometric step converting a small accumulated excess into a perimeter lower bound, and the only covariance input is the published window of Corollary 26.2, not the longer c/logn window.
A dimension-free conclusion needs a further estimate at the completion’s same time T0. More precisely, let CB be the constant in (33.7). If some universal εt>0 ensures
for every n≥2 and every isotropic log-concave μ with hμ≤(1+εt)hn⋆, then the clean bootstrap supplies the completion’s hypothesis. The balanced near-minimizer argument above gives hμ≥2cg for arbitrarily accurate near-worst measures; taking their near-worst error to zero gives hn⋆≥2cg. Monotonicity in Lemma 33.2 covers dimension one, yielding the Cheeger formulation of Conjecture 0.1. In Conjecture 29.4, however, the time is chosen after the requested error level. Its existential quantifier does not identify that time with the completion time. The extra estimate displayed here is thus a sufficient condition beyond the implication in Corollary 29.1.
In the localization–Lichnerowicz argument, Remark 2.2 attributes the logn cost to the fact that the soft maximum (2.11) approximates λmax over n directions. A potential depending only on the directions actually relevant to a near-extremizer — or on an effective rank rather than the ambient dimension — could convert κn=O(1) into CP=O(1), if the entropy cost of the soft maximum were the only loss. The quantity ΞT(μ) of (28.8), evaluated in Chapter The fixed cut: the bootstrap, is the fixed cut’s version of this question, and Conjecture 29.4 is the corresponding statement. Chapter The fixed cut: the bootstrap explains why the crude evaluation cannot suffice (Remark 33.2, Remark 33.5) and shows that a relative bound at a sufficiently small universal time would itself give KLS (Proposition 33.1).
Bobkov, S. G., & Chistyakov, G. P. (2015). On Concentration Functions of Random Variables. Journal of Theoretical Probability, 28(3), 976–988. 10.1007/s10959-013-0504-1