Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (pp. 10--11). For a convex body KK in Rd\mathbb R^d, L+(K)\mathcal L^+(K) is the set of nonnegative functions on KK that are Lebesgue integrable over KK. For u∈Sd−1u\in S^{d-1} and s≥0s\ge0, H(s,u)={x:⟨x,u⟩=s}H(s,u)=\{x:\langle x,u\rangle=s\}, and for a hyperplane H(s,u)H(s,u) meeting int⁡(K)\operatorname{int}(K) the sectional integral F(f,s,u)F(f,s,u) is the integral of ff over H(s,u)∩int⁡(K)H(s,u)\cap\operatorname{int}(K) with respect to (d−1)(d-1)-dimensional Lebesgue measure on H(s,u)H(s,u). For Δ>0\Delta>0, LΔ+(K)\mathcal L_\Delta^+(K) is the set of f∈L+(K)f\in\mathcal L^+(K) with F(f,s,u)≥ΔF(f,s,u)\ge\Delta for every H(s,u)H(s,u) meeting int⁡(K)\operatorname{int}(K), and m(LΔ+(K))m(\mathcal L_\Delta^+(K)) is the infimum of ∫Kf(x) dx\int_Kf(x)\,dx over f∈LΔ+(K)f\in\mathcal L_\Delta^+(K). The circumradius RKR_K is the radius of the smallest Euclidean ball containing KK.

Lemma 6.3 (p. 11). If KK is a convex body with circumradius RKR_K in Rd\mathbb R^d, then m(LΔ+(K))≥2ΔRKm(\mathcal L_\Delta^+(K))\ge2\Delta R_K.

Proof pointer

Pp. 11--12. Translate so that the ff-weighted centroid of KK is the origin and take uu with hK(u)=R≥RKh_K(u)=R\ge R_K, where RR is the least radius of a ball about the origin containing KK and hKh_K is the support function. The vanishing first moment in the direction uu, with F≥ΔF\ge\Delta, makes the moments ∫tF(f,t,u) dt\int tF(f,t,u)\,dt over [0,hK(u)][0,h_K(u)] and over [0,hK(−u)][0,h_K(-u)] each at least 12ΔRK2\frac12\Delta R_K^2. A one-dimensional extremal bound, (12), then gives each half of ∫Kf\int_Kf at least ΔRK\Delta R_K.

Read depth

Claims checked: the definitions and Lemma 6.3 were read clause by clause on the print, and the proof on pp. 11--12 was followed; the infimum (12), which the paper says one can check, was not rederived.

Dependencies

None.

Source. K. Bezdek and A. E. Litvak, Packing convex bodies by cylinders, Discrete Comput. Geom. 55 (2016), no. 3, 725--738, doi:10.1007/s00454-016-9760-z; labels and pages are those of arXiv:1507.05115v2 (21 November 2015), as the source card records.

Bears on

  • Problem 1121: the lemma is the step of Theorem 6.1 that turns the paper's upper bound on m(L1+(K))m(\mathcal L_1^+(K)) into the circumradius inequality 2RK≤diam⁡NS(K)2R_K\le\operatorname{diam}_{NS}(K).