Fredholm Theory and Fredholm Alternative

A linear integral equation of the second kind, ϕ(x)=f(x)+λ∫abK(x,y)ϕ(y) dy\phi(x)=f(x)+\lambda\int_a^b K(x,y)\phi(y)\,\mathrm{d}y, looks like nothing so much as an infinite-dimensional version of (I−λK)ϕ=f(I-\lambda K)\phi=f. Ivar Fredholm's achievement, in a single 1903 paper, was to make that analogy literal. Slice the interval into nn points and the integral becomes a Riemann sum, the equation an honest n×nn\times n linear system whose determinant and Cramer's-rule cofactors he wrote down explicitly. The miracle is that as n→∞n\to\infty these finite formulae do not blow up: the mesh factors hnh^n organize into convergent power series, and the discrete determinant converges to an entire function of λ\lambda — the Fredholm determinant D(λ)D(\lambda), flanked by the first minor D(x,y;λ)D(x,y;\lambda). The payoff is a complete solvability theory in closed form. Whenever D(λ)≠0D(\lambda)\neq0 the operator I−λKI-\lambda K is invertible and ϕ=f+λR^f\phi=f+\lambda\hat R f, where the resolvent kernel R=D(x,y;λ)/D(λ)R=D(x,y;\lambda)/D(\lambda) is meromorphic with poles exactly at the zeros of DD. Those zeros — the characteristic values — are the reciprocals of the eigenvalues of the compact operator KK, and compactness forces them to march off to infinity, never accumulating anywhere but at the origin. The Fredholm alternative governs the borderline. At a characteristic value the resolvent develops a pole and existence can fail, but never wildly: the failure is a finite-dimensional obstruction. The homogeneous equation and its adjoint have null spaces of equal finite dimension, and the forced problem is solvable if and only if the source is orthogonal to every adjoint zero mode. This is the analytic reincarnation of the rank–nullity theorem, the reason a resonantly driven oscillator can or cannot be driven, and the seed from which Fredholm index theory grows all the way to Atiyah–Singer.

Key takeaways
  • Fredholm theory solves ϕ=f+λK^ϕ\phi=f+\lambda\hat K\phi by building the resolvent as a ratio of two entire functions of λ\lambda — the Fredholm determinant D(λ)D(\lambda) and the first minor D(x,y;λ)D(x,y;\lambda).
  • D(λ)=det⁡(I−λK)=exp⁡ ⁣(−∑n≥1λnntr⁡Kn)D(\lambda)=\det(I-\lambda K)=\exp\!\big(-\sum_{n\ge1}\tfrac{\lambda^n}{n}\operatorname{tr}K^n\big) is entire for continuous or Hilbert–Schmidt kernels; its zeros are the reciprocal eigenvalues of KK and can only run off to infinity.
  • When D(λ)≠0D(\lambda)\neq0 the solution is unique, ϕ=f+λ∫abR(x,y;λ)f dy\phi=f+\lambda\int_a^b R(x,y;\lambda)f\,\mathrm{d}y with R=D(x,y;λ)/D(λ)R=D(x,y;\lambda)/D(\lambda).
  • The Fredholm alternative is a strict dichotomy: either I−λKI-\lambda K is injective (hence surjective, uniquely solvable for every ff), or it has a nontrivial kernel (then solvability needs f⊥ker⁡(I−λK†)f\perp\ker(I-\lambda K^\dagger) and the solution is non-unique).
  • For any compact KK the index dim⁡ker⁡(I−λK)−dim⁡coker⁡(I−λK)=0\dim\ker(I-\lambda K)-\dim\operatorname{coker}(I-\lambda K)=0 — why injectivity and surjectivity stand or fall together.
  • The same machinery yields Green's functions, resonance conditions in perturbation theory, and — via D=∏(1−λ/λn)D=\prod(1-\lambda/\lambda_n) — the functional determinants of one-loop QFT and the Tracy–Widom law of random matrices.
  • Key idea: encode an integral operator's solvability into two entire functions of λ — the Fredholm determinant D(λ) and minor D(x,y;λ) — so that uniqueness fails precisely at the zeros of D, where a finite-dimensional orthogonality test, the Fredholm alternative, decides existence.
The core insight

Encode an integral operator's solvability into two entire functions of λ\lambda — the Fredholm determinant D(λ)D(\lambda) and minor D(x,y;λ)D(x,y;\lambda) — so that uniqueness fails precisely at the zeros of DD, where a finite-dimensional orthogonality test, the Fredholm alternative, decides existence.

Where this lives today

Fredholm's determinant is not a historical curiosity but the working engine of some of the most active mathematical physics of the last thirty years. Its most spectacular modern home is random matrix theory: the probability that a large Gaussian random matrix has no eigenvalue above a threshold is a Fredholm determinant of the Airy kernel, and its value is the Tracy–Widom distribution — the universal law for the largest eigenvalue of the GUE, the longest increasing subsequence of a random permutation, and the fluctuating height of a growing interface in the Kardar–Parisi–Zhang class. That last link is experimental: Takeuchi and Sano's 2010 measurements of turbulent liquid-crystal fronts reproduced the Tracy–Widom curve precisely, so a Fredholm determinant is now readable off a laboratory histogram. The same object controls gap probabilities in integrable systems. In QFT, one-loop effective actions are functional determinants det⁡(−∂2+m2+V)\det(-\partial^2+m^2+V) that, written as I+KI+K and evaluated by Gel'fand–Yaglom or ζ\zeta-regularization, are Fredholm determinants in disguise — the descendant of D(λ)=∏(1−λ/λn)D(\lambda)=\prod(1-\lambda/\lambda_n). And in numerical analysis the boundary-element and Nyström methods for scattering, acoustics, and electrostatics are direct discretizations of a second-kind Fredholm equation, their convergence guaranteed by the 1903 theorems and their conditioning set by proximity to a characteristic value.

The physical picture

