Theorem 1.35 — the Schwarz inequality
ProvedRudin.ch01_cauchy_schwarzanalysisinequalities
For complex numbers and ,
Preamble
import Mathlib
Formal statement
namespace Rudin
/-- Rudin, Theorem 1.35 (the Schwarz inequality): for complex numbers `a 0, …, a (n-1)` and
`b 0, …, b (n-1)`,
`|∑ a j * conj (b j)| ^ 2 ≤ (∑ |a j| ^ 2) * (∑ |b j| ^ 2)`. -/
theorem ch01_cauchy_schwarz (n : ℕ) (a b : Fin n → ℂ) :
‖∑ j, a j * (starRingEnd ℂ) (b j)‖ ^ 2 ≤ (∑ j, ‖a j‖ ^ 2) * (∑ j, ‖b j‖ ^ 2) := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 1, p. 15, Theorem 1.35
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a natural number and let be families of complex numbers indexed by , written and . Then
where each sum is the finite sum over all indices , is the complex conjugate of , and is the modulus of a complex number. The left side is the square of a nonnegative real number, and both factors on the right are nonnegative reals.
The statement holds for every , including the degenerate case , where all sums are empty and the inequality reads . No nonvanishing, normalization or independence hypothesis is imposed on the families and .
Human review
Confirmed by the mission captain (proposal self-audit).