Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Brunn–Minkowski inequality for compact convex sets

Statement

Assume countable choice. Let d≥1 and let A,B⊆Rd be nonempty compact convex sets. With A+B={a+b:a∈A,b∈B} and λd denoting Lebesgue measure, λd(A+B)1/d≥λd(A)1/d+λd(B)1/d. Zero-volume and lower-dimensional sets are included.

Facts & Assumptions

Given: Countable choice, an integer d≥1, and nonempty compact convex sets A,B⊆Rd.

[A1]

The Axiom of Countable Choice (ACω): Countable choice is sufficient for the Lebesgue-measure change-of-variables and Tonelli suppliers used here; full AC is not assumed.

[F1]

Lebesgue measurable sets, the family L(Rn), and the restricted set function λn: Lebesgue volume of a measurable set is its measure λd.

[F2]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: For a nonnegative measurable function, integration over Rd equals iterated integration over its one-dimensional slices.

[F3]

The weighted arithmetic-geometric mean inequality for real weights: For positive x,y and 0≤λ≤1, (1−λ)+λx≥xλ.

[F4]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: For a C1 diffeomorphism of open sets, the nonnegative Lebesgue integral transforms with the absolute Jacobian.

[F7]

The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive and Derivative of an inverse: if f is continuous and injective on a nondegenerate interval I and differentiable at c∈I with f′(c)≠0, then the inverse g is differentiable at f(c) with g′(f(c))=1/f′(c); and if f′(c)=0 then g is not differentiable at f(c): On each compact interval inside a projection interval, the fundamental theorem gives the derivative of the cumulative integral as its continuous integrand. The inverse theorem then gives (FB−1)′(u)=1/g(FB−1(u)); this derivative is continuous because g is continuous and positive and FB−1 is continuous.

[F8]

Monotone convergence for the integral: Increasing nonnegative integrals converge to the integral of their pointwise limit.

[F9]

Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure: Every bounded measurable subset of Rd has finite Lebesgue measure.

[F10]

The boundary of a convex set is Lebesgue null: A convex set with empty interior has zero d-dimensional Lebesgue measure.

[F11]

Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: Compact subsets of finite-dimensional Euclidean space are closed and bounded, and closed bounded subsets are compact. In particular, A×B is closed and bounded in R2d, hence compact; continuous images of compact sets are compact, so A+B, positive dilations of A and B, and every weighted convex sum used below are compact and convex (an open cover of the image pulls back to one of the compact domain, which has a finite subcover). When d≥2, for a compact C⊆R×Rd−1, each coordinate projection is compact (and is an interval when C is convex) and each slice Cz={y:(z,y)∈C} is closed and bounded, hence compact. Thus these bodies and slices are Borel and have well-defined finite Lebesgue volumes; applying [F2] to 1C makes z↦λd−1(Cz) measurable and gives its integral as λd(C).

Proof

Proof technique: induction on dimension using convex slices and a one-dimensional monotone transport.

1.1F1F6F9F11givenalgebra

If one of A,B has zero volume, say λd(A)=0, choose a∈A. By [F11], A+B is compact and measurable. Then a+B⊆A+B, so [F6] gives λd(A+B)≥λd(B); the stated inequality follows after taking dth roots. If both volumes vanish the right side is zero. Thus assume both volumes are positive.

2.1A1F1F5F9F11step 1.1givenalgebra

Put a=λd(A)1/d, b=λd(B)1/d, A′=a−1A, B′=b−1B, and λ=b/(a+b). By [F5], λd(A′)=λd(B′)=1; [F11] makes these dilates and their convex combinations compact. It suffices to show that every convex combination (1−λ)A′+λB′ has volume at least one, because A+B=(a+b)((1−λ)A′+λB′). The cases λ=0,1 are immediate, so take 0<λ<1 and rename A′,B′ as A,B.

3.1A1F1F2F9F10F11step 2.1givenbaseihinduction