Think of ∫abK(x,y)ϕ(y) dy\int_a^b K(x,y)\phi(y)\,\mathrm{d}y as an infinite matrix acting on the vector ϕ\phi. Chop [a,b][a,b] into nn nodes spaced by h=(b−a)/nh=(b-a)/n, and the equation becomes an honest linear system (I−λhKij)ϕj=fi(I-\lambda h K_{ij})\phi_j=f_i. Solve it by Cramer's rule and let n→∞n\to\infty: the determinant and its cofactors converge, term by term, to the Fredholm determinant and minor. What could have been a hopeless divergence of ever-larger matrices is tamed because the many small factors of hh conspire into a rapidly convergent series — Fredholm's original and still most concrete route into the theory. The first figure makes the passage from operator to matrix literal.

Figure
Discretizing the interval turns the integral equation φ = f + λ∫Kφ into the matrix system (I − λhK)φ = f with mesh h = (b−a)/n; as n → ∞ the determinant det(I − λhK) converges to the entire Fredholm determinant D(λ), and for compact K the operator I − λK is injective exactly when it is surjective
From an integral operator to a matrix, and back to an entire function φ(x) = f(x) + λ∫ K(x,y) φ(y) dy K(x,y) continuous kernel x y discretize h = (b−a)/n (I − λhK) φ = f n → ∞ det(I − λhK) ↓ D(λ) entire D(λ) = Σₙ (−λ)ⁿ/n! ∫···∫ det[K(tᵢ,tⱼ)] dⁿt — convergent for every λ Fredholm alternative: I − λK injective ⟺ surjective (index = 0)

The alternative says that for a compact KK the operator I−λKI-\lambda K behaves exactly like a finite matrix: injective if and only if surjective. So either you can always solve, uniquely, or you cannot always solve and, when you can, the answer is non-unique — there is no third case of "injective but not surjective," the pathology that plagues genuinely infinite-dimensional operators. Geometrically the range is closed and equals ker⁡(I−λK†)⊥\ker(I-\lambda K^\dagger)^{\perp}: the source ff must avoid the "forbidden directions" picked out by the adjoint zero modes, exactly as an undamped oscillator refuses to be driven on resonance. The second figure shows the analytic skeleton — the Fredholm determinant of an actual kernel, its zeros lined up as characteristic values running to infinity.

Figure
The Fredholm determinant of the Green kernel K(x,y) = min(x,y) on the unit interval is exactly D(λ) = cos√λ, an entire function whose zeros are the characteristic values λₙ = (n−½)²π² ≈ 2.47, 22.2, 61.7 — the reciprocals of the eigenvalues of K̂ and the resonances where the resolvent R = D(x,y;λ)/D(λ) blows up
A real Fredholm determinant: D(λ) = cos√λ for the kernel min(x,y), zeros at the characteristic values +1 0 −1 D(λ) λ λ₁ = π²/4 ≈ 2.47 λ₂ = 9π²/4 ≈ 22.2 λ₃ = 25π²/4 ≈ 61.7 D(0) = 1 zeros march off to ∞: μₙ = 1/λₙ → 0

Because the eigenvalues μn\mu_n accumulate only at zero, the characteristic values λn=1/μn\lambda_n=1/\mu_n run to infinity, so DD has only finitely many isolated zeros in any bounded region — which is why a compact operator never grows a continuous spectrum away from the origin. Every qualitative feature is already visible in cos⁡λ\cos\sqrt\lambda: entire, real zeros spaced ever farther apart, and D(0)=1D(0)=1.

The core equations

The object being solved is the Fredholm equation of the second kind: the unknown appears both outside the integral and inside it. That "unknown outside as well as inside" is what makes the operator I−λK^I-\lambda\hat K rather than the ill-posed K^\hat K, and it is the entire reason the clean theory below exists.

ϕ(x)=f(x)+λ∫abK(x,y) ϕ(y) dy(1)\phi(x)=f(x)+\lambda\int_a^b K(x,y)\,\phi(y)\,\mathrm{d}y \qquad (1)

where: ϕ\phi — unknown to be found; ff — given source term; K(x,y)K(x,y) — kernel of the operator K^\hat K; λ\lambda — complex coupling (spectral) parameter; [a,b][a,b] — interval, possibly a region of Rd\mathbb{R}^d. Read it as (I−λK^)ϕ=f(I-\lambda\hat K)\phi=f, the infinite-dimensional cousin of a matrix equation. The Fredholm determinant is the continuum limit of det⁡(I−λKn)\det(I-\lambda K_n): a power series whose nn-th coefficient is an nn-fold integral of an n×nn\times n determinant built from the kernel — and it converges for every λ\lambda.

D(λ)=∑n=0∞(−λ)nn!∫ab ⁣ ⁣⋯ ⁣∫abK ⁣(t1⋯tnt1⋯tn)dt1⋯dtn(2)D(\lambda)=\sum_{n=0}^{\infty}\frac{(-\lambda)^n}{n!}\int_a^b\!\!\cdots\!\int_a^b K\!\begin{pmatrix}t_1&\cdots&t_n\\ t_1&\cdots&t_n\end{pmatrix}\mathrm{d}t_1\cdots\mathrm{d}t_n \qquad (2)

where: D(λ)D(\lambda) — Fredholm determinant, entire in λ\lambda; K(t1⋯tnt1⋯tn)K\binom{t_1\cdots t_n}{t_1\cdots t_n} — the n×nn\times n determinant det⁡[K(ti,tj)]\det[K(t_i,t_j)]; the 1/n!1/n! removes overcounting of unordered variables. Read it as det⁡(I−λK^)\det(I-\lambda\hat K) written as a sum over nn-point minors. Through det⁡=exp⁡tr⁡log⁡\det=\exp\operatorname{tr}\log the same determinant is the exponential of a sum of traces of iterated kernels — the Plemelj–Smithies form, the workhorse for computation.

