Zong's problem on 2d half-spaces containing the unit ball
summary
The gist
The paper proves that the intersection of two halfspaces containing the Euclidean unit ball in R d contains a point of norm at least √d, with equality characterizing the cube <ref:2609.38394#pg2>.
In short
The paper proves that any intersection of 2d closed halfspaces containing a Euclidean unit ball in R d must contain a point with a norm of at least sqrt(d). It also characterizes when this minimum norm is achieved, showing it occurs if the intersection is an orthogonal image of the hypercube [-1, 1]d. This resolves a problem posed by C. Zong.
Key concepts
- Gaussian vertex measure
- This assigns a specific weight ($ u_ au(v)$) to each vertex ($v$) of the intersection polytope $P$. It is used to calculate the average squared norm of the vertices, which is a key quantity in bounding the minimum norm achieved within $P$.
- Second moment operator ($A_ au(P)$)
- This operator acts on a set $P$ and involves summing up weighted terms related to its vertices. Its trace, $ ext{trace } A_ au(P)$, represents the average squared norm of the vertices, providing a lower bound for the minimum norm point in $P$.
- Gaussian inequality
- This is a fundamental inequality used in the proof. It relates a symmetric positive definite matrix $G$ (with diagonal entries equal to 1) to its trace, which helps establish bounds on geometric quantities related to the set $P$.
- Orthogonal image of $[-1, 1]^d$
- This condition describes a specific geometric structure for the intersection polytope $P$. If the maximum norm point in $P$ has norm exactly $\sqrt{d}$, then $P$ must be an orthogonal transformation of the standard hypercube $[-1, 1]^d$. This provides a precise characterization of the extremal case.
Terminology used across episodes
This episode discusses
- Zong's problem on 2d half-spaces containing the unit ball · Paper Radio
- The maximal volume of projections of the cross-polytope
The paper
Zong's problem on 2d half-spaces containing the unit ball · Read on arXiv
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Zong's problem on 2d half-spaces containing the unit ball".
Emmy: Here's the gist of the paper. The paper proves that the intersection of two halfspaces containing the Euclidean unit ball in R d contains a point of norm at least √d, with equality characterizing the cube <ref:2609.38394#pg2>.
Ada: Theorem 1.1 states that if H1,..., H2d be closed halfspaces containing Bd, then P = ⋂︀ i∈
2d: Hi contains a point x with x ≥ √d <ref:2609.38394#pg2> Moreover, if maxx∈P x = √d, then P is an orthogonal image of
−1, 1: d <ref:2609.38394#pg2>.
Emmy: This result resolves a problem proposed by C.
Ada: Zong in 1993 <ref:2609.38394#pg2>.
Title and authors: Ada: We're talking about the title and authors now for "Zong's problem on 2d half-spaces containing the unit ball <ref:2609.38394#pg1,half-spaces containing the unit ball>." It’s by Grigory Ivanov, and this is a problem that C Zong proposed back in nineteen ninety-three.
Emmy: The structure of the paper starts by setting up m half-spaces, where m is the number of constraints. The authors are looking at the case where you have 2d such half-spaces, and they're trying to find a lower bound on a quantity related to those constraints <ref:2609.38394#pg1>.
Kolya: What's the actual goal of this paper? Is it just proving that there is a point outside the unit ball? Or is it about finding a specific type of point inside?
Ada: The main result, Theorem one point one, says that if you take 2d closed half-spaces that contain the unit ball in R d, their intersection has a point with a norm of at least sqrt d <ref:2609.38394#pg1>. That's the core claim we need to focus on.
Emmy: And they add a characterization part. If that maximum norm you find is exactly sqrt d, then you know for sure that those half-spaces are in fact an orthogonal image of the unit hypercube, which is a very rigid geometric constraint.
The paper's summary: Ada: So, to summarize this whole problem, the paper tackles finding a point x inside an intersection P formed by many half-spaces that all contain the unit ball. They establish that this intersection P must have a point with norm at least sqrt d.
Emmy: The proof relies on looking at something called the Gaussian vertex measure of the polytope. They define this measure, which assigns a weight to each vertex based on its normal cone, and they look at its second moment operator.
Kolya: And they use this second moment operator to give us a lower bound for the average squared norm of these vertices. Specifically, Theorem one point two gives us that this trace is greater than or equal to d plus some term involving pi/four and the number of distinct facet normals minus m <ref:2609.38394#pg1>.
Ada: The way they get that bound is through a Gaussian inequality, which they state in Theorem two point one, and this inequality involves comparing mass on a line segment with the centroid of its restriction to that line <ref:2609.38394#pg1>.
The paper's improvements: Emmy: The authors suggest some ways to improve how we look at the problem, specifically by considering a quadratic extension. This leads into some open questions about tight frames and vertex indices in higher dimensions.
Ada: They also propose a conjecture, Conjecture five point one, which asks about the sum of norms of vectors b one through b 2d that contain the unit ball within their convex hull. It’s an interesting way to think about how these constraints relate to spanning sets.
Kolya: From a probabilistic view, what does this quadratic extension suggest about the tail behavior of the distribution we're looking at? Does it help us understand when these bounds are tight or when they become loose?
Emmy: They also give an independent spectral estimate in Section six showing that for a specific case where you have m constraints equal to 2d, you get a point with a norm of at least something like six point six times the square root of two times the natural logarithm of two times the square root of d.
Conclusion: Ada: So, to wrap up, this paper, "Zong's problem on 2d half-spaces containing the unit ball," confirms that you can always find a point in such an intersection with a norm at least sqrt d <ref:2609.38394#pg1,half-spaces containing the unit ball>. They also give us a very specific geometric condition for when that point achieves that exact sqrt d norm.
Emmy: The main implication is the connection they draw between these geometric constraints and the structure of orthogonal images of hypercubes. It links the geometry of half-spaces directly to combinatorial properties of their boundaries.
Kolya: From a probabilistic standpoint, it’s useful because it shows that even with many constraints, you still get a certain amount of "stuff" in the intersection, and that bound is tied to the dimension d. The fact that they used Gaussian measures is important for understanding the underlying probability distribution.
Ada: Indeed. This work settles a problem proposed by C Zong from nineteen ninety-three regarding these half-spaces, giving us a solid result about minimum norm bounds in this high dimensional setting.
Emmy: It’s interesting to see how they use Gaussian measures to establish these sharp combinatorial bounds, and it sets up some future questions about vertex indices in more complex settings.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors