Linear Operators on Hilbert Space

States answer "what is the system?"; operators answer everything else — what can be measured, how things evolve, what symmetries act. The previous chapter used operators informally: multiply by xx, differentiate and tack on −iℏ-i\hbar, reflect through the origin. This article promotes them to first-class citizens of the formalism, with one adjective doing all the work: linear. A linear operator treats superpositions transparently — acting on a sum, it acts on each part — and that single property is why quantum mechanics stays a linear theory all the way up, why interference survives every measurement-free process, and why the entire subject can be done as matrix algebra. The matrix connection is the article's centerpiece. A linear operator is completely determined by what it does to a basis — finitely much information per basis vector — so choosing a basis converts abstract operators into concrete arrays of numbers Amn=⟨m∣A^∣n⟩A_{mn} = \langle m|\hat A|n\rangle, composition into row-by-column multiplication, and quantum mechanics into arithmetic. That is not a computational trick; it is historically how the theory was discovered, matrices first, meaning later. You will build the position operator's matrix in the particle-in-a-box basis and watch a familiar friend reappear uninvited: the parity selection rule, now visible as a checkerboard of zeros. Equally important is what operators do not do: commute. x^\hat x then p^\hat p differs from p^\hat p then x^\hat x, and the difference — the commutator — is where quantum mechanics stores its deepest physics. This article exhibits the non-commutativity concretely and hands the two famous consequences to their owners: the canonical commutation relation and the uncertainty machinery live two doors down. Here you learn the algebra: products, inverses, functions of operators, and the honest fine print about unbounded operators that infinite dimensions impose.

Key takeaways
  • A linear operator maps states to states respecting superposition: A^(c1∣ψ1⟩+c2∣ψ2⟩)=c1A^∣ψ1⟩+c2A^∣ψ2⟩\hat A(c_1|\psi_1\rangle + c_2|\psi_2\rangle) = c_1\hat A|\psi_1\rangle + c_2\hat A|\psi_2\rangle.
  • Linearity ⟹ the operator is fixed by its action on any basis: the numbers Amn=⟨m∣A^∣n⟩A_{mn} = \langle m|\hat A|n\rangle are its matrix representation, and operator composition = matrix multiplication.
  • The workhorse examples: x^\hat x (multiply), p^=−iℏ d/dx\hat p = -i\hbar\,d/dx (differentiate), parity Π^\hat\Pi, projectors, the Hamiltonian. Complex conjugation is the standard counterexample — antilinear, not linear.
  • Operators generally do not commute: [x^,p^]≠0[\hat x, \hat p] \ne 0 shown concretely here; the commutation relation's derivation and doctrine belong to later articles.
  • Products, powers, inverses, and functions (eA^e^{\hat A} via the power series) inherit from the algebra — but eA^eB^≠eA^+B^e^{\hat A}e^{\hat B} \ne e^{\hat A + \hat B} unless the operators commute.
  • Infinite dimensions add fine print: p^\hat p and H^\hat H are unbounded (they can stretch states arbitrarily), so domains matter — flagged honestly, resolved later in the chapter.
  • Key idea: a linear operator is determined entirely by its action on a basis; choosing a basis turns abstract operator algebra into matrix algebra.
The core insight

A linear operator is determined entirely by its action on a basis; choosing a basis turns abstract operator algebra into matrix algebra — and the failure of operators to commute is where the theory's distinctly quantum content lives.

Where this lives today

"Build the matrix, diagonalize, read the physics" is the daily loop of computational science. Quantum-chemistry packages assemble Hamiltonians in orbital bases exactly as the derivation card assembled x^\hat x — texture, selection-rule zeros, truncation audits and all; the field's crown-jewel methods (CI, coupled-cluster) are strategies for taming matrix size. Every quantum-computing gate is a small operator specified as its matrix, composed by multiplication in precisely equation (2)'s sense, and compiled hardware instructions are checked against the algebra rule that order matters. The two-level truncation of Example 2 is the working model of qubits, atomic clocks, and laser spectroscopy — with its off-resonance audit now an engineering discipline ("leakage to state 3" is a quoted error budget line in superconducting processors). And the unbounded-operator fine print earns salaries in mathematical physics: proving self-adjointness of new Hamiltonians remains the licensing exam for quantum models.

The physical picture