D(λ)=exp⁡ ⁣(−∑n=1∞λnn tr⁡Kn),tr⁡Kn=∫ ⁣ ⁣⋯ ⁣∫K(t1,t2)⋯K(tn,t1) dt1⋯dtn(3)D(\lambda)=\exp\!\left(-\sum_{n=1}^{\infty}\frac{\lambda^n}{n}\,\operatorname{tr}K^n\right),\qquad \operatorname{tr}K^n=\int\!\!\cdots\!\int K(t_1,t_2)\cdots K(t_n,t_1)\,\mathrm{d}t_1\cdots\mathrm{d}t_n \qquad (3)

where: tr⁡Kn\operatorname{tr}K^n — trace of the nn-th iterated kernel, the continuum version of ∑iμin\sum_i\mu_i^n. Read it as log⁡D=tr⁡log⁡(I−λK)\log D=\operatorname{tr}\log(I-\lambda K), so D=∏i(1−λμi)D=\prod_i(1-\lambda\mu_i) once eigenvalues are exposed. To recover the solution one needs the first Fredholm minor — the bordered determinant with an extra row and column at (x,y)(x,y) — whose ratio to DD is the resolvent kernel.

D(x,y;λ)=∑n=0∞(−λ)nn!∫ab ⁣ ⁣⋯ ⁣∫abK ⁣(xt1⋯tnyt1⋯tn)dt1⋯dtn,R(x,y;λ)=D(x,y;λ)D(λ)(4)D(x,y;\lambda)=\sum_{n=0}^{\infty}\frac{(-\lambda)^n}{n!}\int_a^b\!\!\cdots\!\int_a^b K\!\begin{pmatrix}x&t_1&\cdots&t_n\\ y&t_1&\cdots&t_n\end{pmatrix}\mathrm{d}t_1\cdots\mathrm{d}t_n,\qquad R(x,y;\lambda)=\frac{D(x,y;\lambda)}{D(\lambda)} \qquad (4)

where: D(x,y;λ)D(x,y;\lambda) — first minor, entire in λ\lambda; RR — resolvent kernel, a ratio of two entire functions and hence meromorphic, with poles only at the zeros of DD. Read it as the analytic form of (I−λK)−1=I+λR^(I-\lambda K)^{-1}=I+\lambda\hat R. With the resolvent in hand the solution is explicit whenever D≠0D\neq0 — a closed-form inverse, not just an existence claim.

ϕ(x)=f(x)+λ∫abR(x,y;λ) f(y) dy(D(λ)≠0)(5)\phi(x)=f(x)+\lambda\int_a^b R(x,y;\lambda)\,f(y)\,\mathrm{d}y \qquad\bigl(D(\lambda)\neq0\bigr) \qquad (5)

where: RR — the resolvent kernel of (4). Read it as: apply I+λR^I+\lambda\hat R to ff; away from characteristic values the solution exists, is unique, and depends continuously on ff. Since DD is entire of order ≤12\le\tfrac12 for Hilbert–Schmidt kernels, Hadamard factorization writes it as a product over its zeros, the characteristic values.

D(λ)=∏n(1−λλn),λn=1μn,μn→0(6)D(\lambda)=\prod_{n}\left(1-\frac{\lambda}{\lambda_n}\right),\qquad \lambda_n=\frac{1}{\mu_n},\qquad \mu_n\to0 \qquad (6)

where: λn\lambda_n — characteristic values (zeros of DD); μn\mu_n — eigenvalues of K^\hat K, accumulating only at 00. Read it as: DD is nothing but its zeros, which run to infinity because the eigenvalues shrink to nothing. At a zero of DD the theory hands over to the Fredholm alternative — a sharp dichotomy plus an orthogonality test.

I−λK injective  ⟺  I−λK surjective⏟dichotomy,ran⁡(I−λK)=ker⁡(I−λK†)⊥(7)\underbrace{I-\lambda K \text{ injective}\iff I-\lambda K \text{ surjective}}_{\text{dichotomy}},\qquad \operatorname{ran}(I-\lambda K)=\ker(I-\lambda K^\dagger)^{\perp} \qquad (7)

where: K†K^\dagger — adjoint kernel K(y,x)‾\overline{K(y,x)}; the range is closed and equals the orthogonal complement of the adjoint null space. Read it as: solvable exactly when ⟨ψk,f⟩=0\langle\psi_k,f\rangle=0 for every solution ψk\psi_k of the adjoint problem ψ=λˉK†ψ\psi=\bar\lambda K^\dagger\psi. The whole dichotomy collapses to one number — the Fredholm index — which is zero for every compact perturbation of the identity.

ind⁡(I−λK)=dim⁡ker⁡(I−λK)−dim⁡coker⁡(I−λK)=0(8)\operatorname{ind}(I-\lambda K)=\dim\ker(I-\lambda K)-\dim\operatorname{coker}(I-\lambda K)=0 \qquad (8)

where: ind⁡\operatorname{ind} — Fredholm index; coker⁡=H/ran⁡\operatorname{coker}=H/\operatorname{ran}. Read it as: kernel and cokernel have equal finite dimension, so injectivity and surjectivity stand or fall together — the analytic rank–nullity theorem.

Derivation ABuilding the Fredholm determinant from a discretized matrix

The goal is to earn equation (2) rather than quote it: start from the finite-dimensional determinant of the discretized operator, expand it over principal minors, and watch the Riemann sums become integrals so that the discrete det⁡(I−λhK)\det(I-\lambda h K) passes into the entire series for D(λ)D(\lambda) — seeing on the way why the 1/n!1/n! appears and why the series converges for every λ\lambda despite the matrices growing without bound.

