Geometry lives in the notion of angle. You can have a vector space — a collection of objects you can add and scale — without any concept of perpendicularity, without any way to measure how "close" two directions are to each other. Linear algebra as developed so far gives you span, independence, bases, and dimension, but nothing that distinguishes the unit vectors in $\mathbb{R}^2$ from any other basis. The moment you ask "are these two vectors orthogonal?" or "what is the projection of $v$ onto $u$?", you are reaching for something more: a rule that turns pairs of vectors into numbers, encoding their geometric relationship. That rule is an inner product.

The payoff is enormous. From a single inner product, you recover lengths (by setting both inputs equal), angles (via the ratio of inner product to lengths), orthogonality, orthonormal bases, and eventually an entire calculus of projections. The [Gram-Schmidt process](/page/Gram-Schmidt%20Process) turns any basis into an orthonormal one. The [spectral theorem](/page/Spectral%20Theorem) — one of the deepest results in linear algebra — says that self-adjoint operators on inner product spaces are diagonalizable by an orthonormal basis. Every result in the theory of [Fourier series](/page/Fourier%20Series) and $L^2$ spaces is an infinite-dimensional echo of the geometry we develop here.

[example: Dot Product in Euclidean Space] In $\mathbb{R}^n$, the familiar dot product is \begin{align*} \langle v, w \rangle &= \sum_{i=1}^{n} v_i w_i. \end{align*} This gives $|\langle v, w \rangle| \le |v| |w|$ (Cauchy-Schwarz), with equality iff $v$ and $w$ are parallel. The angle $\theta$ between $v$ and $w$ satisfies \begin{align*} \cos \theta &= \frac{\langle v, w \rangle}{|v| \, |w|}. \end{align*} For example, $v = (1, 1, 0)$ and $w = (1, -1, 0)$ satisfy $\langle v, w \rangle = 1 \cdot 1 + 1 \cdot (-1) + 0 = 0$, so $\theta = \pi/2$: these vectors are orthogonal. The dot product is the prototype that the abstract definition will axiomatize. [/example]

But $\mathbb{R}^n$ with the dot product is only one example. The space $\mathbb{C}^n$ of complex $n$-tuples needs a Hermitian inner product to give real, non-negative lengths. The space of continuous functions $C([0,1])$ carries an $L^2$ inner product. The abstract definition captures all of these at once.

## Definition

What properties does the dot product actually use? It is bilinear (or sesquilinear over $\mathbb{C}$), symmetric (or conjugate-symmetric), and positive definite. These are precisely the axioms we isolate.

[definition: Inner Product] Let $V$ be a vector space over a field $\mathbb{F}$, where $\mathbb{F}$ is either $\mathbb{R}$ or $\mathbb{C}$. An **inner product** on $V$ is a function \begin{align*} (\cdot, \cdot)_V : V \times V &\to \mathbb{F} \end{align*} satisfying the following three axioms for all $u, v, w \in V$ and all $\alpha \in \mathbb{F}$: 1. **Linearity in the first argument:** $(u + \alpha v, w)_V = (u, w)_V + \alpha (v, w)_V$. 2. **Conjugate symmetry:** $(u, v)_V = \overline{(v, u)_V}$. 3. **Positive definiteness:** $(v, v)_V \ge 0$, with $(v, v)_V = 0$ iff $v = 0$. When $\mathbb{F} = \mathbb{R}$, conjugate symmetry reduces to ordinary symmetry: $(u, v)_V = (v, u)_V$. [/definition]

[remark: Linearity Convention] The convention here is linearity in the first argument and conjugate-linearity in the second. This matches the convention in the notation standards (and in most functional analysis), where $(f, g)_{L^2} = \int f \bar{g} \, d\mathcal{L}^n$ is linear in $f$ and conjugate-linear in $g$. Some textbooks (particularly in physics) reverse this convention. Be alert to the difference when reading other sources. [/remark]

With an inner product in hand, we can name the structure it equips a vector space with. This is not merely a formality: the definition packages together the vector space and its inner product as a unit, so that statements about the geometry — angles, lengths, projections — refer unambiguously to a specific pairing, not just the underlying set of vectors.

[definition: Inner Product Space] An **inner product space** is a pair $(V, (\cdot, \cdot)_V)$ where $V$ is a vector space over $\mathbb{F} \in \{\mathbb{R}, \mathbb{C}\}$ and $(\cdot, \cdot)_V$ is an inner product on $V$. [/definition]

Every inner product induces a norm. This is not a definition but a theorem: the positivity axiom ensures that taking the square root of the inner product with itself yields a well-defined, non-negative real number, and the other norm axioms follow.