Think of an operator as a machine with a conveyor belt: states in, states out. The linearity contract says the machine has no threshold, no saturation, no cross-talk: feed it a superposition and it processes each component independently, preserving the coefficients. That contract is physics, not convenience. Interference patterns survive propagation because the evolution machine is linear; a superposition of two paths stays a superposition rather than collapsing into a blend. When you meet genuine nonlinearity in quantum-looking equations (the Gross–Pitaevskii equation of condensates, say), it is always an effective description — many particles approximated as one field — never the fundamental theory.

Figure
The linearity contract — superpositions pass through the machine component by component
 c₁|ψ₁⟩ c₂|ψ₂⟩ c₁ Â|ψ₁⟩ c₂ Â|ψ₂⟩ + + same coefficients out as in — no cross-talk, no threshold: interference survives the machine counterexample: complex conjugation K conjugates the coefficients on the way through — antilinear, a different species Operators are superposition-transparent machines

The second picture is the operator as a filled-in table. Because the machine is linear, you know everything about it once you know what it does to basis vectors: A^∣n⟩\hat A|n\rangle is some state, expandable as ∑mAmn∣m⟩\sum_m A_{mn}|m\rangle, and the complex numbers AmnA_{mn} — how much of output mm comes from input nn — are the machine's complete specification. Arrange them in an array and every question about A^\hat A becomes arithmetic. The rows and columns even carry physics on their face: a diagonal table means the basis states are the machine's "natural" inputs (each processed without leaking into the others — eigenstates, formally treated in the next article); zeros stamped in a pattern mean a selection rule; a band structure means the operator only connects near neighbours. Reading matrices like this is a professional skill, and the worked examples train it.

Definition, examples, counterexample

The contract, in one line — for all states and all complex coefficients:

A^(c1∣ψ1⟩+c2∣ψ2⟩)=c1 A^∣ψ1⟩+c2 A^∣ψ2⟩(1)\hat A\bigl(c_1|\psi_1\rangle + c_2|\psi_2\rangle\bigr) = c_1\,\hat A|\psi_1\rangle + c_2\,\hat A|\psi_2\rangle \qquad (1)

where: both requirements matter — additivity and the scalars passing through unconjugated. The roster of machines you have already used checks out instantly: the position operator (x^ψ=xψ\hat x\psi = x\psi — multiplication distributes over sums), the momentum operator p^=−iℏ ∂x\hat p = -i\hbar\,\partial_x (differentiation is linear — its wave-mechanics credentials live in the Momentum Operator article of the previous chapter), the parity operator Π^\hat\Pi (relabeling the argument touches no coefficient), every projector ∣n⟩⟨n∣|n\rangle\langle n|, and every Hamiltonian you have built. The instructive counterexample is complex conjugation, K^ψ=ψ∗\hat K\psi = \psi^*: additive, yes — but K^(cψ)=c∗K^ψ\hat K(c\psi) = c^*\hat K\psi. The scalar comes through conjugated: K^\hat K is antilinear, a genuinely different species that quantum mechanics reserves for exactly one job (time reversal), and the distinction will matter there. The table-of-numbers statement, precisely: pick an orthonormal basis {∣n⟩}\{|n\rangle\} and define

Amn=⟨m∣A^∣n⟩⟺A^=∑m,nAmn ∣m⟩⟨n∣(2)A_{mn} = \langle m|\hat A|n\rangle \quad\Longleftrightarrow\quad \hat A = \sum_{m,n} A_{mn}\,|m\rangle\langle n| \qquad (2)

where: the right-hand reconstruction (a sum of outer products weighted by the matrix elements) shows the correspondence is complete — nothing about A^\hat A outruns its matrix. Composition then obeys the chain you verified in the bra-ket article by inserting a complete set: (A^B^)mn=∑kAmkBkn(\hat A\hat B)_{mn} = \sum_k A_{mk}B_{kn} — operator products are matrix products, with order preserved. Everything in your linear-algebra toolkit — identity (1mn=δmn\mathbb 1_{mn} = \delta_{mn}), inverses when they exist ((A^B^)−1=B^−1A^−1(\hat A\hat B)^{-1} = \hat B^{-1}\hat A^{-1}, order reversed), traces (Tr A^=∑nAnn\mathrm{Tr}\,\hat A = \sum_n A_{nn}, cyclic under rotation of factors) — imports wholesale.

Derivation AThe position operator as a matrix — and a selection rule appears in the zeros