Step 1. Discretize. Put nn nodes xix_i on [a,b][a,b] spaced by h=(b−a)/nh=(b-a)/n and approximate the integral by h∑jK(xi,xj)ϕjh\sum_j K(x_i,x_j)\phi_j, so (1) becomes (I−λhKij)ϕj=fi(I-\lambda h K_{ij})\phi_j=f_i with Kij=K(xi,xj)K_{ij}=K(x_i,x_j); each off-diagonal entry carries one factor λh\lambda h. Why: the integral operator is the h→0h\to0 limit of a matrix, so we begin with something we can genuinely take a determinant of.

Step 2. Expand over principal minors: det⁡(I−λhK)=∑m≥0(−λ)mm!∑i1⋯imhmdet⁡[K(xia,xib)]\det(I-\lambda h K)=\sum_{m\ge0}\tfrac{(-\lambda)^m}{m!}\sum_{i_1\cdots i_m}h^m\det[K(x_{i_a},x_{i_b})], the inner sum over all mm-tuples of nodes and the 1/m!1/m! correcting for counting each unordered set m!m! times. Why: the order-mm coefficient of det⁡(I−λhK)\det(I-\lambda hK) is the sum of all m×mm\times m principal minors — the birthplace of the nn-fold determinant in (2).

Step 3. Continuum limit. Each hm∑i1⋯imh^m\sum_{i_1\cdots i_m} is a Riemann sum, so hm∑i1⋯imdet⁡[K(xia,xib)]→∫ ⁣⋯ ⁣∫det⁡[K(ta,tb)] dt1⋯dtmh^m\sum_{i_1\cdots i_m}\det[K(x_{i_a},x_{i_b})]\to\int\!\cdots\!\int\det[K(t_a,t_b)]\,\mathrm{d}t_1\cdots\mathrm{d}t_m, and all orders together reproduce (2). Why: this is what "det⁡(I−λK)\det(I-\lambda K)" of an integral operator actually means — a limit of genuine matrix determinants, not an analogy.

Step 4. Convergence everywhere. Hadamard's inequality bounds the m×mm\times m minor of a kernel with ∣K∣≤M|K|\le M by Mmmm/2(b−a)mM^m m^{m/2}(b-a)^m, so the mm-th term of (2) is ≤∣λ∣mm!Mmmm/2(b−a)m\le\tfrac{|\lambda|^m}{m!}M^m m^{m/2}(b-a)^m; Stirling makes mm/2/m!m^{m/2}/m! decay faster than any geometric series, so the sum is entire. Why: Fredholm's decisive point — the 1/m!1/m! beats the mm/2m^{m/2} growth of the minors, rescuing a determinant a naive limit would destroy. *Verified: matches the construction in Smithies ch. 5 and Arfken–Weber–Harris ch. 21; the Hadamard bound gives order ≤12\le\tfrac12 for Hilbert–Schmidt kernels.*

Go deeper · Derivation B · 1 minThe determinant as the exponential of traces
Derivation BThe determinant as the exponential of traces

The goal is to derive the Plemelj–Smithies form (3) from the matrix identity det⁡=exp⁡tr⁡log⁡\det=\exp\operatorname{tr}\log, exposing along the way why the zeros of DD sit at the reciprocal eigenvalues and why DD is entire even though the trace series defining its logarithm converges only in a finite disk. This is the identity every practical evaluation of a Fredholm determinant actually uses.

Step 1. Start from det⁡M=exp⁡tr⁡log⁡M\det M=\exp\operatorname{tr}\log M, valid whenever the eigenvalues of MM avoid the negative real axis; take M=I−λKnM=I-\lambda K_n with ∣λ∣|\lambda| small enough that each 1−λμi1-\lambda\mu_i stays near 11. Why: at small coupling the operator is a small perturbation of the identity, so its logarithm is unambiguous and the identity applies.

Step 2. Expand: log⁡(I−λK)=−∑n≥1(λK)n/n\log(I-\lambda K)=-\sum_{n\ge1}(\lambda K)^n/n, and take the trace to get tr⁡log⁡(I−λK)=−∑n≥1λnntr⁡Kn\operatorname{tr}\log(I-\lambda K)=-\sum_{n\ge1}\tfrac{\lambda^n}{n}\operatorname{tr}K^n, convergent for ∣λ∣<1/r(K)|\lambda|<1/r(K) with r(K)r(K) the spectral radius. Why: the trace passes inside the convergent operator series, turning a matrix logarithm into a scalar series in the traces of iterated kernels.

Step 3. Identify each trace as tr⁡Kn=∫ ⁣⋯ ⁣∫K(t1,t2)⋯K(tn,t1) dnt\operatorname{tr}K^n=\int\!\cdots\!\int K(t_1,t_2)\cdots K(t_n,t_1)\,\mathrm{d}^n t, the nn-fold composition of K^\hat K, finite for any trace-class (e.g. continuous) kernel. Why: this is the object that survives discretization and makes the abstract tr⁡Kn\operatorname{tr}K^n a concrete integral you can evaluate.

Step 4. Continue past the disk. Although the trace series has radius 1/r(K)1/r(K), its exponential DD is entire: the logarithm has isolated singularities log⁡(1−λ/λn)\log(1-\lambda/\lambda_n) at λn=1/μn\lambda_n=1/\mu_n, and exponentiating them makes honest simple zeros, reproducing D=∏(1−λ/λn)D=\prod(1-\lambda/\lambda_n). Why: this resolves the overview's paradox — DD is entire, but only once the divergence of the trace series is repackaged as the zeros of an entire function. *Verified: reproduces the Plemelj–Smithies formula in Smithies ch. 5; for K=x+yK=x+y on [0,1][0,1], tr⁡K=1\operatorname{tr}K=1 and tr⁡K2=7/6\operatorname{tr}K^2=7/6 give log⁡D=−λ−712λ2−⋯\log D=-\lambda-\tfrac{7}{12}\lambda^2-\cdots, matching log⁡(1−λ−112λ2)\log(1-\lambda-\tfrac1{12}\lambda^2) term by term.*

Go deeper · Derivation C · 1 minThe alternative from a degenerate kernel
Derivation CThe alternative from a degenerate kernel

