How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Bounded bowl-shaped losses have Gaussian-centered Lipschitz minorants
Statement
Assume AC. Let be Borel measurable, symmetric and quasi-convex, with . For integers and , put , and For the corresponding summand is defined to be one, and for it is zero. Then , and is bounded and Lipschitz. For every nondegenerate Gaussian , Each summand is symmetric and quasi-convex; no quasi-convexity of their sum is asserted.
Facts & Assumptions
Given: AC, the bounded bowl-shaped loss, integers and Gaussian law.
, so the distance to a fixed nonempty set is -Lipschitz: distance to a nonempty set is one-Lipschitz.
The boundary of a convex set is Lebesgue null: the boundary of a convex set is Lebesgue-null, including lower-dimensional convex sets.
A centered Gaussian minimizes bounded symmetric quasi-convex loss: a bounded Borel symmetric quasi-convex loss has least Gaussian shift risk at the Gaussian center.
Multivariate normal law, including singular covariance: A nondegenerate Gaussian can be realized as , where is invertible and has independent standard-normal coordinates.
Dominated convergence passes limits of functions bounded by through the Gaussian expectation.
Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum), and Every nonempty set bounded below has an infimum: , and for every a point of nonempty can be chosen within of this infimum.
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: The Euclidean norm satisfies .
The Lebesgue integral is linear on : The expectation of a finite sum of bounded measurable functions is the sum of their expectations.
Borel measurable and Lebesgue measurable functions on : Borel functions on are measurable for the Gaussian and Lebesgue integrals.
A convex set and its closure have the same interior and boundary: Under AC and countable choice, a nonempty convex subset and its closure have the same interior and boundary, and the closure is convex. AC supplies countable choice here.
A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed: A point in the closure of a subset of Euclidean space is the limit of a sequence from that subset.
The Axiom of Choice is retained for the Gaussian and centering suppliers.
Standard normal and normal laws, Independent random elements have product joint law, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, and On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}: The scalar standard normal has density ; independent coordinates have product law, repeated integration is valid, and product Lebesgue measure agrees with Euclidean Lebesgue measure on Borel sets.
A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not: Under countable choice, an invertible linear map sends Lebesgue-null sets to null sets. AC supplies countable choice in [F12] and [F13].
Proof
Each sublevel is convex and symmetric by hypothesis. Its closure is closed; it is convex by [F10] when is nonempty, and is convex by vacuity when . If , [F11] supplies with ; then and , so is symmetric (the empty case is symmetric as well). For a nonempty closed convex , choose within of using [F6]. Their convex combination lies in , and [F7] gives . Let to prove convexity of the distance function. When , replacing each by in the infimum shows . Thus for a nonempty proper , is symmetric; its sublevel at is , which is convex, and its sublevel for is the whole space. It is Borel and -Lipschitz by [F1] and [F9]. For empty or , the stated constant conventions have the same properties.
If , then and the th term is zero. Every remaining term is at most one, so . The finite sum is bounded by and has Lipschitz constant at most . Apply F3 separately to each summand. Every summand's expected loss is minimized at (use its symmetry to replace by ), so the same action minimizes their sum by [F8]. This proves the first displayed identity without assuming the sum quasi-convex.
Since is closed, its th term increases to as . If , then [F10] gives , so the level set is all of and both indicators vanish. If , the level set is empty and both indicators equal one. Otherwise the difference between and is contained in the boundary of the convex set , which is null by [F2]. To justify the Gaussian nullity, [F4] realizes . By [F12], repeated integration of the scalar densities gives for every Borel (for this is the scalar definition). The closed boundary is Borel and null, and is null by [F13], so . Therefore F5 gives . The expression inside the expectation differs from by at most : count the grid thresholds strictly below each value in . Let to obtain the second identity.
Depends on
- $|d(x,A) - d(y,A)| \le d(x,y)$, so the distance to a fixed nonempty set is $1$-Lipschitz
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- Greatest lower bound (infimum)
- Every nonempty set bounded below has an infimum
- The inner-product norm is definite, homogeneous, and satisfies the triangle inequality
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- The Lebesgue integral is linear on $L^1(\mu)$
- A convex set and its closure have the same interior and boundary
- A point lies in the closure of $A$ iff some sequence in $A$ converges to it, and a set is closed iff it is sequentially closed
- Borel measurable and Lebesgue measurable functions on $\mathbb{R}^n$
- The boundary of a convex set is Lebesgue null
- A centered Gaussian minimizes bounded symmetric quasi-convex loss
- Multivariate normal law, including singular covariance
- Standard normal and normal laws
- Independent random elements have product joint law
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- Dominated convergence
- The Axiom of Choice
Used by
- Local asymptotic minimax bound Theorem
Dependency tree · two levels
142 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- A. W. van der Vaart, Semiparametric Statistics, Theorem 4.14 and complete proof, pp. 46–48 (standard reference, not scraped)
- John Duchi, A few notes on contiguity, asymptotics, and local asymptotic normality, Theorem 3 and proof, pp. 17–18; local finite-prior proof supplied here (standard reference, not scraped)