We construct the matrix of x^\hat x in the infinite-square-well basis on (0,L)(0, L) and read physics off the array. The strategy is direct evaluation of xmn=⟨m∣x^∣n⟩x_{mn} = \langle m|\hat x|n\rangle — trigonometric integrals a first-year student can do — but the payoff is structural: a checkerboard of exact zeros (the parity selection rule of the one-dimensional chapter, resurfacing as matrix texture) and a decay law down the rows that controls how well truncated matrices approximate the operator. Work in units L=1L = 1.

Step 1. Set up the integral: xmn=∫012sin⁡(mπx)  x  2sin⁡(nπx) dxx_{mn} = \int_0^1 \sqrt2\sin(m\pi x)\; x\;\sqrt2\sin(n\pi x)\,dx. Product-to-sum converts the integrand to cosines of (m∓n)πx(m\mp n)\pi x; integrate by parts once each.

Step 2. Diagonal elements. For m=nm = n the cross term averages out and xnn=12x_{nn} = \tfrac12 — every stationary state sits, on average, dead centre. Why this had to happen: relabel the well symmetric about its centre and each ∣n⟩|n\rangle has definite parity, forcing ⟨x−12⟩=0\langle x - \tfrac12\rangle = 0 — the parity article's structural zero, here as the constant diagonal.

Step 3. Off-diagonal elements. The integrals evaluate to

xmn=−8 mnπ2 (m2−n2)2(m+n odd),xmn=0(m+n even, m≠n)x_{mn} = -\frac{8\,mn}{\pi^2\,(m^2 - n^2)^2}\quad (m+n \text{ odd}), \qquad x_{mn} = 0 \quad (m+n \text{ even},\ m \ne n)

Why the checkerboard: x^−12\hat x - \tfrac12 is odd about the centre, and same-parity sandwiches of an odd operator vanish identically — the selection rule ⟨even∣x^∣even⟩=0\langle\text{even}|\hat x|\text{even}\rangle = 0 is stamped into the matrix as exact zeros at every m+nm + n even entry. The numbers you can feel: x12=−16/9π2=−0.180x_{12} = -16/9\pi^2 = -0.180 (large — the bright transition), x14=−32/225π2=−0.014x_{14} = -32/225\pi^2 = -0.014 (thirteen times smaller).

Step 4. Read the decay law. Along a row, ∣xmn∣∼8/π2(m−n)2⋅1/(m+n)2|x_{mn}| \sim 8/\pi^2(m-n)^2\cdot 1/(m+n)^2: far-off-diagonal elements die fast, which is exactly why truncating the infinite matrix to its first few rows and columns — the daily move of computational quantum mechanics — converges: the neglected corner is small. Truncation quality is the matrix texture made quantitative. Verified: all elements computed symbolically (sympy) — x11=12x_{11} = \tfrac12, x13=x24=0x_{13} = x_{24} = 0 exactly, and x12,x23,x14x_{12}, x_{23}, x_{14} matching −8mn/π2(m2−n2)2-8mn/\pi^2(m^2{-}n^2)^2; the 2×22\times2 truncation's eigenvalues 12∓16/9π2=0.320,0.680\tfrac12 \mp 16/9\pi^2 = 0.320, 0.680 confirmed numerically.

Figure
Matrix texture is physics — the ISW position matrix's checkerboard and decay
x_mn in the box basis: diagonal ½, parity zeros, fast off-diagonal decay 0.50 −0.180 0 −0.014 0.50 −0.194 0 0 0.50 −0.187 −0.014 0 0.50 n = 1 … 4 across and down · white cells: exact zeros (m+n even — the parity checkerboard) diagonal: ⟨x⟩ = L/2 amber: allowed transitions fading with (m−n)²(m+n)² selection rules, transition strengths, and truncation quality — all visible before any dynamics is computed reading arrays like this is the professional skill this article trains

Products, commutators, and functions of operators

Multiplication of machines is running one after another — and order is part of the specification. The bracket [A^,B^]=A^B^−B^A^[\hat A, \hat B] = \hat A\hat B - \hat B\hat A — the commutator — is the standing measure of how badly two machines care about order, and the cleanest concrete demonstration uses the two operators quantum mechanics is built on.

Go deeper · Derivation B · 1 minPosition and momentum refuse to commute — the exhibition
Derivation BPosition and momentum refuse to commute — the exhibition