[definition: Induced Norm] Let $(V, (\cdot, \cdot)_V)$ be an inner product space. The **induced norm** (or **norm induced by the inner product**) is \begin{align*} \|v\|_V &:= \sqrt{(v, v)_V} \end{align*} for $v \in V$. [/definition]

That $\|\cdot\|_V$ satisfies the triangle inequality — the hardest norm axiom to verify — follows from the Cauchy-Schwarz inequality, which we prove in the next section. The other axioms are immediate: $\|v\|_V \ge 0$ by positive definiteness, $\|\alpha v\|_V = |\alpha| \|v\|_V$ because $(\alpha v, \alpha v)_V = \alpha \bar{\alpha} (v,v)_V = |\alpha|^2 (v,v)_V$, and $\|v\|_V = 0$ iff $v = 0$ again by positive definiteness.

[example: Standard Inner Products] The most important examples of inner product spaces: **1. Euclidean space $\mathbb{R}^n$.** Let $v = (v_1, \ldots, v_n)$ and $w = (w_1, \ldots, w_n)$. The standard inner product is \begin{align*} (v, w)_{\mathbb{R}^n} &= \sum_{i=1}^{n} v_i w_i. \end{align*} This is real-valued, symmetric, and positive definite. The induced norm is the Euclidean norm $\|v\|_{\mathbb{R}^n} = \sqrt{\sum_{i=1}^n v_i^2}$. **2. Unitary space $\mathbb{C}^n$.** For $v, w \in \mathbb{C}^n$: \begin{align*} (v, w)_{\mathbb{C}^n} &= \sum_{i=1}^{n} v_i \overline{w_i}. \end{align*} Note the conjugate on $w_i$: this ensures $(v, v)_{\mathbb{C}^n} = \sum_i |v_i|^2 \ge 0$. Without the conjugate, taking $v = (i, 0, \ldots, 0)$ gives $(v, v) = i^2 = -1$, violating positive definiteness. **3. $L^2([a,b])$.** On the space of square-integrable functions $f, g: [a,b] \to \mathbb{C}$: \begin{align*} (f, g)_{L^2} &= \int_a^b f(x) \overline{g(x)} \, d\mathcal{L}^1(x). \end{align*} Here $\mathcal{L}^1$ is Lebesgue measure on $[a,b]$. This is the inner product that makes Fourier analysis work: the trigonometric functions $\{e^{2\pi i n x}\}_{n \in \mathbb{Z}}$ are orthonormal in $L^2([0,1])$. [/example]

The standard inner product on $\mathbb{R}^n$ and the $L^2$ inner product on function spaces show that inner products are plentiful, but not every norm you encounter will come from one. The question of which norms arise from inner products has a clean, testable answer — and the failure of that test reveals the geometric rigidity that an inner product imposes.

[example: The $\ell^1$ Norm Is Not an Inner Product Norm] Not every norm comes from an inner product. The $\ell^1$ norm on $\mathbb{R}^2$ — $\|(v_1, v_2)\|_1 = |v_1| + |v_2|$ — satisfies the triangle inequality but does not arise from any inner product. The precise criterion is the [parallelogram law](/page/Parallelogram%20Law): a norm comes from an inner product if and only if $\|u + v\|^2 + \|u - v\|^2 = 2\|u\|^2 + 2\|v\|^2$ for all $u, v$. For $\ell^1$: take $u = (1, 0)$ and $v = (0, 1)$. Then $\|u + v\|_1 = \|(1,1)\|_1 = 2$ and $\|u - v\|_1 = \|(1,-1)\|_1 = 2$, so the left side is $2^2 + 2^2 = 8$. The right side is $2\|u\|_1^2 + 2\|v\|_1^2 = 2 \cdot 1 + 2 \cdot 1 = 4$. The parallelogram law fails, so $\ell^1$ is not an inner product norm. [/example]

## The Cauchy-Schwarz Inequality

The foundational inequality of inner product spaces is Cauchy-Schwarz. It is not a theorem about geometry — it is a consequence purely of the axioms, and it unlocks nearly everything else: the triangle inequality, the definition of angle, the continuity of the inner product, and eventually the Riesz representation theorem.

The key idea behind the proof is to ask: for a fixed $u$ and $v$, what choice of scalar $t \in \mathbb{F}$ minimizes $\|u - tv\|^2$? Since norms are non-negative, expanding and minimizing over $t$ forces a relationship between $(u, v)$ and $\|u\| \|v\|$.

[quotetheorem:432]