The goal is to strip the Fredholm alternative down to finite-dimensional linear algebra by taking a separable (degenerate) kernel, so that the integral equation becomes an N×NN\times N matrix equation and the dichotomy — unique solution when the determinant is nonzero, orthogonality condition when it vanishes — becomes literally Cramer's rule and the finite rank–nullity theorem. Since any continuous kernel is a uniform limit of degenerate ones, this special case carries the general truth.

Step 1. Insert K(x,y)=∑k=1Nak(x) bk(y)K(x,y)=\sum_{k=1}^N a_k(x)\,b_k(y) into (1). The integral sees ϕ\phi only through the NN numbers ck=∫abbkϕc_k=\int_a^b b_k\phi, so ϕ(x)=f(x)+λ∑kak(x) ck\phi(x)=f(x)+\lambda\sum_k a_k(x)\,c_k — the function is fixed once the vector cc is. Why: a rank-NN operator probes only an NN-dimensional slice of ϕ\phi, collapsing the problem to NN dimensions exactly.

Step 2. Project onto the bjb_j: multiply by bjb_j and integrate to get cj=gj+λ∑kAjkckc_j=g_j+\lambda\sum_k A_{jk}c_k, with Ajk=∫bjakA_{jk}=\int b_j a_k and gj=∫bjfg_j=\int b_j f, i.e. (I−λA) c=g(I-\lambda A)\,c=g. Why: the integral equation has become a finite linear system, and all of solvability is read off the single matrix I−λAI-\lambda A.

Step 3. Nondegenerate case: if det⁡(I−λA)≠0\det(I-\lambda A)\neq0, Cramer's rule fixes cc and hence ϕ\phi uniquely; the characteristic values are the roots of the degree-≤N\le N polynomial det⁡(I−λA)\det(I-\lambda A) — precisely the zeros of D(λ)D(\lambda) for this kernel. Why: the "either" branch — away from finitely many roots the operator is invertible.

Step 4. Degenerate case: at a root I−λAI-\lambda A has an mm-dimensional kernel, and (I−λA)c=g(I-\lambda A)c=g is solvable iff g∈ker⁡(I−λA†)⊥g\in\ker(I-\lambda A^\dagger)^{\perp}; translating back gives ⟨ψk,f⟩=0\langle\psi_k,f\rangle=0 for every adjoint zero mode, with the solution then non-unique. Why: the "or" branch is nothing more exotic than rank–nullity for the matrix AA; N→∞N\to\infty carries it to any compact KK. *Verified: matches the degenerate-kernel treatment in Arfken–Weber–Harris ch. 21 and Riley–Hobson–Bence ch. 23; the worked example K=x+yK=x+y below realizes every step numerically.*

Limiting cases

The theory's behaviour turns sharply on the class of kernel and the kind of equation:

CaseResultMeaning
Degenerate (separable) kernelK=∑k=1Nak(x)bk(y)K=\sum_{k=1}^N a_k(x)b_k(y)Collapses to an exact N×NN\times N system; D(λ)D(\lambda) is a polynomial of degree ≤N\le N and the alternative is finite-dimensional linear algebra.
Volterra kernelK(x,y)=0K(x,y)=0 for y>xy>xEvery iterated trace vanishes, so D(λ)≡1D(\lambda)\equiv1: no characteristic values, entire resolvent, unique solution for every λ\lambda.
Symmetric Hilbert–SchmidtK=K(y,x)‾, ∬∣K∣2<∞K=\overline{K(y,x)},\ \iint|K|^2<\inftyReal eigenvalues, complete orthonormal eigenbasis; D(λ)=∏n(1−λ/λn)D(\lambda)=\prod_n(1-\lambda/\lambda_n) with ∑λn−2<∞\sum\lambda_n^{-2}<\infty.
Small coupling λ→0\lambda\to0R=K+λK(2)+O(λ2)R=K+\lambda K^{(2)}+O(\lambda^2)The Neumann (Liouville) series converges; the resolvent is analytic at the origin.
First-kind equation∫abK(x,y)ϕ(y) dy=f(x)\int_a^b K(x,y)\phi(y)\,\mathrm{d}y=f(x)Compactness makes K−1K^{-1} unbounded: ill-posed, the alternative fails, regularization (Tikhonov) needed.

Worked examples

1 · A rank-one kernel, solved end to end (confidence builder)

Solve ϕ(x)=x+λ∫01xy ϕ(y) dy\phi(x)=x+\lambda\int_0^1 xy\,\phi(y)\,\mathrm{d}y for all λ\lambda, find the characteristic value, and show what happens there.

Step 1. The kernel K(x,y)=xyK(x,y)=xy is rank one, so only the first trace survives: tr⁡K=∫01t2 dt=13\operatorname{tr}K=\int_0^1 t^2\,\mathrm{d}t=\tfrac13, and every higher minor vanishes. Hence the Fredholm determinant truncates to a single term, \boldsymbol{D(\lambda)=1-\tfrac{\lambda}{3}}, with its one characteristic value at λ1=3\lambda_1=3 (equivalently μ1=13\mu_1=\tfrac13, the sole nonzero eigenvalue of K^\hat K).

Step 2. For a rank-one kernel the resolvent is R(x,y;λ)=xy1−λ/3R(x,y;\lambda)=\dfrac{xy}{1-\lambda/3}. The solution follows from equation (5): ϕ(x)=x+λ∫01xy1−λ/3 y dy=x+λx1−λ/3⋅13\phi(x)=x+\lambda\displaystyle\int_0^1\frac{xy}{1-\lambda/3}\,y\,\mathrm{d}y=x+\frac{\lambda x}{1-\lambda/3}\cdot\frac13, and collecting terms gives \boldsymbol{\phi(x)=\dfrac{x}{1-\lambda/3}}.

Step 3. Sanity check at λ=1\lambda=1: ϕ(x)=x/(1−13)=32x\phi(x)=x/(1-\tfrac13)=\tfrac32 x. Substitute back: x+∫01xy (32y) dy=x+32x⋅13=x+12x=32xx+\int_0^1 xy\,(\tfrac32 y)\,\mathrm{d}y=x+\tfrac32 x\cdot\tfrac13=x+\tfrac12 x=\tfrac32 x. The resolvent solution reproduces itself exactly.

Step 4. At λ=3\lambda=3 the determinant vanishes and the resolvent blows up — a resonance. The homogeneous equation is solved by ϕ0(x)=x\phi_0(x)=x; the kernel is symmetric so the adjoint zero mode is also xx, and the alternative demands ⟨x,f⟩=0\langle x,f\rangle=0. But f(x)=xf(x)=x gives ∫01x2 dx=13≠0\int_0^1 x^2\,\mathrm{d}x=\tfrac13\neq0, so at λ=3\lambda=3 the equation has no solution at all — the source is aligned with the forbidden direction, like driving an oscillator dead on resonance.

2 · A degenerate rank-two kernel (fully numeric)

For K(x,y)=x+yK(x,y)=x+y on [0,1][0,1], build the Fredholm determinant, locate the characteristic values, and solve ϕ(x)=1+∫01(x+y)ϕ(y) dy\phi(x)=1+\int_0^1(x+y)\phi(y)\,\mathrm{d}y (that is, at λ=1\lambda=1).

Step 1. Write K=x⋅1+1⋅yK=x\cdot1+1\cdot y, so a1=x,b1=1,a2=1,b2=ya_1=x,b_1=1,a_2=1,b_2=y and the projection matrix Ajk=∫01bjakA_{jk}=\int_0^1 b_j a_k is A=(1211312)A=\begin{pmatrix}\tfrac12&1\\[2pt]\tfrac13&\tfrac12\end{pmatrix}, with tr⁡A=1\operatorname{tr}A=1 and det⁡A=14−13=−112\det A=\tfrac14-\tfrac13=-\tfrac1{12}.

Step 2. The Fredholm determinant of a rank-two kernel is the characteristic polynomial of AA: D(λ)=1−λtr⁡A+λ2det⁡A=D(\lambda)=1-\lambda\operatorname{tr}A+\lambda^2\det A=\boldsymbol{1-\lambda-\tfrac{\lambda^2}{12}}, whose roots λ2+12λ−12=0\lambda^2+12\lambda-12=0 give the characteristic values \boldsymbol{\lambda_\pm=-6\pm4\sqrt3} (≈0.93\approx0.93 and −12.93-12.93). Cross-check: tr⁡K2=∬(x+y)2=76\operatorname{tr}K^2=\iint(x+y)^2=\tfrac76, and the trace formula's λ2\lambda^2 term −12tr⁡K2−12(tr⁡K)2=−712-\tfrac12\operatorname{tr}K^2-\tfrac12(\operatorname{tr}K)^2=-\tfrac7{12} matches log⁡D\log D.

Step 3. At λ=1\lambda=1 the system (I−λA)c=g(I-\lambda A)c=g has I−A=(12−1−1312)I-A=\begin{pmatrix}\tfrac12&-1\\[2pt]-\tfrac13&\tfrac12\end{pmatrix}, det⁡(I−A)=−112=D(1)≠0\det(I-A)=-\tfrac1{12}=D(1)\neq0, so we are on the "unique solution" branch. With f=1f=1 the data are g1=∫011=1g_1=\int_0^1 1=1, g2=∫01y=12g_2=\int_0^1 y=\tfrac12.

Step 4. Invert: (I−A)−1=−12(1211312)=(−6−12−4−6)(I-A)^{-1}=-12\begin{pmatrix}\tfrac12&1\\[2pt]\tfrac13&\tfrac12\end{pmatrix}=\begin{pmatrix}-6&-12\\-4&-6\end{pmatrix}, giving c1=−6−6=−12c_1=-6-6=-12 and c2=−4−3=−7c_2=-4-3=-7. Reconstruct ϕ(x)=f+λ(a1c1+a2c2)=1+(−12x−7)\phi(x)=f+\lambda(a_1 c_1+a_2 c_2)=1+(-12x-7), so \boldsymbol{\phi(x)=-12x-6}.

Step 5. Verify: 1+∫01(x+y)(−12y−6) dy=1+[x(−6−6)+(−4−3)]=−12x−61+\int_0^1(x+y)(-12y-6)\,\mathrm{d}y=1+\big[x(-6-6)+(-4-3)\big]=-12x-6. The solution checks exactly — and had we sat at λ=λ+=−6+43\lambda=\lambda_+=-6+4\sqrt3 the determinant would vanish and existence would hinge on f⊥f\perp the adjoint zero mode.

3 · The Green kernel and a determinant you can name

Show that the Fredholm determinant of K(x,y)=min⁡(x,y)K(x,y)=\min(x,y) on [0,1][0,1] is D(λ)=cos⁡λD(\lambda)=\cos\sqrt\lambda, and read off the characteristic values plotted in the second figure.

Step 1. The kernel min⁡(x,y)\min(x,y) is the Green's function of −d2/dx2-\mathrm{d}^2/\mathrm{d}x^2 with u(0)=0, u′(1)=0u(0)=0,\ u'(1)=0, so applying K^\hat K inverts the second derivative under those conditions and the eigenvalue problem K^ϕ=μϕ\hat K\phi=\mu\phi becomes −ϕ′′=μ−1ϕ-\phi''=\mu^{-1}\phi with the same boundary conditions.