We exhibit the non-commutativity of x^\hat x and p^=−iℏ ∂x\hat p = -i\hbar\,\partial_x by direct computation on an arbitrary wavefunction. The strategy is nothing but the product rule, applied carefully to operator products acting on a test function — the habit this card is really teaching, since the classic blunder is to manipulate x^p^\hat x\hat p as if it were a product of numbers. What this card establishes is the algebra fact; its postulate-level status in the theory belongs to Canonical Commutation Relation, and the measurement doctrine of commuting versus non-commuting pairs to The Commutator and Compatible Observables, both later this chapter.

Step 1. Run the first order: x^p^ ψ=x⋅(−iℏ ψ′)=−iℏ xψ′\hat x\hat p\,\psi = x\cdot(-i\hbar\,\psi') = -i\hbar\,x\psi'.

Step 2. Run the reversed order — the derivative now sees the product xψx\psi: p^x^ ψ=−iℏ ∂x(xψ)=−iℏ(ψ+xψ′)\hat p\hat x\,\psi = -i\hbar\,\partial_x(x\psi) = -i\hbar(\psi + x\psi'). Why the extra term: the product rule. The momentum machine differentiates everything downstream of it, including the xx the first machine installed — order is physically the question of who acts on whose output.

Step 3. Subtract:

[x^,p^] ψ=−iℏ xψ′+iℏ(ψ+xψ′)=iℏ ψ(3)[\hat x, \hat p]\,\psi = -i\hbar\,x\psi' + i\hbar(\psi + x\psi') = i\hbar\,\psi \qquad (3)

Step 4. Read the structure. The result is iℏi\hbar times the identity — no trace of ψ\psi's details survives: the non-commutativity is state-independent, universal, and of size ℏ\hbar. That constancy is why the classical limit (ℏ→0\hbar \to 0 relative to action scales) restores commuting quantities, and why no basis exists in which both x^\hat x and p^\hat p are diagonal — a matrix identity XP−PX=iℏ1XP - PX = i\hbar\mathbb 1 is impossible for finite matrices (take the trace: left side 0, right side iℏNi\hbar N), so the theory needs the infinite-dimensional spaces of this chapter. Verified: symbolically (sympy) on explicit test functions — [x,∂x]f=−f[x, \partial_x]f = -f and [x^,p^]f=iℏf[\hat x,\hat p]f = i\hbar f for f=sin⁡x e−x2/3f = \sin x\,e^{-x^2/3}; the trace obstruction is the standard finite-dimension no-go.

What this article insists on is the habit the card teaches: never reorder operator products without paying the commutator. The habit's most common casualty is the exponential. Functions of operators are defined by power series —

eA^=∑k=0∞A^kk!,buteA^eB^≠eA^+B^  unless [A^,B^]=0(4)e^{\hat A} = \sum_{k=0}^{\infty}\frac{\hat A^k}{k!}, \qquad \text{but} \qquad e^{\hat A}e^{\hat B} \ne e^{\hat A + \hat B} \ \ \text{unless } [\hat A, \hat B] = 0 \qquad (4)

where: the failure is quadratic and computable (the cross terms A^B^\hat A\hat B vs B^A^\hat B\hat A disagree at second order; the Baker–Campbell–Hausdorff machinery organizing the correction made a cameo in the coherent-states article). Exponentials of operators are about to become the theory's verbs — time evolution e−iH^t/ℏe^{-i\hat Ht/\hbar}, translations, rotations — all built and certified in Unitary Operators and Transformations; the algebra rule (4) is the safety briefing. Note what is deliberately absent from this article: the adjoint A^†\hat A^\dagger as a definitional theory (owned by Hermitian Conjugate and Adjoint Operators), and the classification of the physically distinguished operator families it generates — self-adjoint (next article, immediately) and unitary (later). Here you have the raw algebra those articles will discipline. One honest flag before the examples, because infinite dimensions really do add fine print. In the box basis, compute how hard p^\hat p works: ∥p^ ψn∥=nπℏ/L\|\hat p\,\psi_n\| = n\pi\hbar/L, growing without bound as nn increases. No finite constant CC satisfies ∥p^ψ∥≤C∥ψ∥\|\hat p\psi\| \le C\|\psi\| for all states: p^\hat p is an unbounded operator, as are x^\hat x on the line and every Hamiltonian with an infinite spectrum. Consequences worth knowing now: unbounded operators are not defined on every state (the Hilbert-space article's tent function has finite ⟨H^⟩\langle\hat H\rangle but infinite ⟨H^2⟩\langle\hat H^2\rangle: its kink makes H^ψ\hat H\psi leave L2L^2, so it sits outside the operator domain of H^\hat H even while the energy form ∫∣ψ′∣2\int|\psi'|^2 stays finite), and statements like "Hermitian" acquire domain fine print that the next article will flag and the rigged-space article will resolve. For every calculation in this track the practical rule suffices: work with states smooth and decaying enough that the operators you apply keep them in the space.

Limiting cases

caseresultmeaning
finite-dimensional H\mathcal Hoperators = matrices, no fine printspin systems: the entire article is exact matrix algebra
diagonal matrixbasis states are the machine's natural inputseigenbasis — the next article's subject
commuting operators[A^,B^]=0[\hat A,\hat B] = 0: order-free products, eA^eB^=eA^+B^e^{\hat A}e^{\hat B} = e^{\hat A+\hat B}compatible structures; simultaneous diagonalization later
[x^,p^]=iℏ[\hat x,\hat p] = i\hbarnever zero, state-independentthe quantum signature; doctrine at CCR and compatible-observables articles
antilinear maps (K^\hat K, time reversal)outside this article's contractscalars conjugate on passage; handled specially where needed
unbounded operators (p^\hat p, H^\hat H)domains matter; ∥A^ψ∥/∥ψ∥\|\hat A\psi\|/\|\psi\| unboundedinfinite-dimensional fine print; resolved at the chapter's end

Worked examples

Example 1 — is it linear? A machine inspection line (confidence builder). Classify each machine as linear, antilinear, or neither: (a) A^ψ(x)=x2ψ(x)\hat A\psi(x) = x^2\psi(x); (b) B^ψ(x)=ψ∗(x)\hat B\psi(x) = \psi^*(x); (c) C^ψ(x)=ψ(x)+χ0(x)\hat C\psi(x) = \psi(x) + \chi_0(x) for a fixed nonzero χ0\chi_0; (d) D^ψ(x)=ψ(2x)\hat D\psi(x) = \psi(2x).

Step 1. (a): multiplication by any fixed function distributes over sums and passes scalars — linear ✓ (it is x^2\hat x^2, a product of linear machines).

Step 2. (b): additive, but B^(cψ)=c∗ψ∗\hat B(c\psi) = c^*\psi^* — scalars conjugate on passage: antilinear. (The physical tenant of this species is time reversal.)

Step 3. (c): C^(ψ1+ψ2)=ψ1+ψ2+χ0\hat C(\psi_1 + \psi_2) = \psi_1 + \psi_2 + \chi_0, but C^ψ1+C^ψ2=ψ1+ψ2+2χ0\hat C\psi_1 + \hat C\psi_2 = \psi_1 + \psi_2 + 2\chi_0 — neither (affine, not linear: the offset breaks superposition; note C^(0)≠0\hat C(0) \neq 0, an instant tell).

Step 4. (d): rescaling the argument touches no coefficient — linear ✓ (a dilation; with the right prefactor it becomes the unitary scaling operator). Score: two linear, one antilinear, one impostor — and the impostor was caught by the zero-vector test, worth keeping.

Example 2 — the two-level dipole, by truncation (exam level). For light driving a particle in a box near the 1↔21 \leftrightarrow 2 resonance, only states 1 and 2 matter. Truncate x^\hat x (units L=1L = 1) to the 2×22\times2 block, and extract the physics.

Step 1. From the derivation card: x11=x22=12x_{11} = x_{22} = \tfrac12, x12=x21=−16/9π2=−0.180x_{12} = x_{21} = -16/9\pi^2 = -0.180. The block is

X=(0.5−0.180−0.1800.5)X = \begin{pmatrix} 0.5 & -0.180 \\ -0.180 & 0.5 \end{pmatrix}

Step 2. Diagonalize: eigenvalues 12∓16/9π2=0.320 and 0.680\tfrac12 \mp 16/9\pi^2 = \boxed{0.320 \text{ and } 0.680}, with eigenvectors 12(∣1⟩±∣2⟩)\tfrac{1}{\sqrt2}(|1\rangle \pm |2\rangle). Physical reading: the superpositions that maximally displace the particle left and right of centre — the two "positions" available to a two-level dipole, split symmetrically about the well centre.

Step 3. The off-diagonal element is the light-matter coupling: the dipole interaction −qEx^-qE\hat x has matrix element −qE x12-qE\,x_{12} between the resonant pair, so the Rabi frequency of the driven transition is Ω=qE∣x12∣/ℏ=0.180 qEL/ℏ\Omega = qE|x_{12}|/\hbar = 0.180\,qEL/\hbar. One number from the array runs the whole absorption story.

Step 4. Audit the truncation. The neglected couplings out of the block: x14=−0.014x_{14} = -0.014 (13× smaller — safe), but x23=−48/25π2=−0.194x_{23} = -48/25\pi^2 = -0.194 — larger than x12x_{12} itself! Why the truncation is still legal: state 3 is far off-resonance — the energy denominator, not the matrix element, suppresses its participation. Truncations are justified by dynamics plus texture, not texture alone — an honest lesson the two-level atom's users must carry.

The man who invented the matrix

Origins · 1 minArthur Cayley and how this was discovered
AC
Arthur Cayley
1821–1895 · Cambridge

The algebra this article teaches — arrays composed by row-times-column, an identity, inverses, the warning that products depend on order — was invented as pure mathematics in 1858, sixty-seven years before physics needed it. Cayley's Memoir on the Theory of Matrices took the rectangular arrays that had lurked inside systems of equations and made them algebraic citizens: he defined their addition, their multiplication (chosen precisely so that composing two linear substitutions is multiplying their arrays — this article's equation for (A^B^)mn(\hat A\hat B)_{mn}, verbatim), exhibited the failure of commutativity as a feature rather than a defect, and proved the theorem still bearing his name (Cayley–Hamilton: every matrix satisfies its own characteristic polynomial — the germ of "functions of operators"). He did much of this while practising law — fourteen years at the bar, some 250 papers on the side — before Cambridge's Sadleirian chair let him take a pay cut for full-time mathematics. When Heisenberg's 1925 arrays baffled physicists, Born recognized them as Cayley's algebra; the joke that quantum mechanics was discovered by a barrister has a kernel of truth. Every operator you will ever exponentiate composes by his rule.

