Fredholm determinant
In-game article clicks load inline without leaving the challenge.
In mathematics, the Fredholm determinant is a complex-valued function which generalizes the determinant of a finite dimensional linear operator. It is defined for bounded operators on a Hilbert space which differ from the identity operator by a trace-class operator (i.e. an operator whose singular values sum up to a finite number). The function is named after the mathematician Erik Ivar Fredholm.
Fredholm determinants have had many applications in mathematical physics, the most celebrated example being Gábor Szegő's limit formula, proved in response to a question raised by Lars Onsager and C. N. Yang on the spontaneous magnetization of the Ising model.
Definition
Setup
Let H {\displaystyle H} be a Hilbert space and G {\displaystyle G} the set of bounded invertible operators on H {\displaystyle H} of the form I + T {\displaystyle I+T}, where T {\displaystyle T} is a trace-class operator. G {\displaystyle G} is a group because
- The set of trace-class operators is an ideal in the algebra of bounded linear operators, so ( I + T ) ( I + T ′ ) − I = T + T ′ + T T ′ {\displaystyle (I+T)(I+T')-I=T+T'+TT'} is trace-class.
- ( I + T ) − 1 − I = − T ( I + T ) − 1 , {\textstyle (I+T)^{-1}-I=-T(I+T)^{-1},} so ( I + T ) − 1 − I {\displaystyle (I+T)^{-1}-I} is trace class if T {\displaystyle T} is.
G {\displaystyle G} has a natural metric given by d ( X , Y ) = ‖ X − Y ‖ 1 {\displaystyle d(X,Y)=\|X-Y\|_{1}}, where ‖ X ‖ 1 = ∑ i | λ i ( X ) | {\displaystyle \|X\|_{1}=\sum _{i}|\lambda _{i}(X)|} is the trace-class norm.
Definition by exponential trace
One definition uses the exponential trace formula. For finite-dimensional matrices, we have det ( I + A ) = e Tr ( ln ( I + A ) ) {\textstyle \det(I+A)=e^{\operatorname {Tr} (\ln(I+A))}}, which expands in Taylor series todet ( I + A ) = exp ( ∑ n = 1 ∞ ( − 1 ) n + 1 n Tr ( A n ) ) {\displaystyle \operatorname {det} (I+A)=\exp \left(\sum _{n=1}^{\infty }{\frac {(-1)^{n+1}}{n}}\operatorname {Tr} \left(A^{n}\right)\right)}This then generalizes directly to trace-class operators.
Definition by exterior powers

In the finite-dimensional case, the determinant of an operator can be interpreted as the factor by which it scales the (oriented) volume of a parallelepiped. This can be generalized to infinite dimensions.
In finite dimensions, by expanding the definition of determinant as a sum over permutations,det ( I + A ) = ∑ S det ( A S S ) {\displaystyle \det(I+A)=\sum _{S}\det(A_{SS})}where S {\displaystyle S} ranges over all subsets of the index set of A {\displaystyle A}. For example, when the index set is { 1 , 2 } {\displaystyle \{1,2\}} then S = { } , { 1 } , { 2 } , { 1 , 2 } {\displaystyle S=\{\},\{1\},\{2\},\{1,2\}}.
If H {\displaystyle H} is an n {\displaystyle n}-dimensional Hilbert space with inner product ( ⋅ , ⋅ ) {\displaystyle (\cdot ,\cdot )}, then the k {\displaystyle k}-th exterior power Λ k H {\displaystyle \Lambda ^{k}H} is also a ( n k ) {\displaystyle {\binom {n}{k}}}-dimensional Hilbert space, with inner product ( v 1 ∧ v 2 ∧ ⋯ ∧ v k , w 1 ∧ w 2 ∧ ⋯ ∧ w k ) = det ( v i , w j ) . {\displaystyle (v_{1}\wedge v_{2}\wedge \cdots \wedge v_{k},w_{1}\wedge w_{2}\wedge \cdots \wedge w_{k})=\det(v_{i},w_{j}).}In particular e i 1 ∧ e i 2 ∧ ⋯ ∧ e i k , ( i 1 < i 2 < ⋯ < i k ) {\displaystyle e_{i_{1}}\wedge e_{i_{2}}\wedge \cdots \wedge e_{i_{k}},\qquad (i_{1}<i_{2}<\cdots <i_{k})}gives an orthonormal basis of Λ k H {\displaystyle \Lambda ^{k}H} if ( e i ) {\displaystyle (e_{i})} is an orthonormal basis of H {\displaystyle H}.
If A {\displaystyle A} is an operator on H {\displaystyle H}, then A {\displaystyle A} functorially defines a bounded operator Λ k ( A ) {\displaystyle \Lambda ^{k}(A)} on Λ k H {\displaystyle \Lambda ^{k}H} by Λ k ( A ) v 1 ∧ v 2 ∧ ⋯ ∧ v k = A v 1 ∧ A v 2 ∧ ⋯ ∧ A v k . {\displaystyle \Lambda ^{k}(A)v_{1}\wedge v_{2}\wedge \cdots \wedge v_{k}=Av_{1}\wedge Av_{2}\wedge \cdots \wedge Av_{k}.}By definition of trace, we haveTr ( Λ k A ) = ∑ 1 ≤ i 1 < ⋯ < i k ≤ n ( e i 1 ∧ e i 2 ∧ ⋯ ∧ e i k , A e i 1 ∧ A e i 2 ∧ ⋯ ∧ A e i k ) {\displaystyle \operatorname {Tr} \left(\Lambda ^{k}A\right)=\sum _{1\leq i_{1}<\cdots <i_{k}\leq n}(e_{i_{1}}\wedge e_{i_{2}}\wedge \cdots \wedge e_{i_{k}},Ae_{i_{1}}\wedge Ae_{i_{2}}\wedge \cdots \wedge Ae_{i_{k}})}The summand simplifies to det [ ( e i j , A e i j ′ ) ] = det ( A S S ) {\displaystyle \det[(e_{i_{j}},Ae_{i_{j'}})]=\det(A_{SS})} where S = { i 1 , … , i k } {\displaystyle S=\{i_{1},\dots ,i_{k}\}}. Thus Tr Λ k ( A ) = ∑ | S | = k det ( A S S ) . det ( I + A ) = ∑ k = 0 n Tr Λ k ( A ) . {\displaystyle {\begin{aligned}&\operatorname {Tr} \Lambda ^{k}(A)=\sum _{|S|=k}\operatorname {det} \left(A_{SS}\right).\\&\operatorname {det} (I+A)=\sum _{k=0}^{n}\operatorname {Tr} \Lambda ^{k}(A).\end{aligned}}}This generalizes to infinite-dimensional Hilbert spaces, and bounded trace-class operators, allowing us to define the Fredholm determinant bydet ( I + A ) = ∑ k = 0 ∞ Tr Λ k ( A ) {\displaystyle \det(I+A)=\sum _{k=0}^{\infty }\operatorname {Tr} \Lambda ^{k}(A)}To show that the definition makes sense, note that if A {\displaystyle A} is trace-class, then Λ k ( A ) {\displaystyle \Lambda ^{k}(A)} is also trace-class with ‖ Λ k ( A ) ‖ 1 ≤ ‖ A ‖ 1 k / k ! {\textstyle \|\Lambda ^{k}(A)\|_{1}\leq \|A\|_{1}^{k}/k!}, thus ∑ k = 0 ∞ | Tr Λ k ( A ) | ≤ e ‖ A ‖ 1 {\displaystyle \sum _{k=0}^{\infty }|\operatorname {Tr} \Lambda ^{k}(A)|\leq e^{\|A\|_{1}}}.
We have ‖ A ‖ 1 = ∑ i σ i {\textstyle \|A\|_{1}=\sum _{i}\sigma _{i}} where σ i {\textstyle \sigma _{i}} are the singular values of A {\textstyle A}.
The singular values of Λ k ( A ) {\textstyle \Lambda ^{k}(A)} are exactly the products of k {\textstyle k} distinct singular values of A {\textstyle A}. In other words, if you list all k {\textstyle k}-tuples with 1 ≤ i 1 < i 2 < ⋯ < i k {\textstyle 1\leq i_{1}<i_{2}<\cdots <i_{k}}, then the corresponding singular value of Λ k ( A ) {\textstyle \Lambda ^{k}(A)} is σ i 1 σ i 2 ⋯ σ i k {\textstyle \sigma _{i_{1}}\sigma _{i_{2}}\cdots \sigma _{i_{k}}}
Thus,
‖ Λ k ( A ) ‖ 1 = ∑ 1 ≤ i 1 < i 2 < ⋯ < i k σ i 1 σ i 2 ⋯ σ i k {\displaystyle \left\|\Lambda ^{k}(A)\right\|_{1}=\sum _{1\leq i_{1}<i_{2}<\cdots <i_{k}}\sigma _{i_{1}}\sigma _{i_{2}}\cdots \sigma _{i_{k}}}
This is the k {\textstyle k} th elementary symmetric function of the singular values of A {\textstyle A}. Let a i ≥ 0 {\textstyle a_{i}\geq 0} (in our case a i = σ i {\textstyle a_{i}=\sigma _{i}} ) then by expanding the right side, we have
∑ 1 ≤ i 1 < ⋯ < i k a i 1 ⋯ a i k ≤ 1 k ! ( ∑ i a i ) k {\displaystyle \sum _{1\leq i_{1}<\cdots <i_{k}}a_{i_{1}}\cdots a_{i_{k}}\leq {\frac {1}{k!}}\left(\sum _{i}a_{i}\right)^{k}}
Properties
By default, all operators are assumed trace-class.
- det ( I + A ) ⋅ det ( I + B ) = det ( I + A ) ( I + B ) . {\textstyle \det(I+A)\cdot \det(I+B)=\det(I+A)(I+B).}
- z ↦ det ( I + z A ) = ∑ k = 0 ∞ z k Tr Λ k ( A ) {\textstyle z\mapsto \det(I+zA)=\sum _{k=0}^{\infty }z^{k}\operatorname {Tr} \Lambda ^{k}(A)} defines an entire function, with | det ( I + z A ) | ≤ exp ( | z | ⋅ ‖ A ‖ 1 ) . {\textstyle \left|\det(I+zA)\right|\leq \exp(|z|\cdot \|A\|_{1}).}
- The function A ↦ det ( I + A ) {\displaystyle A\mapsto \det(I+A)} is continuous on trace-class operators, with
| det ( I + A ) − det ( I + B ) | ≤ ‖ A − B ‖ 1 exp ( ‖ A ‖ 1 + ‖ B ‖ 1 + 1 ) . {\displaystyle \left|\det(I+A)-\det(I+B)\right|\leq \|A-B\|_{1}\exp(\|A\|_{1}+\|B\|_{1}+1).} One can improve this inequality slightly to the following, as noted in (Simon 2005, Chapter 5): | det ( I + A ) − det ( I + B ) | ≤ ‖ A − B ‖ 1 exp ( max ( ‖ A ‖ 1 , ‖ B ‖ 1 ) + 1 ) . {\displaystyle \left|\det(I+A)-\det(I+B)\right|\leq \|A-B\|_{1}\exp(\max(\|A\|_{1},\|B\|_{1})+1).}
- The function det {\displaystyle \det } defines a homomorphism of type G → C × {\displaystyle G\to \mathbb {C} ^{\times }} where C × {\displaystyle \mathbb {C} ^{\times }} the multiplicative group of nonzero complex numbers (since elements of G {\displaystyle G} are invertible).
- If T {\displaystyle T} is in G {\displaystyle G} and X {\displaystyle X} is invertible, det X T X − 1 = det T . {\textstyle \det XTX^{-1}=\det T.}
- det e A = exp Tr ( A ) . {\textstyle \det e^{A}=\exp \,\operatorname {Tr} (A).}
- log det ( I + z A ) = Tr ( log ( I + z A ) ) = ∑ k = 1 ∞ ( − 1 ) k + 1 Tr A k k z k {\textstyle \log \det(I+zA)=\operatorname {Tr} (\log {(I+zA)})=\sum _{k=1}^{\infty }(-1)^{k+1}{\frac {\operatorname {Tr} A^{k}}{k}}z^{k}}
Integral operators
The Fredholm determinant is often applied to integral operators. Let the trace-class operator T {\displaystyle T} be an integral operator given by a kernel K ( x , y ) {\displaystyle K(x,y)}, then the Fredholm determinant is defined, like before, bydet ( I − λ T ) = ∑ n = 0 ∞ ( − λ ) n Tr Λ n ( T ) = exp ( − ∑ n = 1 ∞ Tr ( T n ) n λ n ) {\displaystyle \det(I-\lambda T)=\sum _{n=0}^{\infty }(-\lambda )^{n}\operatorname {Tr} \Lambda ^{n}(T)=\exp {\left(-\sum _{n=1}^{\infty }{\frac {\operatorname {Tr} (T^{n})}{n}}\lambda ^{n}\right)}}where T {\displaystyle T} is an integral operator. The trace of the operator T {\displaystyle T} and its alternating powers is given in terms of the kernel K {\displaystyle K} by Tr T = ∫ K ( x , x ) d x {\displaystyle \operatorname {Tr} T=\int K(x,x)\,dx} and Tr Λ 2 ( T ) = 1 2 ! ∬ ( K ( x , x ) K ( y , y ) − K ( x , y ) K ( y , x ) ) d x d y {\displaystyle \operatorname {Tr} \Lambda ^{2}(T)={\frac {1}{2!}}\iint \left(K(x,x)K(y,y)-K(x,y)K(y,x)\right)dx\,dy} and in general Tr Λ n ( T ) = 1 n ! ∫ ⋯ ∫ det [ K ( x i , x j ) ] i , j ∈ 1 : n d x 1 : n {\displaystyle \operatorname {Tr} \Lambda ^{n}(T)={\frac {1}{n!}}\int \cdots \int \det[K(x_{i},x_{j})]_{i,j\in 1:n}\,dx_{1:n}}The trace is well-defined for these kernels, since these are trace-class or nuclear operators.
To see that this is a special case of the previous section's general definition, note that,Tr ( Λ k A ) = ∑ 1 ≤ i 1 < ⋯ < i k ≤ n ( e i 1 ∧ e i 2 ∧ ⋯ ∧ e i k , A e i 1 ∧ A e i 2 ∧ ⋯ ∧ A e i k ) {\displaystyle \operatorname {Tr} \left(\Lambda ^{k}A\right)=\sum _{1\leq i_{1}<\cdots <i_{k}\leq n}(e_{i_{1}}\wedge e_{i_{2}}\wedge \cdots \wedge e_{i_{k}},Ae_{i_{1}}\wedge Ae_{i_{2}}\wedge \cdots \wedge Ae_{i_{k}})}is equivalent to1 k ! ∑ i 1 , ⋯ , i k ∈ 1 : n , all different det ( A S S ) {\displaystyle {\frac {1}{k!}}\sum _{i_{1},\cdots ,i_{k}\in 1:n,{\text{ all different}}}\det(A_{SS})}where S {\displaystyle S} is the ordered sequence i 1 , … , i k {\displaystyle i_{1},\dots ,i_{k}}. Now, to convert this to integral equations, a matrix becomes a kernel, and a summation over indices becomes an integral over coordinates.
The above argument is intuitive. A proper definition requires a presentation showing that each of the manipulations are well-defined, convergent, and so on, for the given situation for which the Fredholm determinant is contemplated. Since the kernel K {\displaystyle K} may be defined for a large variety of Hilbert spaces and Banach spaces, this is a non-trivial exercise.
Integral equation
The original (Fredholm 1903) considered the integral equationu ( x ) + z ∫ a b K ( x , y ) u ( y ) d y = f ( x ) ( x ∈ ( a , b ) ) {\displaystyle u(x)+z\int _{a}^{b}K(x,y)u(y)dy=f(x)\quad (x\in (a,b))}which can be written as ( I + z A ) u = f {\displaystyle (I+zA)u=f}. Fredholm proved that this equation has a unique solution iff det ( I + z A ) ≠ 0 {\displaystyle \det(I+zA)\neq 0}.
Commutators
A function F ( t ) {\displaystyle F(t)} from ( a , b ) {\displaystyle (a,b)} into G {\displaystyle G} is said to be differentiable if F ( t ) − I {\displaystyle F(t)-I} is differentiable as a map into the trace-class operators, i.e. if the limit
F ˙ ( t ) = lim h → 0 F ( t + h ) − F ( t ) h {\displaystyle {\dot {F}}(t)=\lim _{h\to 0}{F(t+h)-F(t) \over h}}
exists in trace-class norm.
If g ( t ) {\displaystyle g(t)} is a differentiable function with values in trace-class operators, then so too is exp g ( t ) {\displaystyle \exp g(t)} and
F − 1 F ˙ = id − exp − ad g ( t ) ad g ( t ) ⋅ g ˙ ( t ) , {\displaystyle F^{-1}{\dot {F}}={\operatorname {id} -\exp -\operatorname {ad} g(t) \over \operatorname {ad} g(t)}\cdot {\dot {g}}(t),}
where ad ( X ) ⋅ Y = X Y − Y X . {\displaystyle \operatorname {ad} (X)\cdot Y=XY-YX.}
Israel Gohberg and Mark Krein proved that if F {\displaystyle F} is a differentiable function into G {\displaystyle G}, then f = det F {\displaystyle f=\det F} is a differentiable map into C ∗ {\displaystyle \mathbb {C} ^{*}} with f − 1 f ˙ = Tr F − 1 F ˙ . {\displaystyle f^{-1}{\dot {f}}=\operatorname {Tr} F^{-1}{\dot {F}}.}
This result was used by Joel Pincus, William Helton and Roger Howe to prove that if A {\displaystyle A} and B {\displaystyle B} are bounded operators with trace-class commutator A B − B A {\displaystyle AB-BA}, then
det e A e B e − A e − B = exp Tr ( A B − B A ) . {\displaystyle \det e^{A}e^{B}e^{-A}e^{-B}=\exp \operatorname {Tr} (AB-BA).}
Szegő limit formula
Let H = L 2 ( S 1 ) {\displaystyle H=L^{2}(S^{1})} and let P {\displaystyle P} be the orthogonal projection onto the Hardy space H 2 ( S 1 ) {\displaystyle H^{2}(S^{1})}.
If f {\displaystyle f} is a smooth function on the circle, let m ( f ) {\displaystyle m(f)} denote the corresponding multiplication operator on H {\displaystyle H}.
The commutator P m ( f ) − m ( f ) P {\displaystyle Pm(f)-m(f)P} is trace-class.
Let T ( f ) {\displaystyle T(f)} be the Toeplitz operator on H 2 ( S 1 ) {\displaystyle H^{2}(S^{1})} defined by T ( f ) = P m ( f ) P , {\displaystyle T(f)=Pm(f)P,}
then the additive commutator T ( f ) T ( g ) − T ( g ) T ( f ) {\displaystyle T(f)T(g)-T(g)T(f)} is trace-class if f {\displaystyle f} and g {\displaystyle g} are smooth.
Berger and Shaw proved that tr ( T ( f ) T ( g ) − T ( g ) T ( f ) ) = 1 2 π i ∫ 0 2 π f d g . {\displaystyle \operatorname {tr} (T(f)T(g)-T(g)T(f))={1 \over 2\pi i}\int _{0}^{2\pi }f\,dg.}
If f {\displaystyle f} and g {\displaystyle g} are smooth, then T ( e f + g ) T ( e − f ) T ( e − g ) {\displaystyle T(e^{f+g})T(e^{-f})T(e^{-g})} is in G {\displaystyle G}.
Harold Widom used the result of Pincus-Helton-Howe to prove that det T ( e f ) T ( e − f ) = exp ∑ n > 0 n a n a − n , {\displaystyle \det T(e^{f})T(e^{-f})=\exp \sum _{n>0}na_{n}a_{-n},} where f ( z ) = ∑ a n z n . {\displaystyle f(z)=\sum a_{n}z^{n}.}
He used this to give a new proof of Gábor Szegő's celebrated limit formula: lim N → ∞ det P N m ( e f ) P N = exp ∑ n > 0 n a n a − n , {\displaystyle \lim _{N\to \infty }\det P_{N}m(e^{f})P_{N}=\exp \sum _{n>0}na_{n}a_{-n},} where P N {\displaystyle P_{N}} is the projection onto the subspace of H {\displaystyle H} spanned by 1 , z , … , z N {\displaystyle 1,z,\ldots ,z^{N}} and a 0 = 0 {\displaystyle a_{0}=0}.
Szegő's limit formula was proved in 1951 in response to a question raised by the work Lars Onsager and C. N. Yang on the calculation of the spontaneous magnetization for the Ising model. The formula of Widom, which leads quite quickly to Szegő's limit formula, is also equivalent to the duality between bosons and fermions in conformal field theory. A singular version of Szegő's limit formula for functions supported on an arc of the circle was proved by Widom; it has been applied to establish probabilistic results on the eigenvalue distribution of random unitary matrices.
History
The Fredholm determinant was first used in (Fredholm 1903) to solve an integral equation. Realizing the potential, Hilbert wrote 6 papers during 1904 to 1910 (collected in (Hilbert 1924)), beginning the theory of compact operators on Hilbert spaces. See (Bornemann 2010) and references therein.
The Fredholm determinant was used by physicist John A. Wheeler (1937, Phys. Rev. 52:1107) to help provide mathematical description of the wavefunction for a composite nucleus composed of antisymmetrized combination of partial wavefunctions by the method of Resonating Group Structure. This method corresponds to the various possible ways of distributing the energy of neutrons and protons into fundamental boson and fermion nucleon cluster groups or building blocks such as the alpha-particle, helium-3, deuterium, triton, di-neutron, etc. When applied to the method of Resonating Group Structure for beta and alpha stable isotopes, use of the Fredholm determinant: (1) determines the energy values of the composite system, and (2) determines scattering and disintegration cross sections. The method of Resonating Group Structure of Wheeler provides the theoretical bases for all subsequent Nucleon Cluster Models and associated cluster energy dynamics for all light and heavy mass isotopes (see review of Cluster Models in physics in N.D. Cook, 2006).
- Fredholm, Ivar (1903). (PDF). Acta Mathematica. 27: 365–390. doi:. ISSN .
- Hilbert, D. (1924). . Fortschritte der mathematischen Wissenschaften in Monographien (in German). B. G. Teubner.
- Gohberg, Israel; Goldberg, Seymour; Krupnik, Nahum (2000). Traces and Determinants of Linear Operators. Basel: Birkhäuser Basel. doi:. ISBN 978-3-0348-9551-4.
- Simon, Barry (2005), Trace Ideals and Their Applications, Mathematical Surveys and Monographs, vol. 120, American Mathematical Society, ISBN 0-8218-3581-5
- Wheeler, John A. (1937-12-01). "On the Mathematical Description of Light Nuclei by the Method of Resonating Group Structure". Physical Review. 52 (11). American Physical Society (APS): 1107–1122. Bibcode:. doi:. ISSN .
- Bornemann, Folkmar (2010), "On the numerical evaluation of Fredholm determinants", Math. Comp., 79 (270), Springer: 871–915, arXiv:, Bibcode:, doi: