Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.35 — the Schwarz inequality

Proved
Rudin.ch01_cauchy_schwarz

by LG · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisinequalities

For complex numbers a1,…,ana_1, \dots, a_na1​,…,an​ and b1,…,bnb_1, \dots, b_nb1​,…,bn​,

∣∑j=1najbj‾∣2≤∑j=1n∣aj∣2∑j=1n∣bj∣2.\Big|\sum_{j=1}^n a_j \overline{b_j}\Big|^2 \le \sum_{j=1}^n |a_j|^2 \sum_{j=1}^n |b_j|^2 .​j=1∑n​aj​bj​​​2≤j=1∑n​∣aj​∣2j=1∑n​∣bj​∣2.
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 Rudin
Source
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 nnn be a natural number and let a,ba, ba,b be families of complex numbers indexed by {0,1,…,n−1}\{0,1,\dots,n-1\}{0,1,…,n−1}, written aja_jaj​ and bjb_jbj​. Then

∥∑jajbj‾∥2  ≤  (∑j∥aj∥2)(∑j∥bj∥2),\Bigl\lVert \sum_{j} a_j \overline{b_j} \Bigr\rVert^{2} \;\le\; \Bigl( \sum_{j} \lVert a_j \rVert^{2} \Bigr) \Bigl( \sum_{j} \lVert b_j \rVert^{2} \Bigr),​j∑​aj​bj​​​2≤(j∑​∥aj​∥2)(j∑​∥bj​∥2),

where each sum is the finite sum over all nnn indices jjj, bj‾\overline{b_j}bj​​ is the complex conjugate of bjb_jbj​, and ∥⋅∥\lVert \cdot \rVert∥⋅∥ 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 nnn, including the degenerate case n=0n = 0n=0, where all sums are empty and the inequality reads 0≤00 \le 00≤0. No nonvanishing, normalization or independence hypothesis is imposed on the families aaa and bbb.

Human review
  • Endorsed by Shuze Chen · Sep 12, 2026

  • Endorsed by LG · Sep 12, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me