History
1858
— Cayley's Memoir makes matrices an algebra: composition as multiplication, non-commutativity included
1925
— Heisenberg's Umdeutung paper: physical quantities as arrays with a strange multiplication
1925
— Born and Jordan name the multiplication (matrices) and write pq − qp = ħ/i — operators enter physics
1925
— Born, Heisenberg, Jordan: the three-man paper builds the complete matrix mechanics
1926
— Schrödinger proves wave and matrix mechanics equivalent: differential operators = infinite matrices
1927
— Jordan and Dirac's transformation theory: one operator calculus, any basis
1929
— von Neumann begins the rigorous theory of unbounded operators — the fine print gets its mathematics

Going further

References. Sakurai & Napolitano, Modern Quantum Mechanics, 2nd ed., §1.2–1.5 · Shankar, Principles of Quantum Mechanics, 2nd ed., Ch. 1 · Griffiths & Schroeter, Introduction to Quantum Mechanics, 3rd ed., Ch. 3 & Appendix A · Cohen-Tannoudji, Diu & Laloë, Quantum Mechanics, Vol. I, Ch. II · Born & Jordan, Z. Phys. 34, 858 (1925).

Provenance. All equations are standard textbook results. A verifier should: (1) recompute [x^,p^]=iℏ[\hat{x},\hat{p}]=i\hbar via p^=−iℏ∂x\hat{p}=-i\hbar\partial_x acting on a test function (Griffiths §2.1); (2) verify the reality/orthogonality proof for Hermitian operators (Griffiths §3.3, Sakurai §1.3); (3) confirm unitarity ⇔\Leftrightarrow Hermitian generator and the time-evolution operator e−iH^t/ℏe^{-i\hat H t/\hbar} (Sakurai §2.1); (4) check the matrix-composition and trace identities. For this edition, items (1) and (4) — the strata this article owns — were machine-verified (sympy/numpy/scipy): linearity of x^\hat x and ∂x\partial_x on explicit combinations, antilinearity of conjugation, [x,∂x]f=−f[x, \partial_x]f = -f and [x^,p^]f=iℏf[\hat x,\hat p]f = i\hbar f on test functions, the full ISW x^\hat x-matrix (diagonal 12\tfrac12; checkerboard zeros; −8mn/π2(m2−n2)2-8mn/\pi^2(m^2{-}n^2)^2 law; 2×22{\times}2 truncation eigenvalues 0.320/0.6800.320/0.680), composition associativity, (AB)−1=B−1A−1(AB)^{-1} = B^{-1}A^{-1}, cyclic trace, eσxeσz≠eσx+σze^{\sigma_x}e^{\sigma_z} \ne e^{\sigma_x+\sigma_z} with the commuting control case, and unboundedness ∥p^ψn∥=nπ\|\hat p\psi_n\| = n\pi. Items (2) and (3) are executed by their owners per the chapter map — Hermitian Operators and Observables (next) and Unitary Operators and Transformations — as is the adjoint's definition (Hermitian Conjugate and Adjoint Operators) and the commutation relation's postulate status (Canonical Commutation Relation).