Step 2. Those conditions select ϕn(x)=sin⁡ ⁣((n−12)πx)\phi_n(x)=\sin\!\big((n-\tfrac12)\pi x\big) with −ϕn′′=(n−12)2π2ϕn-\phi_n''=(n-\tfrac12)^2\pi^2\phi_n, so μn=1/[(n−12)2π2]\mu_n=1/\big[(n-\tfrac12)^2\pi^2\big] and the characteristic values are λn=(n−12)2π2\lambda_n=(n-\tfrac12)^2\pi^2 — π2/4≈2.47\pi^2/4\approx2.47, 9π2/4≈22.29\pi^2/4\approx22.2, 25π2/4≈61.725\pi^2/4\approx61.7, marching to infinity exactly as compactness demands.

Step 3. Assemble the Hadamard product (6): D(λ)=∏n≥1(1−λ(n−1/2)2π2)D(\lambda)=\prod_{n\ge1}\big(1-\tfrac{\lambda}{(n-1/2)^2\pi^2}\big). This is precisely the cosine factorization cos⁡w=∏n≥1(1−w2(n−1/2)2π2)\cos w=\prod_{n\ge1}\big(1-\tfrac{w^2}{(n-1/2)^2\pi^2}\big), so with w=λw=\sqrt\lambda the closed form is \boldsymbol{D(\lambda)=\cos\sqrt\lambda} — entire (even in λ\sqrt\lambda, no branch cut), equal to 11 at λ=0\lambda=0, vanishing exactly at the λn\lambda_n.

Step 4. Every feature of the second figure follows. A resonantly forced −u′′-u'' at μ−1=λn\mu^{-1}=\lambda_n is solvable only if the source is orthogonal to sin⁡((n−12)πx)\sin((n-\tfrac12)\pi x) — the Fredholm alternative for this classic boundary-value problem.

Physics of the portrait

Fredholm theory runs in a lineage from Abel's tautochrone through Neumann's iterations to Hilbert's spectral theory, but its decisive step — the determinant that made an integral operator behave like a finite matrix — is the work of one Swedish mathematician who published remarkably little and changed the field permanently.

Origins · 1 minErik Ivar Fredholm and how this was discovered
EI
Erik Ivar Fredholm
1866–1927 · the theory of integral equations

Erik Ivar Fredholm was a Swedish mathematician — professor at Stockholm and for years an actuary at a state insurance office — whose reputation rests on an unusually small body of work, chief among it a single epoch-making paper. Building on Volterra's integral equations and the potential-theory problems of Neumann and Poincaré, he circulated a note in 1900 and then published "Sur une classe d'équations fonctionnelles" in Acta Mathematica in 1903. There he introduced the determinant D(λ)D(\lambda) and minor D(x,y;λ)D(x,y;\lambda) as explicit power series, proved them entire, and established the alternative now bearing his name: a second-kind integral equation is either uniquely solvable for every source or solvable only under finitely many orthogonality conditions. The feat was to treat an infinite-dimensional operator with finite linear algebra and have the answer converge. Hilbert seized on it at once, building from it between 1904 and 1910 the spectral theory of symmetric kernels — eigenvalues, eigenfunction expansions, and the Hilbert–Schmidt operator — which seeded the abstract Hilbert-space theory that Schmidt, Riesz, and von Neumann completed. Fredholm's index-zero dichotomy was later found by Fritz Noether to fail for singular operators of nonzero index, a generalization that, through Atiyah and Singer, became a pillar of twentieth-century geometry. A quiet actuary's determinant turned out to be the first chapter of index theory.

History
1823
— Abel inverts an integral equation to solve the tautochrone problem
1877
— Carl Neumann sums the iterative series for potential-theory problems
1903
— Fredholm's Acta Mathematica paper founds the theory of the determinant and the alternative
1904
— Hilbert builds the spectral theory of symmetric kernels on Fredholm's foundation
1963
— Atiyah and Singer generalize the Fredholm index to elliptic operators on manifolds

Going further

Texts. Stone & Goldbart, Mathematics for Physics, ch. on integral equations and Green's functions · Arfken, Weber & Harris, Mathematical Methods for Physicists, 7th ed., ch. 21 · Hassani, Mathematical Physics, ch. on integral equations · Byron & Fuller, Mathematics of Classical and Quantum Physics, ch. 9 · Riley, Hobson & Bence, Mathematical Methods for Physics and Engineering, 3rd ed., ch. 23 · F. Smithies, Integral Equations (Cambridge Tracts, 1958) · Reed & Simon, Methods of Modern Mathematical Physics, vols. I and IV.

Provenance. The determinant and minor series, the Plemelj–Smithies formula, the resolvent identity, the Hadamard product, and the index-zero alternative are standard. A verifier should recompute: (1) the discretized-determinant series and its Hadamard-bound convergence (Smithies ch. 5); (2) log⁡D=−∑λntr⁡Kn/n\log D=-\sum\lambda^n\operatorname{tr}K^n/n from det⁡=exp⁡tr⁡log⁡\det=\exp\operatorname{tr}\log; (3) D=1−λ/3D=1-\lambda/3 for K=xyK=xy, with ϕ=x/(1−λ/3)\phi=x/(1-\lambda/3) and resonance at λ=3\lambda=3; (4) K=x+yK=x+y: D=1−λ−λ2/12D=1-\lambda-\lambda^2/12, characteristic values −6±43-6\pm4\sqrt3, solution ϕ=−12x−6\phi=-12x-6 at λ=1, f=1\lambda=1,\ f=1; (5) D=cos⁡λD=\cos\sqrt\lambda for K=min⁡(x,y)K=\min(x,y) with λn=(n−12)2π2\lambda_n=(n-\tfrac12)^2\pi^2. All numbers are exact textbook values; none fabricated.

Prerequisites. Compact and Hilbert–Schmidt operators · Hilbert spaces and adjoint operators · Determinants and Cramer's rule · Order Symbols and Gauge Functions. Leads to. WKB Approximation · Borel Summation and Resurgence · Bohr–Sommerfeld Quantization.

Ask the tutor: Hand me any kernel — separable, symmetric, Volterra, or a Green's function — and I will build its Fredholm determinant, find the characteristic values, and tell you exactly when your equation can be solved.

