Proof of Positive Semidefinite Kernels on a Finite Set: Rank-One Decomposition and the Schur Product
lemmalem:psd-kernel-finite-set-2026aSums of rank-one kernels have quadratic form equal to a sum of squared moduli, every positive semidefinite kernel on an N-element set is split into N rank-one kernels by induction on N (peeling one point off and subtracting the rank-one kernel through its row), and the Schur product follows by writing one factor as such a sum.
We use the following items: Positive Semidefinite Kernel on a Finite Set §kernel; Sum over a Finite Index Set; claims 1 to 4 of Properties of a Sum over a Finite Index Set; Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union, Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing, Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs and Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §conjugate; The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product; claims 1 and 2 of Peeling an Element off a Finite Set, and Unions of Finite Sets; claims 2 and 3 of Basic Properties of Finite Sets; claims 1, 2 and 3 of Basic Properties of Initial Segments of the Natural Numbers; Finite Set; Characteristic Property of the Ordered Pair; Finite Sum Notation in a Field; claims 1, 3, 4 and 5 of Properties of Finite Sums; condition 1 of The Complex Numbers; claims 1 and 3 of Properties of Complex Conjugation and Modulus; claim 1 of Canonical Form and Arithmetic of Complex Numbers; Modulus of a Complex Number; Existence and Uniqueness of the Nonnegative Square Root; claim 5 of Elementary Arithmetic in an Ordered Field; claims 4, 6 and 8 of Elementary Order Arithmetic in an Ordered Field; claim 3 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field; and Principle of Induction for the Natural Numbers.
Conventions. The notion of Positive Semidefinite Kernel on a Finite Set §kernel is used for every nonempty finite set , not only for . For an element of a Cartesian product we write , the components being unique by Characteristic Property of the Ordered Pair. For an arbitrary map (positive semidefinite or not) and a map we use the same formula
as in Positive Semidefinite Kernel on a Finite Set §kernel. Conjugation commutes with sums, products and differences and fixes real numbers, by claim 1 of Properties of Complex Conjugation and Modulus; we use this silently in computations.
Step 1. (Finite sums of real numbers.) Let and let be real numbers. The partial-sum map of Finite Sum Notation in a Field for the field satisfies and whenever ; by condition 1 of The Complex Numbers these equations remain true when the additions are formed in , so by the uniqueness of the partial-sum map in Finite Sum Notation in a Field for the field , the finite sum formed in equals the one formed in . Consequently, if for every , then is a real number and is nonnegative, by claim 5 of Properties of Finite Sums.
Step 2. (Sums over one or two points.) Let be an object and a map. The set has element by claim 2 of Basic Properties of Finite Sets, so there is a bijection ; since by claim 2 of Basic Properties of Initial Segments of the Natural Numbers, , and Sum over a Finite Index Set together with claim 1 of Properties of Finite Sums gives . Now let be a nonempty finite set and a map. (a) If and for every with , then , by the second part of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing and the formula just proved. (b) If with and for every , then the set is nonempty and finite by claim 1 of Peeling an Element off a Finite Set, and Unions of Finite Sets, so the second part of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing, then Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §disjoint-union for the disjoint sets and , and the singleton formula give .
Step 3. (Exchanging a sum over a finite set with a numerical sum.) Let , let be a nonempty finite set, and let be given for and . We claim
The set is nonempty and finite and numerical sums over it agree with sums over the index set , by claim 1 of Properties of a Sum over a Finite Index Set. By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs with and for every , the set of pairs being , the left side equals , where for . By claim 1 of Properties of a Sum over a Finite Index Set applied to each inner sum and Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs with and , the right side equals , where is . The map is a bijection (its inverse is the analogous exchange of components, by Characteristic Property of the Ordered Pair), so claim 2 of Properties of a Sum over a Finite Index Set gives , and the two sides agree.
Step 4. (Quadratic form of a rank-one kernel.) Let be a nonempty finite set, let be maps and put . We claim
and that is real and nonnegative. By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §conjugate, . By The Product of Two Sums over Finite Index Sets is a Sum over the Cartesian Product applied to the maps and , the product is the sum on the left (after rearranging each term by commutativity), and by claim 3 of Properties of Complex Conjugation and Modulus. Finally is a nonnegative real number by Modulus of a Complex Number, so is real and nonnegative by claim 5 of Elementary Arithmetic in an Ordered Field (multiply by ).
Step 5. (Claim 1, sums of rank-one kernels.) Let . For , claim 4 of Properties of Finite Sums gives , which equals by commutativity of multiplication. Let . For each , claim 3 of Properties of Finite Sums gives with . By Step 3 and then Step 4 (with and ),
a finite sum of nonnegative real numbers, hence real and nonnegative by Step 1. So is a positive semidefinite kernel on .
Step 6. (Iterated form and point evaluations.) Let be a nonempty finite set and a map. By Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §pairs with and for every (the set of pairs being ), and by claim 4 of Properties of a Sum over a Finite Index Set to take out of the inner sum,
(a) Let , , and let and for . By Step 2(a) the inner sum is and then . With this gives ; hence if is a positive semidefinite kernel, then is real and nonnegative for every . (b) Let with , let , and let , and for . By Step 2(b), applied to the inner sums and then to the outer sum,
Step 7. (Restriction.) Let be a positive semidefinite kernel on a nonempty finite set , and let be nonempty. Then is finite by claim 3 of Basic Properties of Finite Sets, and the restriction of to is a positive semidefinite kernel on . Indeed, is inherited from . Given , let agree with on and vanish on . If is not in , then or , so the term is . As is a nonempty subset of , the second part of Sums over Finite Index Sets: Finite Unions, Disjoint Unions, Vanishing Terms, Dependent Pairs, Conjugation and the Modulus §vanishing gives , which is therefore real and nonnegative.
Step 8. (Splitting off one point.) Let be a positive semidefinite kernel on a nonempty finite set and let . We show that there is a map such that defines a positive semidefinite kernel on with for every . By Step 6(a), is real and .
Case . Take , so ; it suffices to show for every , because then as well. For this is . Let , put and , which is real by Step 6(a), and suppose . Then by claim 3 of Properties of Complex Conjugation and Modulus, so the real number is nonzero, and so is since by claim 8 of Elementary Order Arithmetic in an Ordered Field. Let , a real number, and apply Step 6(b) with , and . Since and ,
But by Positive Semidefinite Kernel on a Finite Set §kernel, while by claims 6 and 4 of Elementary Order Arithmetic in an Ordered Field; this contradicts the antisymmetry of the order. Hence .
Case . Let be the nonnegative real number with , given by Existence and Uniqueness of the Nonnegative Square Root; since , and is real by claim 1 of Canonical Form and Arithmetic of Complex Numbers. Define for . Then , which is real, and for we have by the Hermitian symmetry of . Hence and for all . The map is Hermitian: . Now let , put , and define by and for . By claim 3 of Properties of a Sum over a Finite Index Set and Step 2(a) (for the map equal to at and to elsewhere),
Since for every , claim 3 of Properties of a Sum over a Finite Index Set and Step 4 (with in place of ) give . Finally, for with and we have and , while for every other we have ; so the sums and agree term by term. Therefore , which is real and nonnegative. So is a positive semidefinite kernel on .
Step 9. (Claim 2, rank-one decomposition.) Let be the set of those such that for every set having elements and every positive semidefinite kernel on there are maps with for all . (A set having elements is finite by Finite Set and nonempty, being the image of the nonempty set , claim 1 of Basic Properties of Initial Segments of the Natural Numbers.) We verify the two hypotheses of Principle of Induction for the Natural Numbers for .
: let have element, with bijection . Since (claim 2 of Basic Properties of Initial Segments of the Natural Numbers), with . Let be a positive semidefinite kernel on . By Step 6(a), is real and nonnegative; let be its nonnegative square root (Existence and Uniqueness of the Nonnegative Square Root) and . Then , by claim 1 of Properties of Finite Sums; as is the only element of , this is the required identity.
implies : let have elements and let be a positive semidefinite kernel on . By claim 2 of Peeling an Element off a Finite Set, and Unions of Finite Sets there are with elements and with and . Step 8 with gives such that is a positive semidefinite kernel on vanishing whenever or . The set is nonempty, so by Step 7 the restriction of to is a positive semidefinite kernel on , and as there are maps with for . Since with (claim 3 of Basic Properties of Initial Segments of the Natural Numbers), we may define for by on and for , and . Let . By claim 1 of Properties of Finite Sums,
If , the sum over is . Otherwise or ; then every term of the sum over is , so the sum is (write each term as and use claim 3 of Properties of Finite Sums with ), and as well. In both cases the displayed sum equals . Hence .
By Principle of Induction for the Natural Numbers, . Applied to the given , the set and the kernel , this is claim 2.
Step 10. (Claim 3, Schur product.) Let and be positive semidefinite kernels on and . Since is nonempty and finite, it has elements for some (Finite Set), so by Step 9 there are with for all . First, . Next let and put for . For each , claim 3 of Properties of Finite Sums gives
so by Step 3, . Each is real and nonnegative because is positive semidefinite, so is real and nonnegative by Step 1. Hence is a positive semidefinite kernel on .
Loading…
Prerequisites
0f8cd45d-75b8-4451-9946-ed0cee6d20e2