Builds on: Hilbert Space and State Vectors · Dirac Bra-Ket Notation · Inner Product and Norm of States

Leads to: Hermitian Operators and Observables · Eigenvalues and Eigenstates · Completeness Relation and Resolution of Identity · Projection Operators · The Postulates of Quantum Mechanics

Is every physical process represented by a linear operator?

Every closed-system process, yes — evolution, symmetries, and (as building blocks) measurements are linear or antilinear; Wigner's theorem proves the dichotomy is forced by probability conservation. Apparent exceptions are bookkeeping: measurement update is nonlinear only through post-hoc renormalization; Gross–Pitaevskii-type equations are mean-field approximations of a linear many-body theory. Fundamental nonlinearity has been hunted (it would enable superluminal signalling in most formulations) and never found.

How do I actually compute a function of an operator, like √ or e^Â?

Two reliable routes. If A^\hat A is diagonalizable — the generic case, formalized next article — apply the function to the eigenvalues: f(A^)=∑nf(an)∣an⟩⟨an∣f(\hat A) = \sum_n f(a_n)|a_n\rangle\langle a_n|; this defines A^\sqrt{\hat A}, ln⁡A^\ln\hat A, everything, at the cost of one diagonalization. Otherwise the power series (equation 4) when it converges, or matrix routines (`expm`) implementing these definitions. The forbidden move: applying ff entry-by-entry to the matrix — that is not any operator function at all.