What is the difference between a first-kind and a second-kind Fredholm equation, and why does it matter?

In a second-kind equation the unknown appears both outside and inside the integral, ϕ=f+λK^ϕ\phi=f+\lambda\hat K\phi, so the operator is I−λK^I-\lambda\hat K — the identity minus something compact. In a first-kind equation it appears only inside, K^ϕ=f\hat K\phi=f, so the operator is the compact K^\hat K itself. The distinction is decisive because a compact operator has an unbounded inverse: tiny changes in ff produce huge changes in ϕ\phi, the problem is ill-posed, and there is no clean alternative. The second-kind form is a bounded perturbation of the invertible identity, exactly the setting where the dichotomy, index zero, and the resolvent all hold. Almost every well-behaved application — Green's functions, Lippmann–Schwinger scattering, boundary-element methods — is deliberately cast in second-kind form for this reason.

Why is D(λ) entire when the trace series that defines log D only converges in a disk?

Because the two objects diverge for different reasons, and only one matters. The series log⁡D=−∑nλntr⁡Kn/n\log D=-\sum_n\lambda^n\operatorname{tr}K^n/n has radius 1/r(K)1/r(K), set by the largest eigenvalue; past it the logarithm misbehaves, growing logarithmic singularities log⁡(1−λ/λn)\log(1-\lambda/\lambda_n) at each characteristic value. But exponentiating such a singularity turns it into a perfectly smooth simple zero, so D=exp⁡(log⁡D)D=\exp(\log D) is analytic everywhere, vanishing where log⁡D→−∞\log D\to-\infty. The determinant series (2) makes this manifest: its coefficients, bounded by Hadamard's inequality and divided by n!n!, decay superfast, so it converges for every finite λ\lambda outright. "Entire" is a statement about DD, never about the trace series you used to reach it.

What does the alternative give me that a plain existence-and-uniqueness theorem does not?

It converts an infinite-dimensional existence question into a finite checklist. A generic theorem says a solution exists under some abstract condition; the alternative says exactly two things. First, uniqueness can fail only if the homogeneous equation has nontrivial solutions — and there are finitely many. Second, when it fails, existence is decided by finitely many scalar conditions ⟨ψk,f⟩=0\langle\psi_k,f\rangle=0, one per adjoint zero mode. That precise obstruction is far more useful than "generic" existence: in perturbation theory it is the secular/resonance condition fixing energy corrections; in boundary-value problems it tells you which sources a resonant cavity will accept; in numerics it tells you when your discretized matrix is about to go singular.

How does the alternative relate to the rank–nullity theorem, and when can the index be nonzero?

The alternative is rank–nullity promoted to infinite dimensions and made to survive there. In finite dimensions dim⁡ker⁡M+rank⁡M=dim⁡V\dim\ker M+\operatorname{rank}M=\dim V forces a square matrix to be injective iff surjective, with index dim⁡ker⁡−dim⁡coker⁡=0\dim\ker-\dim\operatorname{coker}=0. But a general infinite-dimensional operator can be injective without being surjective (the shift operator), so the intuition fails. Fredholm's insight is that if the operator is II minus something compact, the compact part is "almost finite-dimensional," the range stays closed, and kernel and cokernel keep equal finite dimension — so ind⁡(I−λK)=0\operatorname{ind}(I-\lambda K)=0. Leave that class and the index can be anything: Fritz Noether showed in 1920 that a singular integral operator aI+bHaI+bH (with HH the Hilbert transform) has index equal to minus the winding number of (a−b)/(a+b)(a-b)/(a+b). That analytic-index-equals-topological-invariant theme is exactly what Atiyah–Singer later realized for elliptic operators; Fredholm's zero is its trivial-topology special case.

Is the resolvent kernel the same thing as a Green's function?

Close relatives, not identical. A Green's function inverts a differential operator: LG=δLG=\delta with boundary conditions, so Lu=fLu=f is solved by u=∫Gfu=\int Gf. The resolvent kernel inverts I−λK^I-\lambda\hat K: ϕ=f+λ∫Rf\phi=f+\lambda\int Rf. The bridge is that inverting a differential operator into an integral one — as in worked example 3 — turns the free Green's function G0G_0 into the kernel KK of a Fredholm equation, and the full resolvent R(x,y;λ)R(x,y;\lambda) is then the Green's function of the shifted operator L−λL-\lambda, with poles exactly at the eigenvalues of LL. So the resolvent kernel is the energy-dependent Green's function of the associated boundary-value problem, its poles the resonances. In scattering theory this is literally how the Lippmann–Schwinger Green's function and the T-matrix are built.

Is the Fredholm determinant the same as the functional determinant det(−∂² + V) in physics?

Yes, once the operator is written correctly. A one-loop path integral gives Z∝[det⁡(−∂2+m2+V)]−1/2Z\propto[\det(-\partial^2+m^2+V)]^{-1/2}, an infinite-dimensional determinant needing regularization. Factor out the free part and you have det⁡(I+K)\det(I+K) with K=(−∂2+m2)−1VK=(-\partial^2+m^2)^{-1}V compact — precisely a Fredholm determinant. The Plemelj–Smithies form det⁡(I+K)=exp⁡(∑(−1)n+1λntr⁡Kn/n)\det(I+K)=\exp(\sum(-1)^{n+1}\lambda^n\operatorname{tr}K^n/n) is exactly the sum of one-loop Feynman rings physicists draw, each tr⁡Kn\operatorname{tr}K^n an nn-vertex loop. In one dimension the Gel'fand–Yaglom theorem evaluates it as a ratio of two solutions of an ODE — the boundary-value analogue of D(λ)=cos⁡λD(\lambda)=\cos\sqrt\lambda from worked example 3. "Functional determinant" and "Fredholm determinant" name the same object from field theory and integral-equation theory.

Before this

Where this leads