Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Archimedean product region, volume and norm bound

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let integers r1,r2≥0 with n=r1+2r2≥1 and a real t>0 be given, and in Rr1×Cr2≅Rn put

Xt={(x,z):∑i=1r1∣xi∣+2∑j=1r2∣zj∣≤t}.

Then:

  1. Xt is compact, convex and centrally symmetric with nonempty interior;
  2. vol⁡(Xt)=2 r1(π2)r2tnn!;
  3. every point of Xt satisfies ∏i=1r1∣xi∣∏j=1r2∣zj∣2≤(tn)n.

Facts & Assumptions

Given: The Axiom of Choice, integers r1,r2≥0 with n=r1+2r2≥1 and a real t>0, with Xt as in the statement and the identification of Unscaled Minkowski embedding.

[A1]

The Axiom of Choice gives the Axiom of Countable Choice (AC implies DC implies countable choice), which discharges the Countable Choice hypotheses of the volume facts [F6], [F1] and [F3], invoked in steps 1.4, 2.1 and 3.1 respectively; no further choice is used.

[F1]

Polar coordinates: for Borel f≥0 on Rm, ∫Rmf dλm=∫0∞∫Sm−1f(rω)rm−1dσ(ω) dr, where σ is the polar surface set function on Sm−1 (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F2]
[F3]

Under Rp+q=Rp×Rq, the product measure agrees with Lebesgue measure on Borel sets (On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}).

[F4]

AM-GM: for a1,…,an≥0 with n≥1, ∏kak≤(1n∑kak)n (The arithmetic mean, geometric mean inequality).

[F5]

The unit disc has area λ2(B2)=π: the unit-ball volume formula Vm(1)=πm/2/Γ(m/2+1) at m=2 gives π/Γ(2)=π (The closed form for the volume of the unit n-ball).

[F7]

The polar surface set function of The polar surface set function on the unit sphere is defined by σ(E)=n λn({rω:ω∈E, 0<r≤1}); for E=Sm−1 the set on the right is the unit ball Bm up to the null set {0}, so σ(Sm−1)=mλm(Bm) (The polar surface set function on the unit sphere).

Proof

1.1given

The function N(x,z)=∑i∣xi∣+2∑j∣zj∣ is continuous, convex and even, so Xt=N−1([0,t]) is closed, convex and centrally symmetric; it is bounded because every coordinate of a point of Xt has absolute value at most t, hence compact, and the origin is interior because a small ball around the origin satisfies ∑i∣xi∣+2∑j∣zj∣<t.

1.2algebra

(Weighted simplex integral.) For integers p≥0 and nonnegative integer weights c1,…,cp, define Jp(t)=∫y1,…,yp≥0, ∑kyk≤t∏kykck dy; then Jp(t)=t p+C∏kck!/(p+C)! with C=∑kck.

1.3F5F7given

For each complex coordinate the polar surface value is σ(S1)=2λ2(B2)=2π, by [F7] with m=2 and [F5].

1.4F6A1given

(Sign splitting.) The region {(x,z):∑i∣xi∣+2∑j∣zj∣≤t} is the union over the 2r1 sign choices of the pieces with prescribed signs of x1,…,xr1, and coordinate reflections carry each piece to the piece with all signs positive while preserving Lebesgue measure by [F6], whose Countable Choice hypothesis is supplied by [A1]; intersections lie in coordinate hyperplanes, which have measure zero.

1.5F4givenalgebra

For (x,z)∈Xt apply [F4] with n arguments equal to ∣x1∣,…,∣xr1∣ and to the two copies each of ∣z1∣,…,∣zr2∣: their sum is at most t, so their product satisfies ∏i∣xi∣∏j∣zj∣2≤(t/n)n.

2.1A1F1step 1.3given

(Radial reduction.) Using step 1.3 and the polar formula [F1] with m=2, the substitution u=2ρ gives ∫CF(2∣z∣) dz=2π∫0∞F(2ρ)ρ dρ=(π/2)∫0∞F(u)u du for Borel F≥0, the Countable Choice hypothesis of [F1] being supplied by [A1].

2.2F2step 1.2algebra

(Induction for step 1.2.) The identity of step 1.2 is proved by induction on p: for p=0 both sides are 1; for p≥1 Tonelli slices the last variable, Jp(t)=∫0tycpJp−1(t−y) dy, and the induction hypothesis reduces the claim to the one-variable identity ∫0tya(t−y)b dy=a! b! ta+b+1/(a+b+1)!, which follows by induction on b from ∫0tya dy=ta+1/(a+1) and ya(t−y)b+1=t ya(t−y)b−ya+1(t−y)b, both elementary antiderivative computations for polynomials on a compact interval.

3.1F2F3A1step 2.1step 1.4

Applying step 2.1 in each complex coordinate and [F2] together with [F3] to the resulting iterated integrals, then applying step 1.4 to the real coordinates, gives vol⁡(Xt)=2 r1(π/2)r2D(t) with D(t)=Jr1+r2(t) for the weight vector with ck=0 on the first r1 indices and ck=1 on the remaining r2 indices, the Countable Choice hypothesis of [F3] being supplied by [A1].

4.1step 1.2step 3.1step 2.2algebra

For the weight vector of step 3.1 one has p+C=(r1+r2)+r2=n, so D(t)=tn/n! and vol⁡(Xt)=2 r1(π/2)r2tn/n!.

5.1step 1.1step 4.1step 1.5∎

Step 1.1 proves the compactness, convexity and symmetry clause, step 4.1 the volume formula and step 1.5 the norm bound, so the three assertions of the statement hold.

Depends on

Used by

Dependency tree · two levels

87 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