Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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.

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation

Statement

Let n∈N and let x,y∈Rn, with the Euclidean inner product and the Euclidean norm as in The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Then:

  1. Cauchy-Schwarz. ∣⟨x,y⟩∣  ≤  ∥x∥2 ∥y∥2, with equality if and only if there is a pair (λ,μ)≠(0,0) of reals with λxk=μyk for every k<n.
  2. ∥⋅∥2 is a norm on Rn (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms), for every n∈N; the metric it induces is d2 of Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it whenever n≥1.
  3. Parallelogram law. ∥x+y∥22+∥x−y∥22  =  2∥x∥22+2∥y∥22.
  4. Polarisation. ⟨x,y⟩  =  14(∥x+y∥22−∥x−y∥22), so the inner product is recovered from the norm it induces.

Clause 1 is a citation, not a new proof. The inequality and its equality case are the published The Cauchy-Schwarz inequality for finite sums, stated there for two lists of reals; all that happens below is that it is read in the vector notation of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Re-proving it here would put two proofs of one statement in the library.

Facts & Assumptions

Given: A natural number n and vectors x,y∈Rn, so that ⟨x,y⟩=∑k<nxkyk and ∥x∥2=⟨x,x⟩ (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Finite sums and finite products, by recursion).

[L1]

Cauchy-Schwarz for finite sums (The Cauchy-Schwarz inequality for finite sums): (∑k<nakbk)2≤(∑k<nak2)(∑k<nbk2), with equality if and only if there is (λ,μ)≠(0,0) with λak=μbk for every k<n; and the root form ∣∑k<nakbk∣≤∑k<nak2∑k<nbk2.

[L2]

The inner product is symmetric, bilinear and positive definite, ⟨x,x⟩=∑k<nxk2≥0, and ⟨x,x⟩=0 exactly when x=0 (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn, Laws of finite sums and finite products).

[L3]

Square roots (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}): every c≥0 has a unique s≥0 with s2=c, written c; hence ∥x∥2≥0 and ∥x∥22=⟨x,x⟩ (Integer powers am).

[L4]

Squaring is monotone on the nonnegatives: for a,b≥0, a≤b if and only if a2≤b2, and a=b if and only if a2=b2 (Squaring is monotone on the nonnegatives).

[L5]

Absolute value (Basic properties of the absolute value, Absolute value in an ordered field): ∣t∣≥0, ∣t∣2=t2, and ∣st∣=∣s∣ ∣t∣.

Proof

technique · direct
1.1

Instantiating [L1] at ak:=xk and bk:=yk gives ⟨x,y⟩2≤⟨x,x⟩ ⟨y,y⟩, with equality exactly when some (λ,μ)≠(0,0) has λxk=μyk for every k<n.

L1L2
1.2

Both ∣⟨x,y⟩∣ and ∥x∥2∥y∥2 are nonnegative, and their squares are ⟨x,y⟩2 and ⟨x,x⟩⟨y,y⟩.

L3L5
1.3

Expanding by bilinearity and symmetry, ⟨x+y,x+y⟩=⟨x,x⟩+⟨x,y⟩+⟨y,x⟩+⟨y,y⟩=∥x∥22+2⟨x,y⟩+∥y∥22.

L2L3
1.4

The same expansion at x−y=x+(−1)y gives ∥x−y∥22=∥x∥22−2⟨x,y⟩+∥y∥22.

L2L3
1.5

For a scalar λ, ⟨λx,λx⟩=λ2⟨x,x⟩=∣λ∣2∥x∥22, so ∥λx∥22=(∣λ∣∥x∥2)2.

L2L3L5
1.6

Axiom (N1) holds: ∥x∥2=0 if and only if ∥x∥22=⟨x,x⟩=0, which by positive definiteness says x=0.

L2L3L4
2.1

Comparing the squares of step 1.2 through step 1.1 and using monotonicity of squaring on the nonnegatives yields ∣⟨x,y⟩∣≤∥x∥2∥y∥2, with equality exactly in the proportional case of step 1.1; this is clause 1.

step 1.1step 1.2L4
2.2

Adding the identities of step 1.3 and step 1.4 gives ∥x+y∥22+∥x−y∥22=2∥x∥22+2∥y∥22, which is clause 3.

step 1.3step 1.4algebra
2.3

Subtracting the identity of step 1.4 from that of step 1.3 gives ∥x+y∥22−∥x−y∥22=4⟨x,y⟩, which is clause 4 after dividing by 4.

step 1.3step 1.4algebra
2.4

Both ∥λx∥2 and ∣λ∣∥x∥2 are nonnegative and by step 1.5 have equal squares, so ∥λx∥2=∣λ∣∥x∥2, which is axiom (N2).

step 1.5L3L4L5
3.1

By step 2.1 the middle term of step 1.3 satisfies 2⟨x,y⟩≤2∥x∥2∥y∥2, so ∥x+y∥22≤∥x∥22+2∥x∥2∥y∥2+∥y∥22=(∥x∥2+∥y∥2)2.

step 1.3step 2.1L5algebra
4.1

Both ∥x+y∥2 and ∥x∥2+∥y∥2 are nonnegative, so step 3.1 and monotonicity of squaring give ∥x+y∥2≤∥x∥2+∥y∥2, which is axiom (N3).

step 3.1L3L4
5.1

Steps 2.4, 1.6 and 4.1 are exactly (N1), (N2) and (N3), so ∥⋅∥2 is a norm on Rn for every n∈N, and for n≥1 the metric it induces is d2; this is clause 2, and with steps 2.1, 2.2 and 2.3 all four clauses are proved.

step 2.1step 2.2step 2.3step 2.4step 1.6step 4.1L6∎

Remarks

Depends on

Used by

Dependency tree · two levels

59 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