We prove the normalized claim by induction on d. In dimension one, A and B are intervals of length one, so their convex combination is an interval of length (1−λ)+λ=1. Now let d≥2 and assume the normalized claim in dimension d−1. The normalization calculation in step 2.1 is dimension-independent, so this induction hypothesis also gives the full weighted inequality in dimension d−1 for positive-volume compact convex sets. By [F10], positive volume implies each body has nonempty interior and contains an interior ball. By [F11], their coordinate projections are compact intervals and their slices are compact and measurable; [F2] makes the slice-volume functions measurable. Project each convex body onto the first coordinate; its projection is a nondegenerate compact interval. For an interior coordinate x, let Ax⊆Rd−1 be its slice and f(x)=λd−1(Ax). Define By and g(y) likewise. These slice volumes are positive and finite in the open projection intervals. Write the projections as [a−,a+] and [b−,b+]. An interior ball in A has center with first coordinate x0. If a−<x<x0, choose p∈A with first coordinate p1<x and combine p with the ball centered at x0; the convex combination with weight λ=(x−p1)/(x0−p1)∈(0,1) on the ball lies in the slice at x and contains a (d−1)-ball of radius λρ>0. If x0<x<a+, choose p1>x and use weight (p1−x)/(p1−x0) on the interior ball. At x=x0, the original ball supplies a positive-radius slice. The same argument applies to B.

4.1F2F11step 3.1step 2.1inductionalgebra

Convexity gives A(1−t)x0+tx1⊇(1−t)Ax0+tAx1 for interior x0,x1. The compact slices in [F11] let the induction hypothesis apply to these sums. It therefore makes f1/(d−1) concave on the open projection interval; likewise g1/(d−1). To see continuity of ψ=f1/(d−1), fix an interior point x0 and a<x0<b in the interval. For x↓x0, concavity gives the chord lower bound ψ(x)≥b−xb−x0ψ(x0)+x−x0b−x0ψ(b). Writing x0=ηa+(1−η)x with η=(x−x0)/(x−a) gives the upper bound ψ(x)≤ψ(x0)−ηψ(a)1−η. Both bounds tend to ψ(x0); exchanging left and right proves continuity from the other side. Thus f,g are continuous and strictly positive on their open intervals. By [F2], ∫f=∫g=1.

5.1F6F7F9step 3.1step 2.1step 4.1algebra

Define the cumulative functions FA(x)=∫a−xf(t)dt and FB(y)=∫b−yg(t)dt on their projection intervals. Since A,B lie in bounded boxes, all their slices lie in one fixed bounded box in Rd−1; [F6, F9] therefore bound f,g uniformly. Their cumulative integrals consequently extend continuously to the projection endpoints with values zero and one, using ∫f=∫g=1 from step 4.1. Positivity of f,g on the open intervals makes FA,FB strictly increasing there, so they map those intervals onto (0,1). On every compact interior subinterval [F7] gives derivatives FA′=f and FB′=g. The inverse theorem then gives that φ=FB−1∘FA is C1 on the open interval and φ′(x)=f(x)/g(φ(x)). Let z(x)=(1−λ)x+λφ(x); then z′(x)=(1−λ)+λf(x)/g(φ(x))>0.

6.1F2F3F11step 5.1step 4.1step 2.1step 3.1inductionalgebra

Let C=(1−λ)A+λB, which is compact by [F11], and let cz be the (d−1)-dimensional volume of its compact slice at coordinate z. The slice-volume function is measurable by [F2] and [F11]. The slice of C at z(x) contains (1−λ)Ax+λBφ(x). The induction hypothesis yields cz(x)≥((1−λ)f(x)1/(d−1)+λg(φ(x))1/(d−1))d−1. Set r=g(φ(x))/f(x)>0. Multiplying this bound by z′(x) and using [F3] twice gives cz(x)z′(x)≥f(x)((1−λ)+λr1/(d−1))d−1((1−λ)+λ/r)≥f(x). The last inequality follows by applying [F3] to both positive brackets.

7.1F1F2F4F7F8F11step 6.1step 5.1step 4.1step 2.1step 3.1givenalgebra

Restrict x to an open interval J strictly inside (a−,a+). The map z is C1 with positive derivative by step 5.1, and [F7] makes it a C1 diffeomorphism onto its open image z(J). Thus [F4] and step 6.1 give λd(C)=∫czdz≥∫z(J)czdz=∫Jcz(x)z′(x)dx≥∫Jf(x)dx. Here cz is measurable and the equality is the one-dimensional change of variables. For all sufficiently large integers m, take Jm=(a−+1/m,a+−1/m); these intervals increase to (a−,a+). By [F8] and ∫f=1, λd(C)≥1. This proves the normalized claim in dimension d.

8.1F1step 1.1step 2.1step 3.1step 7.1algebradischarge-induction∎

The induction proves the normalized claim in every finite dimension. Undoing the normalization in step 2.1 gives λd(A+B)1/d≥a+b=λd(A)1/d+λd(B)1/d, including the zero-volume cases from step 1.1.

Depends on

Used by

Dependency tree · two levels

146 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