Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 L:Rd→[0,M] be Borel measurable, symmetric and quasi-convex, with M>0. For integers N≥2 and m≥1, put δ=M/N, Ck={x:L(x)≤kδ}‾ and gN,m(x)=δ∑k=1N−1min⁡(1,m d(x,Ck)). For Ck=∅ the corresponding summand is defined to be one, and for Ck=Rd it is zero. Then 0≤gN,m≤L, and gN,m is bounded and Lipschitz. For every nondegenerate Gaussian H∼Nd(b,S), inf⁡aEgN,m(a−H)=EgN,m(H−b),lim⁡N→∞lim⁡m→∞EgN,m(H−b)=EL(H−b). 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.

[F2]

The boundary of a convex set is Lebesgue null: the boundary of a convex set is Lebesgue-null, including lower-dimensional convex sets.

[F3]

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.

[F4]

Multivariate normal law, including singular covariance: A nondegenerate Gaussian can be realized as b+AG, where A=S1/2 is invertible and G has independent standard-normal coordinates.

[F5]

Dominated convergence passes limits of functions bounded by M through the Gaussian expectation.

[F6]

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: d(x,C)=inf⁡c∈C∥x−c∥2, and for every ϵ>0 a point of nonempty C can be chosen within ϵ of this infimum.

[F7]

The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: The Euclidean norm satisfies ∥u+v∥2≤∥u∥2+∥v∥2.

[F8]

The Lebesgue integral is linear on L1(μ): The expectation of a finite sum of bounded measurable functions is the sum of their expectations.

[F9]

Borel measurable and Lebesgue measurable functions on Rn: Borel functions on Rd are measurable for the Gaussian and Lebesgue integrals.

[F10]

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.

[F11]

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: A point in the closure of a subset of Euclidean space is the limit of a sequence from that subset.

[A1]

The Axiom of Choice is retained for the Gaussian and centering suppliers.

[F12]

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 ϕ(t)=(2π)−1/2e−t2/2; independent coordinates have product law, repeated integration is valid, and product Lebesgue measure agrees with Euclidean Lebesgue measure on Borel sets.

Proof

1.1A1F1F6F7F9F10F11givenchooseconstructalgebra

Each sublevel Ak={L≤kδ} is convex and symmetric by hypothesis. Its closure Ck is closed; it is convex by [F10] when Ak is nonempty, and is convex by vacuity when Ak=∅. If x∈Ck, [F11] supplies xj∈Ak with xj→x; then −xj∈Ak and −x∈Ck, so Ck is symmetric (the empty case is symmetric as well). For a nonempty closed convex C, choose cx,cy∈C within ϵ of d(x,C),d(y,C) using [F6]. Their convex combination lies in C, and [F7] gives d((1−t)x+ty,C)≤(1−t)d(x,C)+td(y,C)+ϵ. Let ϵ↓0 to prove convexity of the distance function. When C=−C, replacing each c by −c in the infimum shows d(−x,C)=d(x,C). Thus for a nonempty proper Ck, q(x)=min⁡(1,md(x,Ck)) is symmetric; its sublevel at 0≤t<1 is {d(x,Ck)≤t/m}, which is convex, and its sublevel for t≥1 is the whole space. It is Borel and m-Lipschitz by [F1] and [F9]. For empty Ck or Ck=Rd, the stated constant conventions have the same properties.

2.1F3F8A1step 1.1algebra

If L(x)≤kδ, then x∈Ck and the kth term is zero. Every remaining term is at most one, so 0≤gN,m(x)≤δ#{1≤k<N:kδ<L(x)}≤L(x). The finite sum is bounded by M and has Lipschitz constant at most Mm. Apply F3 separately to each summand. Every summand's expected loss is minimized at a=b (use its symmetry to replace b−H by H−b), so the same action minimizes their sum by [F8]. This proves the first displayed identity without assuming the sum quasi-convex.

3.1A1F2F4F5F9F10F12F13step 2.1algebra∎

Since Ck is closed, its kth term increases to 1Ckc as m→∞. If Ck=Rd, then [F10] gives int⁡{L≤kδ}=Rd, so the level set is all of Rd and both indicators vanish. If Ck=∅, the level set is empty and both indicators equal one. Otherwise the difference between {L>kδ} and Ckc is contained in the boundary of the convex set {L≤kδ}, which is null by [F2]. To justify the Gaussian nullity, [F4] realizes H−b=AG. By [F12], repeated integration of the scalar densities gives P(G∈E)=∫E∏j=1dϕ(zj) dλd(z) for every Borel E (for d=1 this is the scalar definition). The closed boundary D is Borel and null, and A−1D is null by [F13], so P(H−b∈D)=P(G∈A−1D)=0. Therefore F5 gives lim⁡mEgN,m(H−b)=E[δ∑k=1N−11{L(H−b)>kδ}]. The expression inside the expectation differs from L(H−b) by at most δ: count the grid thresholds strictly below each value in [0,M]. Let N→∞ to obtain the second identity.

Depends on

Used by

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