Why does the same operator look completely different in different bases?

Because the matrix is a shadow of the operator, cast by a basis. Change basis and the array transforms as A′=S−1ASA' = S^{-1}AS — different entries, same machine. Invariants of the operator are the quantities all shadows share: the spectrum, the trace, the determinant, commutation relations. Physics lives in the invariants; convenience lives in the basis choice (x^\hat x is diagonal in the position representation, p^\hat p in the momentum representation, and Fourier transformation is exactly the SS between them — the representation articles later this chapter make this precise).

What exactly goes wrong with unbounded operators — and will it bite me in practice?

Three things, all with the same root (no uniform stretch limit): they cannot be defined on every state (apply p^\hat p to a kinked function and the result leaves L2L^2 — the tent state's infinite ⟨H^2⟩\langle\hat H^2\rangle from the Hilbert-space article is this in the wild); limits and derivatives of operator expressions need care; and "Hermitian" splits into inequivalent notions (symmetric vs self-adjoint) that differ by domain bookkeeping — the next article flags where. In practice: on smooth, decaying states everything naive is correct, and that is where physics computations live. The bite comes at boundaries (half-line problems, singular potentials), where choosing a domain is choosing physics — boundary conditions are secretly self-adjointness decisions.

Heisenberg had matrices and no waves; Schrödinger waves and no matrices. Who was right?

Both — the equivalence is equation (2) historically enacted. A differential operator on L2L^2 is an infinite matrix once you pick a basis (Schrödinger's 1926 equivalence paper computes exactly such elements); Heisenberg's arrays act on sequence-space — the same Hilbert space in other coordinates. "Matrix vs wave mechanics" dissolved into "two bases of one operator calculus" by 1927.

Do operators for different particles or different observables always commute?

Operators acting on different tensor factors (particle 1's position, particle 2's spin) always commute — they touch different parts of the state. Operators on the same system commute or not case by case: x^\hat x and p^\hat p never (iℏi\hbar, equation 3), the three spin components pairwise don't, H^\hat H and symmetry operators do when the symmetry holds (the parity article's [H^,Π^]=0[\hat H,\hat\Pi] = 0). The full doctrine — commuting ⟺ simultaneously diagonalizable ⟺ compatible measurements — is exactly the payload of The Commutator and Compatible Observables, later this chapter.

Before this

Where this leads