TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-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.

The weighted arithmetic-geometric mean inequality for real weights

Statement

Let $n \geq 1$ , let $x_{1}, \dots, x_{n} > 0$ , and let $w_{1}, \dots, w_{n} \geq 0$ satisfy $\sum_{i = 1}^{n} w_{i} = 1$ . Then $\prod_{i = 1}^{n} x_{i}^{w_{i}} \leq \sum_{i = 1}^{n} w_{i} x_{i} .$

Facts & Assumptions

Given: Positive reals $x_{i}$ and nonnegative real weights $w_{i}$ summing to $1$ .

[L1]

The two-point exponential inequality holds for every weight in $[0, 1]$ (The two-point convexity inequality for the exponential function).

[L2]

Positive-base real powers and their product laws are $x^{r} = \exp (r \log x)$ and the laws of The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents (Real powers for positive bases, with the zero-base positive-exponent convention, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[L3]

Mathematical induction is valid on natural numbers (The principle of mathematical induction).

Proof

technique · induction

1.1

For $n = 1$ , $w_{1} = 1$ and both sides are $x_{1}$ .

basegiven

1.2

Assume the result for $n$ positive entries. For weights $w_{1}, \dots, w_{n + 1}$ , if $w_{n + 1} = 1$ the claim is immediate; otherwise put $W = 1 - w_{n + 1} > 0$ , $v_{i} = w_{i} / W$ for $i \leq n$ , and $P : = \prod_{i = 1}^{n} x_{i}^{v_{i}}$ .

ihgiven

1.3

Applying [L1] to $\log P, \log x_{n + 1}$ with weights $W, w_{n + 1}$ gives $P^{W} x_{n + 1}^{w_{n + 1}} \leq W P + w_{n + 1} x_{n + 1}$ .

L1L2

2.1

The $v_{i}$ are nonnegative and sum to one, so the induction hypothesis gives $P \leq A : = \sum_{i = 1}^{n} v_{i} x_{i}$ .

step 1.2ih

3.1

The left side in step 1.3 is $\prod_{i = 1}^{n + 1} x_{i}^{w_{i}}$ , and step 2.1 makes its right side at most $\sum_{i = 1}^{n + 1} w_{i} x_{i}$ .

step 2.1step 1.3L2algebra

4.1

The base and induction steps prove the inequality for every $n \geq 1$ .

step 1.1step 3.1L3discharge-induction∎

Depends on

Used by

Young's inequality for conjugate real exponents Theorem

Dependency tree · two levels

18 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

J. Lebl, Basic Analysis, Logarithm and Exponential (standard reference, not scraped)
MIT OpenCourseWare 18.100B Real Analysis, Spring 2025 full lecture notes (standard reference, not scraped)