The truncated moment problem on reducible cubic curves I: Parabolic and Circular type relations
Abstract.
In this article we study the bivariate truncated moment problem (TMP) of degree on reducible cubic curves. First we show that every such TMP is equivalent after applying an affine linear transformation to one of 8 canonical forms of the curve. The case of the union of three parallel lines was solved in [Zal22a], while the degree 6 cases in [Yoo17b]. Second we characterize in terms of concrete numerical conditions the existence of the solution to the TMP on two of the remaining cases concretely, i.e., a union of a line and a circle , and a union of a line and a parabola . In both cases we also determine the number of atoms in a minimal representing measure.
Key words and phrases:
Truncated moment problems; –moment problems; –representing measure; Minimal measure; Moment matrix extensions2020 Mathematics Subject Classification:
Primary 44A60, 47A57, 47A20; Secondary 15A04, 47N40.1. Introduction
Given a real –dimensional sequence
of degree and a closed subset of , the truncated moment problem (–TMP) supported on for asks to characterize the existence of a positive Borel measure on with support in , such that
(1.1) |
If such a measure exists, we say that has a representing measure supported on and is its –representing measure (–rm).
In the degree-lexicographic order
of rows and columns, the corresponding moment matrix to is equal to
(1.2) |
where
Let stand for the set of real polynomials in variables of total degree at most . For every we define its evaluation on the columns of the matrix by replacing each capitalized monomial in by the column of , indexed by this monomial. Then is a vector from the linear span of the columns of . If this vector is the zero one, i.e., all coordinates are equal to 0, then we say is a column relation of . A column relation is nontrivial, if . We denote by , the zero set of . We say that the matrix is recursively generated (rg) if for such that is a column relation of , it follows that is also a column relation of . The matrix is –pure, if the only column relations of are those determined recursively by . We call a sequence –pure, if is –pure.
A concrete solution to the TMP is a set of necessary and sufficient conditions for the existence of a –representing measure , that can be tested in numerical examples. Among necessary conditions, must be positive semidefinite (psd) and rg [CF04, Fia95], and by [CF96], if the support of is a subset of for a polynomial , then is a column relation of . The bivariate –TMP is concretely solved in the following cases:
-
(1)
for a polynomial with .
Assume that . By applying an affine linear transformation it suffices to consider one of the canonical cases: , , , , . The case is equivalent to the univariate trigonometric moment problem, solved in [CF02]. The other four cases were tackled in [CF02, CF04, CF05, Fia15] by applying the far-reaching flat extension theorem (FET) [CF96, Theorem 7.10] (see also [CF05b, Theorem 2.19] and [Lau05] for an alternative proof), which states that admits a –atomic rm if and only if is psd and admits a rank–preserving extension to a moment matrix . For an alternative approach with shorter proofs compared to the original ones by reducing the problem to the univariate setting see [BZ21, Section 6] (for ), [Zal22a] (for ), [Zal22b] (for ) and [Zal23] (for ).
- (2)
- (3)
- (4)
-
(5)
satisfies symmetric cubic column relations which can only cause extremal moment problems. In order to satisfy the variety condition, another symmetric column relation must exist, and the solution was obtained by checking consistency [CY14].
-
(6)
Non-extremal sextic TMPs with and with finite or infinite algebraic varieties [CY15].
-
(7)
with reducible cubic column relations [Yoo17b].
The solutions to the –TMP, which are not concrete in the sense of definition from the previous paragraph, are known in the cases and , where . [Fia11, Section 6] gives a solution in terms of the bound on the degree for which the existence of a positive extension of is equivalent to the existence of a rm. In [Zal23] the bound on is improved to for curves of the form , , and to for curves of the form , .
References to some classical work on the TMP are monographs [Akh65, AK62, KN77], while for a recent development in the area we refer a reader to [Sch17].
Special cases of the TMP have also been considered in [Kim14, Ble15, Fia17, DS18, BF20, Kim21],
while [Nie14] considers subspaces of the polynomial algebra and [CGIK+] the TMP for commutative –algebras.
The motivation for this paper was to solve the TMP concretely on some reducible cubic curves, other than the case of three parallel lines solved in [Zal22a]. Applying an affine linear transformation we show that every such TMP is equivalent to the TMP on one of 8 canonical cases of reducible cubics of the form , where , . In this article we solve the TMP for the cases , , and , which we call the circular and the parabolic type, respectively. The main idea is to characterize the existence of a decomposition of into the sum , where and admit a –rm and a –rm, respectively. Due to the form of the cubic , it turns out that all but two moments of and are not already fixed by the original sequence, i.e., , , , in the circular type case and , , , in the parabolic type case. Then, by an involved analysis, the characterization of the existence of a decomposition can be done in both cases. We also characterize the number of atoms in a minimal representing measure, i.e., a measure with the minimal number of atoms in the support.
1.1. Readers Guide
The paper is organized as follows. In Section 2 we present some preliminary results needed to establish the main results of the paper. In Section 3 we show that to solve the TMP on every reducible cubic curve it is enough to consider 8 canonical type relations (see Proposition 3.1). In Section 4 we present the general procedure for solving the TMP on all but one of the canonical types and prove some results that apply to them. Then in Sections 5 and 6 we specialize to the circular and the parabolic type relations and solve them concretely (see Theorems 5.1 and 6.1). In both cases we show, by numerical examples, that there are pure sequences with a psd but without a rm (see Examples 5.3 and 6.3).
2. Preliminaries
We write for the set of real matrices. For a matrix we call the linear span of its columns a column space and denote it by . The set of real symmetric matrices of size will be denoted by . For a matrix the notation (resp. ) means is positive definite (pd) (resp. positive semidefinite (psd)). We write for a matrix with only zero entries and for short, where . The notation , , stands for the usual coordinate matrix with the only nonzero entry at the position , which is equal to 1.
In the rest of this section let and be a bivariate sequence of degree .
2.1. Moment matrix
Let be the moment matrix of (see (1.2)). Let be subsets of the set . We denote by the submatrix of consisting of the rows indexed by the elements of and the columns indexed by the elements of . In case , we write for short.
2.2. Affine linear transformations
The existence of representing measures is invariant under invertible affine linear transformations of the form
(2.1) |
with . Namely, let be a Riesz functional of the sequence defined by
We define by
By [CF04, Proposition 1.9], admits a (–atomic) –rm if and only if admits a (–atomic) –rm. We write and .
2.3. Generalized Schur complements
Let
be a real matrix where , , and . The generalized Schur complement [Zha05] of (resp. ) in is defined by
where (resp. ) stands for the Moore–Penrose inverse of (resp. ).
The following lemma will be frequently used in the proofs.
Lemma 2.1.
Let and
where , and . If , then the matrix equation
(2.2) |
where , is solvable and the solutions are precisely the solutions of the matrix equation . In particular, satisfies (2.2).
Proof.
The assumption implies that
(2.3) |
for some . So the equation (2.2) is solvable. In particular, . It remains to prove that any solution to is also a solution to . Note that all the solutions of the equation are
(2.4) |
where each column of is an arbitrary vector from . So satisfiying is also of the form for some with columns belonging to . We have that
(2.5) |
where we used the fact that each column of belongs to and Replacing with any of the form (2.4) in the calculation (2.5) gives the same result, which proves the statement of the proposition. ∎
The following theorem is a characterization of psd block matrices.
Theorem 2.2 ([Alb69]).
Let
be a real symmetric matrix where , and . Then:
-
(1)
The following conditions are equivalent:
-
(a)
.
-
(b)
, and .
-
(c)
, and .
-
(a)
-
(2)
If , then
2.4. Extension principle
Proposition 2.3.
Let be positive semidefinite, a subset of the set and the restriction of to the rows and columns from the set . If for a nonzero vector , then , where is a vector with the only nonzero entries in the rows from and such that the restriction to the rows from equals to .
2.5. Partially positive semidefinite matrices and their completions
A partial matrix is a matrix of real numbers , where some of the entries are not specified.
A partial symmetric matrix is partially positive semidefinite (ppsd) (resp. partially positive definite (ppd)) if the following two conditions hold:
-
(1)
is specified if and only if is specified and .
-
(2)
All fully specified principal minors of are psd (resp. pd).
For write . We denote by the submatrix of consisting of the rows indexed by the elements of and the columns indexed by the elements of . In case , we write for short.
It is well-known that a ppsd matrix of the form as in Lemma 2.4 below admits a psd completion (This follows from the fact that the corresponding graph is chordal, see e.g., [GJSW84, Dan92, BW11]). Since we will need an additional information about the rank of the completion and the explicit interval of all possible for our results, we give a proof of Lemma 2.4 based on the use of generalized Schur complements.
Lemma 2.4.
Let be a partially positive semidefinite symmetric matrix of size with the missing entries in the positions and , . Let
Let
and
Then:
-
(i)
is positive semidefinite if and only if .
-
(ii)
-
(iii)
The following statements are equivalent:
-
(a)
.
-
(b)
or .
-
(c)
or .
-
(a)
Proof.
We write
Let be a permutation matrix, which changes the order of columns to
Then
Note that
(2.6) |
Lemma 2.4 with the missing entries in the positions and was proved in [Zal21, Lemma 2.11] using computations with generalized Schur complements under one additional assumption:
(2.7) |
Here we explain why the assumption (2.7) can be removed from [Zal21, Lemma 2.11]. The proof of [Zal21, Lemma 2.11] is separated into two cases: and . The case does not use (2.7). Assume now that or equivalently . Invertibility of (and by also is invertible) is used in the proof of [Zal21, Lemma 2.11] for the application of the quotient formula ([CH69])
(2.8) |
where
However, the formula (2.8) has been generalized [CHM74, Theorem 4] to noninvertible , , where all Schur complements are the generalized ones, under the conditions:
(2.9) |
So if we show that the conditions (2.9) hold, the same proof as in [Zal21, Lemma 2.11] can be applied in the case is singular. From (resp. ) being psd, (resp. ) follows by Theorem 2.2, used for (resp. ). The assumption implies that . Since , it follows that . Hence, for every , which concludes the proof of (2.9). ∎
2.6. Hamburger TMP
Let . For we define the corresponding Hankel matrix as
(2.10) |
We denote by the –th column of , , i.e.,
As in [CF91], the rank of , denoted by , is defined by
For we denote the upper left–hand corner of of size by . A sequence is called positively recursively generated (prg) if for the following two conditions hold:
-
•
.
-
•
If , denoting
(2.11) the equality
(2.12) holds for .
The solution to the –TMP is the following.
Theorem 2.5 ([CF91, Theorems 3.9–3.10]).
For and with , the following statements are equivalent:
-
(1)
There exists a –representing measure for .
-
(2)
There exists a –atomic –representing measure for .
-
(3)
is positive semidefinite and one of the following holds:
-
(a)
is positive definite.
-
(b)
.
-
(a)
-
(4)
is positively recursively generated.
2.7. TMP on the unit circle
The solution to the –TMP is the following.
Theorem 2.6 ([CF02, Theorem 2.1]).
Let and , where . Then the following statements are equivalent:
-
(1)
has a –representing measure.
-
(2)
has a –atomic –representing measure.
-
(3)
is positive semidefinite and the relations hold for every with .
2.8. Parabolic TMP
We will need the following solution to the parabolic TMP (see [Zal23, Theorem 3.7]).
Theorem 2.7.
Let and , where . Let
Then the following statements are equivalent:
-
(1)
has a –representing measure.
-
(2)
has a –atomic –representing measure.
-
(3)
is positive semidefinite, the relations hold for every with and one of the following statements holds:
-
(a)
is positive definite.
-
(b)
-
(a)
-
(4)
The relations hold for every with and , defined by , admits a –representing measure.
Remark 2.8.
The equivalence is part of the proof of [Zal23, Theorem 3.7].
3. TMP on reducible cubics - case reduction
In this section we show that to solve the TMP on reducible cubic curves it suffices, after applying an affine linear transformation, to solve the TMP on 8 canonical forms of curves.
Proposition 3.1.
Let and . Assume does not satisfy any nontrivial column relation between columns indexed by monomials of degree at most 2, but it satisfies a column relation , where is a reducible polynomial with . If admits a representing measure, then there exists an invertible affine linear transformation of the form (2.1) such that the moment matrix satisfies a column relation , where has one of the following forms:
- Parallel lines type:
-
, , .
- Circular type:
-
, .
- Parabolic type:
-
- Hyperbolic type 1:
-
.
- Hyperbolic type 2:
-
, .
- Hyperbolic type 3:
-
, .
- Intersecting lines type:
-
,
- Mixed type:
-
, , .
Remark 3.2.
The name of the types of the form in Proposition 3.1 comes from the type of the conic . The conic , , is a hyperbola, since the discriminant is positive. Similarly, the conic , , is a hyperbola, since its discriminant is equal to 4. Clearly, the conic , , is a circle with the center and radius .
Now we prove Proposition 3.1.
Proof of Proposition 3.1.
Since is reducible, it is of the form , where
Without loss of generality we can assume that , since otherwise we apply the alt to exchange the roles of and . Since , the alt
is invertible and hence:
(3.1) |
We separate two cases according to the value of .
Case 1: . In this case (3.1) is equal to
(3.2) |
If , then (3.2) is equal to . Since by assumption and hence admit a rm, supported on
it follows by [CF96] that is a nontrivial column relation in . Hence, also satisfies a nontrivial column relation between columns indexed by monomials of degree at most 2, which is a contradiction with the assumption of the proposition. Therefore
Case 1.1: . Dividing the relation in (3.2) by , we get:
(3.3) |
Case 1.1.1: . In this case (3.3) is equivalent to:
(3.4) |
Case 1.1.1.1: . In this case (3.4) is equivalent to
(3.5) |
The quadratic equation must have two different real nonzero solutions, otherwise is a union of two parallel lines. Then it follows by [CF96] that there is a nontrivial column relation in between columns indexed by monomials of degree at most 2, which is a contradiction with the assumption of the proposition. So we have the parallel lines type relation from the proposition.
Case 1.1.1.2: . In this case the alt
is invertible and applying it to , we obtain:
Case 1.1.2: . We apply the alt
to and obtain:
(3.6) |
Case 1.1.2.1: . We apply the alt
to and obtain:
(3.7) |
Case 1.1.2.1.2: . We apply the alt
to and obtain:
Case 1.1.2.2: . In this case (3.6) is equivalent to:
(3.8) |
Case 1.1.2.2.1: . Applying the alt
to we obtain:
Case 1.1.2.2.2: . Applying the alt
to and obtain:
(3.9) |
Further on, the relation in (3.9) is equivalent to
(3.10) |
Finally, applying the alt
to , we obtain:
Case 1.2: . In this case (3.2) is equivalent to:
(3.11) |
Assume that . Since by assumption and hence admits a rm, supported on
it follows by [CF96] that is a nontrivial column relation in . Hence, also satisfies a nontrivial column relation between columns indexed by monomials of degree at most 2, which is a contradiction with the assumption of the proposition. Hence, Applying the alt to , we obtain a sequence with the moment matrix satisfying the column relation of the form (3.6) and we can proceed as in the Case 1.1.2 above.
Case 2: . Applying the alt
to , we obtain:
(3.12) |
Case 2.1: . In this case (3.12) is equivalent to:
(3.13) |
Case 2.1.1: . Dividing the relation in (3.13) with , (3.13) is equivalent to:
(3.14) |
Applying the alt
to , we obtain:
(3.15) |
Case 2.1.1.1: . Since by assumption of the proposition, admits a rm, supported on , in (3.15) cannot be equal to 0. Indeed, would imply that and by [CF96], would be a nontrivial column relation in . Hence, also would satisfy a nontrivial column relation between columns indexed by monomials of degree at most 2, which is a contradiction with the assumption of the proposition. Since , after applying the alt
to , we obtain:
Case 2.1.1.2: . Applying the alt
to we obtain:
Case 2.1.1.3: . Applying the alt
to , we obtain:
Case 2.1.2: . Dividing the relation in (3.13) with , (3.13) is equivalent to:
(3.16) |
Applying the alt
to we obtain:
Case 2.2: . Dividing the relation in (3.12) with , (3.12) is equivalent to:
(3.17) |
Now we apply the alt
to and obtain:
(3.18) |
4. Solving the TMP on canonical reducible cubic curves
Let be a sequence of degree , , and
(4.1) |
the set of rows and columns of the moment matrix in the degree-lexicographic order. Let
(4.2) |
be a polynomial of degree 3 in one of the canonical forms from Proposition 3.1. Hence, a polynomial of degree 2. will have a –rm if and only if it can be decomposed as
(4.3) |
where
and the sum in (4.3) is a component-wise sum. On the level of moment matrices, (4.3) is equivalent to
(4.4) |
Note that if has a –rm, then the matrix satisfies the relation and it must be rg, i.e.,
(4.5) |
We write . Let be a subset, such that the columns from span the column space and
(4.6) |
In this new order of rows and columns, (4.4) becomes equivalent to
(4.7) |
We write
(4.9) |
By the form of the atoms, we know that and will be of the forms
(4.10) |
for some Hankel matrix Define matrix functions and by
(4.11) |
Using (4.10), (4.7) becomes equivalent to
(4.12) |
for some Hankel matrix .
Lemma 4.1.
Assume the notation above. The sequence , where , has a –representing measure if and only if there exist a Hankel matrix , such that:
-
(1)
The sequence with the moment matrix has a –representing measure.
-
(2)
The sequence with the moment matrix has a –representing measure.
Proof.
First we prove the implication . If has a –rm , then is supported on the union of the line and the conic . Since the moment matrix, generated by the measure supported on , can be nonzero only when restricted to the columns and rows indexed by , it follows that the moment matrix generated by the restriction (resp. ) of the measure to the conic (resp. line ), is of the form (resp. ) for some Hankel matrix .
Lemma 4.2.
Assume the notation above and let the sequence , where , admit a –representing measure. Let be a Hankel matrix such that admits a –representing measure and admits a –representing measure. Let be of the form
(4.14) |
If:
-
(1)
, then
-
(2)
, then
-
(3)
, then
Proof.
By Lemma 4.1, has a –rm for some Hankel matrix . Hence, satisfies the rg relations for , . Let us assume that and . In particular, satisfies the relations
(4.15) |
Observing the rows of , the relations (4.15) imply that
(4.16) |
Using the forms of and (see (4.9) and (4.11)), it follows that and for each . Using this in (4.16) proves the statement (1) of the lemma. The proofs of the statements (2) and (3) are analogous. ∎
Lemma 4.2 states that for all canonical relations from Proposition 3.1 except for the mixed type relation, all but two entries of the Hankel matrix from Lemma 4.1 are uniquely determined by . The following lemma gives the smallest candidate for in Lemma 4.1 with respect to the usual Loewner order of matrices.
Lemma 4.3.
Assume the notation above and let , where , be a sequence of degree . Assume that is positive semidefinite and satisfies the column relations (4.5). Then:
-
(1)
for some if and only if .
-
(2)
and .
-
(3)
satisfies the column relations for such that .
-
(4)
We have that
Proof.
By the equivalence between (1a) and (1b) of Theorem 2.2 used for and , it follows in particular that
(4.17) |
and
(4.18) |
where
Using the equivalence between (1a) and (1b) of Theorem 2.2 again for the pairs and , it follows that
(4.19) |
Since implies, in particular, that , (4.19) implies that
(4.20) |
Claim. .\\
Proof of Claim. By (4.19) and (4.20), it suffices to prove that . By definition of and the relations , , which hold in , it follows, in particular, that
(4.21) |
(4.17) and (4.21) together imply that
(4.22) |
(4.17) and (4.22) can be equivalently expressed as
(4.23) |
We have that
where is the identity matrix of the same size as and we used (4.23) in the second equality. This proves the Claim. \\
Remark 4.4.
By Lemmas 4.1–4.3, solving the –TMP for the sequence , where , with being any but the mixed type relation from Proposition 3.1, the natural procedure is the following:
-
(1)
First compute . By Lemma 4.3.(3), there is one entry of , which might need to be changed to obtain a Hankel structure. Namely, in the notation (4.14), if:
-
(a)
, then the value of must be made equal to .
-
(b)
, then the value of must be made equal to .
-
(c)
, then the value of must be made equal to .
Let be the matrix obtained from after performing the changes described above.
-
(a)
-
(2)
Study if and admit a –rm and a –rm, respectively. If the answer is yes, admits a –rm. Otherwise by Lemma 4.2, there are two antidiagonals of the Hankel matrix , which can by varied so that the matrices and will admit the corresponding measures. Namely, in the notation (4.14), if:
-
(a)
, then the last two antidiagonals of can be changed.
-
(b)
, then the left–upper and the right–lower corner of can be changed.
-
(c)
, then the first two antidiagonals of can be changed.
To solve the –TMP for one needs to characterize, when it is possible to change these antidiagonals in such a way to obtain a matrix , such that and admit a –rm and a –rm, respectively.
-
(a)
5. Circular type relation: , .
In this section we solve the –TMP for the sequence of degree , , where , . Assume the notation from Section 4. If admits a –TMP, then must satisfy the relations
(5.1) |
In the presence of all column relations (5.1), the column space is spanned by the columns in the set
(5.2) |
where
Let be as in (4.10). Let
(5.3) |
As described in Remark 4.4, might need to be changed to
where
Let and be as in (4.11). Write
(5.4) |
Define also the matrix function
(5.5) |
The solution to the cubic circular type relation TMP is the following.
Theorem 5.1.
Let , , and , where . Assume also the notation above. Then the following statements are equivalent:
-
(1)
has a –representing measure.
-
(2)
is positive semidefinite, the relations
(5.6) and one of the following statements holds:
-
(a)
and one of the following holds:
-
(i)
.
-
(ii)
.
-
(i)
-
(b)
, is positive semidefinite and defining a real number
(5.7) a function
(5.8) and a set
(5.9) one of the following holds:
-
(i)
The set has two elements and is positive definite.
-
(ii)
and
(5.10)
-
(i)
-
(a)
Moreover, if a –representing measure for exists, then:
-
•
There exists at most –atomic –representing measure.
-
•
There exists a –atomic –representing measure if and only if any of the following holds:
-
–
.
-
–
and is positive definite.
-
–
In particular, a –pure sequence with a –representing measure admits a –atomic –representing measure.
Remark 5.2.
In this remark we explain the idea of the proof of Theorem 5.1 and the meaning of the conditions in the statement of the theorem.
By Lemmas 4.1–4.2, the existence of a –rm for is equivalent to the existence of such that admits a –rm and admits a –rm. Let
We denote by and the topological boundary and the interior of the set , respectively. By the necessary conditions for the existence of a –rm [CF04, Fia95, CF96], must be psd and the relations (5.6) must hold. Using also Theorem 2.6, Theorem 5.1.(1) is equivalent to
(5.11) |
In the proof of Theorem 5.1 we show that (5.11) is equivalent to Theorem 5.1.(2):
-
(1)
First we establish (see Claims 1 and 2 below) that the form of:
-
•
is one of the following:
where the left case occurs if and the right if . The case cannot occur.
-
•
is one of the following:
where the left case occurs if and the right if .
-
•
- (2)
-
(3)
If , then by the forms of and , is one of the following: (i) , (ii) a one-element set, (iii) a two-element set. In the case:
-
•
(i), a –rm for clearly cannot exist.
- •
- •
-
•
Proof of Theorem 5.1.
Let be as in Remark 5.2. As explained in Remark 5.2, Theorem 5.1.(1) is equivalent to (5.11), thus it remains to prove that (5.11) is equivalent to Theorem 5.1.(2).\\
First we establish a few claims needed in the proof. Claim 1 (resp. 2) describes (resp. ) concretely.\\
Proof of Claim 1. Note that
(5.17) |
By Lemma 4.3, we have that
(5.18) |
Using (5.17), (5.18) and the definition of , we have that
(5.19) |
which proves (5.12).
To prove (5.16) first note that by construction of , the columns and are in the span of the columns indexed by . Hence, there are vectors
(5.20) |
of the forms
Let . Clearly,
(5.21) |
We separate three cases according to . \\
Case 1: . In this case and . In this case (5.16) clearly holds.\\
Case 2: . In this case . Together with (5.19), this is equivalent to . By (5.21) and to prove (5.16), it suffices to find and . Note that at least one of from (5.20) is such a vector, since
Case 3: . In this case . Together with (5.19), this is equivalent to . Note that
(5.22) |
By Case 2, we have . By (5.21) and (5.22), to prove (5.16), it suffices to find and . We will check below, that , defined by
is such a vector. This follows by
and
This concludes the proof of Claim 1. \\
Proof of Claim 2. Write
Note that . By Lemma 4.3.(2), and hence, . By Theorem 2.2, used for , it follows that and Again, by Theorem 2.2, used for , it follows that iff . For a fixed satisfying , Lemma 2.4, used for , together with , implies (5.23)–(5.27) and proves Claim 2. \\
Claim 3. If , then .\\
Proof of Claim 3. By Claim 1, implies that . By (5.17) and , . By Lemma 4.3.(2), . Hence, , which proves Claim 3. \\
Claim 4. If , then:
-
•
The set (see (5.9)) has at most 2 elements.
-
•
if and only if
-
•
If has two elements, then .
-
•
If has one element, which we denote by , then one of the following holds:
-
–
.
-
–
and .
-
–
Proof of Claim 4. Note that the set is equal to (see (5.12) and (5.23)). Further on, is the union of the square root functions , defined for . Similarly, is the union of the square root functions , defined for . If , then the latter could be a half-line . If , then geometrically it is clear that contains one or two elements. Assume that contains only one element, denoted by . Clearly, . Further on, we either have or . By the forms of and , the latter case occurs if or equivalently . But then the whole line segment lies in , which proves Claim 4. \\
Claim 5. Let (see (5.4)) be positive definite, and . Then at least one of and admits a –rm.\\
Proof of Claim 5. Note that , , is of the form
Assume on the contrary that none of and admits a –rm. Theorem 2.5 implies that the column of , , is not in the span of the other columns. Using this fact, the facts that , , are not pd (by , ) and is pd, it follows that there is a column relation , in , . Since , , it follows in particular by Theorem 2.2, used for , , that
(5.28) |
Since the first column of , , is in the span of the others, (5.28) is equivalent to
(5.29) |
Since
is invertible as a principal submatrix of , it follows that
(5.30) |
with
If , this contradicts to (5.30) since . Hence, . By the Hankel structure of , , we have that
Then (5.30) and imply that
(5.31) |
where Since , is a principal submatrix of , (5.31) contradicts to being pd. This proves Claim 5. \\
Now we prove the implication . Since , it follows that By (5.12), . We separate two cases according to the value of .\\
Case 1: . We separate two cases according to the invertibility of .\\
Case 1.1: is not pd. Since is not pd, then by Theorem 2.5, the last column of is in the span of the previous ones. But then by rg, the last column of is in the span of the previous ones. This is the case Theorem 5.1.(2(a)ii).\\
Case 1.2: is pd. We separate two cases according to the invertibility of .\\
Case 1.2.2: . We will prove that this case cannot occur. It follows from the assumption in this case that . Further on, the last column of cannot be in the span of the previous ones (otherwise ). Hence, by Theorem 2.5, does not admit a –rm. Using this fact and Claim 3, . If , then , which contradicts to the third condition in (5.11). So must hold. Since , Claim 1 implies that is a horizontal half-line. By the form of , which is the union of the graphs of two square root functions on the interval , intersecting in the point and such that , it follows that . Note that by , we have and hence (see (5.8)), which implies that the square root functions are indeed not just a horizontal half-line. As above this contradicts to the third condition in (5.11). Hence, Case 1.2.2 cannot occur.\\
Case 2: . By assumptions, . By Claim 4, and has one or two elements. We separate two cases according to the number of elements in .\\
Case 2.1: has two elements. By Claim 4, . If is not pd, then the fact that has a –rm, implies that , which is a contradiction. Indeed, if and is not pd, then there is a nontrivial column relation among columns in . By Proposition 2.3, the same holds for . Let be the nontrivial column relation in . But then and it follows by [CF96] that is also a nontrivial column relation in . In particular, . Hence, is pd. This is the case Theorem 5.1.(2(b)i). \\
Case 2.2: has one element. Let us denote this element by . By Claim 4, or and . We separate two cases according to these two possibilities.\\
Case 2.2.1: . In this case and hence admits a –rm. Since , is not pd. Hence, by Theorem 2.5, the statement Theorem 5.1.(2(b)ii) holds.\\
Case 2.2.2: and . By (5.23), it follows that (see the definition (5.8) of ). Since is not pd, Theorem 2.5 used for , implies that the last column of is in the span of the others. Hence, the same holds by Proposition 2.3 for and admits a –rm by Theorem 2.5. Since is not pd, it in particular satisfies (5.10). Hence, we are in the case Theorem 5.1.(2(b)ii). \\
This concludes the proof of the implication .\\
Next we prove the implication . We separate four cases according to the assumptions in .\\
Case 1: Theorem 5.1.(2(a)i) holds. By Claim 3, . This and the assumption , imply by Theorem 2.5, that admits a –rm. This proves (5.11) in case of Theorem 5.1.(2(a)i).\\
Case 2: Theorem 5.1.(2(a)ii) holds. By Claim 3, . Since the last column of is by assumption in the span of the previous ones, the same holds for by Proposition 2.3. By Theorem 2.5, admits a –rm. This proves (5.11) in case of Theorem 5.1.(2(a)ii).\\
Case 3: Theorem 5.1.(2(b)i) holds. By assumption, . Since is pd, is not a half-line and hence . By Claim 5, at least one of and admits a –rm. This proves (5.11) in case of Theorem 5.1.(2(b)i). \\
Case 4: Theorem 5.1.(2(b)ii) holds. The assumptions imply by Theorem 2.5, that admits a –rm. This proves (5.11) in case of Theorem 5.1.(2(b)ii).\\
This concludes the proof of the implication \\
Up to now we established the equivalence in Theorem 5.1. It remains to prove the moreover part. We observe again the proof of the implication . By Lemma 4.3.(4),
(5.32) |
In the proof of the implications Theorem and Theorem we established that has a –rm. By Theorem 2.5, there also exists a –atomic one. By Theorem 2.6, the sequence with the moment matrix can be represented by a –atomic –rm. By (5.32) and if , in these two cases has a –atomic –rm.
In the proof of the implication Theorem we established that has a –rm for some . Analogously as for the point in the previous paragraph, it follows that has a –atomic –rm. Using (5.16), (5.27) and (by being pd), it follows that
(5.33) |
We separate two cases:
- •
-
•
If is not pd, then we must have , Otherwise we have and hence , which contradicts to being psd. Hence, in this case has a –atomic –rm. Moreover, there cannot exist a –atomic –rm. Indeed, since , at least (resp. ) atoms are needed to represent (resp. ) for any (see (5.16) and (5.27)). Hence, at least atoms are needed in a –rm for any .
In the proof of the implication Theorem we established that has a –rm. Analogously as for the point in two paragraphs above, it follows that has a –atomic –rm. By (5.16) and (5.27), this measure is –atomic.
-
•
If is pd, then . This and (5.32) imply that admits a –atomic –rm.
- •
This concludes the proof of the moreover part.
Since for a –pure sequence with , (5.32) implies that is pd, it follows by the moreover part that the existence of a –rm implies the existence of a –atomic –rm. ∎
The following example demonstrates the use of Theorem 5.1 to show that there exists a bivariate –pure sequence of degree 6 with a positive semidefinite and without a –rm.
Example 5.3.
Let be a bivariate degree 6 sequence given by
Assume the notation as in Theorem 5.1. is psd with the eigenvalues , , , , , , , , , and the column relation
We have that
and so
The matrix is equal to:
The eigenvalues of are , , and hence is not psd. By Theorem 5.1, does not have a –rm, since by (2b) of Theorem 5.1, should be psd.
6. Parabolic type relation: .
In this section we solve the –TMP for the sequence of degree , , where . Assume the notation from Section 4. If admits a –TMP, then must satisfy the relations
(6.1) |
In the presence of all column relations (6.1), the column space is spanned by the columns in the set
(6.2) |
where
Let be as in (4.9). Let
(6.3) |
As described in Remark 4.4, might need to be changed to
where
Let and be as in (4.11). Define also the matrix function
(6.4) |
Write
(6.5) |
Let us define the matrix
Let
and
(6.6) |
Write
(6.7) |
The solution to the cubic parabolic type relation TMP is the following.
Theorem 6.1.
Let and , where . Assume also the notation above. Then the following statements are equivalent:
-
(1)
has a –representing measure.
-
(2)
is positive semidefinite, the relations
(6.8) is positive semidefinite, defining real numbers
(6.9) and the property
(6.10) one of the following statements holds:
Moreover, if a –representing measure for exists, then:
-
•
There exists at most –atomic –representing measure.
-
•
There exists a –atomic –representing measure if and only if any of the following holds:
-
–
.
-
–
-
–
and one of the following holds:
-
*
is not positive definite and .
-
*
is positive definite, and .
-
*
-
–
In particular, a –pure sequence with a –representing measure admits a –atomic –representing measure.
Remark 6.2.
In this remark we explain the idea of the proof of Theorem 6.1 and the meaning of conditions in the statement of the theorem.
By Lemmas 4.1–4.2, the existence of a –rm for is equivalent to the existence of such that admits a –rm and admits a –rm. Let
We denote by and the topological boundary and the interior of the set , respectively. By the necessary conditions for the existence of a –rm [CF04, Fia95, CF96], must be psd and the relations (6.8) must hold. Then Theorem 6.1.(1) is equivalent to
(6.12) |
In the proof of Theorem 6.1 we show that (6.12) is equivalent to Theorem 6.1.(2):
-
(1)
First we establish (see Claims 1 and 2 below) that the form of:
-
•
is one of the following:
where the left case occurs if and the right if .
-
•
is one of the following:
where the left case occurs if and the right if .
-
•
- (2)
-
(3)
Assume that is positive definite and is only positive semidefinite but not definite. If:
- •
- •
-
•
, then (6.12) cannot hold.
- (4)
Proof of Theorem 6.1.
Let be as in Remark 6.2. As explained in Remark 6.2, Theorem 6.1.(1) is equivalent to (6.12), thus it remains to prove that (6.12) is equivalent to Theorem 6.1.(2).\\
First we establish a few claims needed in the proof. Claim 1 (resp. 2) describes (resp. ) concretely.\\
Proof of Claim 1. Note that
(6.20) |
By Lemma 4.3, we have that
(6.21) |
Using (6.20), (6.21) and the definition of , we have that
(6.22) |
which proves (6.14).
To prove (6.19) first note that by construction of , the columns and are in the span of the columns indexed by . Hence, there are vectors
(6.23) |
of the forms
(6.24) |
Let . Clearly,
(6.25) |
We separate three cases according to . \\
Case 1: . In this case and . In this case (6.19) clearly holds.\\
Case 2: . In this case . Together with (6.22), this is equivalent to or or By (6.25) and to prove (6.19), it suffices to find and . Note that at least one of from (6.24) is such a vector, since
Case 3: . In this case . Note that
(6.26) |
By Case 2, we have . By (6.25) and (6.26), to prove (6.19), it suffices to find and . We will check below, that , defined by
is such a vector. This follows by
and
This concludes the proof of Claim 1. \\
Note that
Define the matrix function
(6.27) |
Proof of Claim 2. Permuting rows and columns of we define
Note that
and
(6.34) |
By Lemma 4.3.(2), . Permuting rows and columns, this implies that
By Theorem 2.2, used for , it follows that and . Let
be a matrix function. Using Theorem 2.2 again for , it follows that
(6.35) |
and
(6.36) |
Further, (6.35) implies that
where we use the definition (6.27) of in the last equivalence. Moreover, . This proves (6.28) and (6.32). \\
Claim 3. If , then
The equality is achieved if:
-
•
, in the point .
-
•
, in the point .
-
•
, in the point .
Moreover, if , then for every there exists a point such that and .
Proof of Claim 3. If , then and Claim 3 is clear.
Assume that . Then clearly is maximized in some point satisfying . Let We are searching for the maximum of on the interval . The stationary points of are Then . If , then (note that if ). Further on, . Similarly, if , then and . The moreover part follows by noticing that and hence on the interval , attains all values between and . \\
In the proof of Theorem 6.1 we will need a few further observations:
-
•
Observe that
(6.37) - •
- •
First we prove the implication . By the necessary conditions for the existence of a –rm [CF04, Fia95, CF96], must be psd and the relations (6.8) must hold. By Lemma 4.3.(2), . Hence,
(6.40) |
where is as in (6.6). In particular, . We separate two cases according to the invertibility of .\\
Case 1: is not pd. Let be a sequence corresponding to the moment matrix . Let be a sequence defined by . Note that
where . Since is not pd, it follows that there is a non-trivial column relation in , which is also a column relation in by Proposition 2.3. By Theorem 2.7, has a –rm, which implies by Theorem 2.5, that is rg. Hence, the last column of is in the span of the columns in . It follows that
(6.41) |
On the other hand, by construction of , the column is also in the span of the columns in . Hence,
(6.42) |
By (6.41) and (6.42), it follows that or equivalently , and . Note that
(6.43) |
Further on, has a –rm by Theorem 2.7 and by Theorem 2.5. Indeed, the column of is in the span of the others and since satisfies the conditions in Theorem 2.5, the same holds for . But then the property (6.10) holds (note that ). This is the case Theorem 6.1.(2a). \\
Case 2: is pd. By Lemma 4.3.(2), (see (6.34)). In particular, . We separate two cases according to the invertibility of .\\
Case 2.1: is not pd. By (6.39) and Theorem 2.5, it follows that
(6.44) |
By (6.14),
(6.45) |
We separate two cases according to the value of . \\
Case 2.1.1: . By (6.44), it follows that . Note that
(6.46) |
Since in we have the column relation (6.42) by construction, (6.46) and Proposition 2.3 imply that
or equivalently (6.41) with . By (6.41) and (6.42), it follows that or equivalently . This is the case Theorem 6.1.(2(b)i). \\
Case 2.1.2: . Since the column of is in the span of the columns in , it first follows by observing the first row of that
(6.47) |
Further on,
(6.48) |
where we used (6.38) in the second equality. By (6.48) and Theorem 2.2 used for , it follows that . By Theorem 2.5, admits a –rm. Note that
(6.49) |
where we used that by (6.48). By Theorem 2.7, must be pd. (Here we used that since and , it follows that ) Therefore Claim 1 implies that and . Together with (6.47), this is the case Theorem 6.1.(2(b)ii). \\
Case 2.2: is pd. We separate two cases according to the value of \\
If does not admit a –rm, it follows by Theorem 2.5, that is not pd and . Equivalently,
which by (6.38) implies that . By Theorem 2.7, since admits a –rm, and is not pd, it follows that . But then does not admit a –rm, which is a contradiction.
Hence, admits a –rm, which is equivalent to (6.10) (using ). This is the case Theorem 6.1.(2(c)i). \\
Case 2.2.2: . By (6.19) it follows that This fact and Claim 3 imply the second condition in the case Theorem 6.1.(2(c)ii). \\
This concludes the proof of the implication .\\
Next we prove the implication . We separate five cases according to the assumptions in .\\
Case 1: holds. By Lemma 4.3.(2), and . Since , both matrices have a moment structure. Since by construction, the column of is in the span of the others, it has a –rm by Theorem 2.7. Since satisfies (6.10) (using ), it admits a –rm by Theorem 2.5. This proves (6.12) in this case. \\
Case 2: holds. By the same reasoning as in the Case 1 above, has a –rm. Since , the column of is in the span of the other columns. By Theorem 2.5, admits a –rm. This proves (6.12) in this case. \\
Case 3: holds. By (6.38), (6.39) and the fourth assumption of (2(b)ii), it follows that is psd and the columns are in the span of the columns in . By Theorem 2.5, admits a –rm. Since by (6.14) and the assumptions in (2(b)ii), it follows that is psd and by construction, is pd. By Theorem 2.7, it has a –rm. This proves (6.12) in this case. \\
Case 4: holds. has a –rm and has a –rm by the same reasoning as in the Case 1 above. This proves (6.12) in this case.\\
Case 5: holds. We separate three cases according to the sign of .
- •
- •
-
•
If , then the proof of (6.12) is analogous to the case by replacing with .\\
This concludes the proof of the implication \\
By now we established the equivalence in Theorem 6.1. It remains to prove the moreover part. We observe again the proof of the implication By Lemma 4.3.(4),
(6.50) |
In the proofs of the implications Theorem , and , we established that and admit a –rm and a –rm, respectively. By Theorems 2.5 and 2.7, there also exist a –atomic and a –atomic rms. By (6.50), has a –atomic –rm.
Assume that holds. We separate two cases according to the value of :
-
•
. We separate two cases according to the existence of a –rm of :
-
–
The last column of is in the span of the previous ones. Then as in the previous paragraph, and admit a –atomic –rm and a –atomic –rm, respectively. Hence, has a –atomic –rm.
-
–
The last column of is not in the span of the previous ones. Since also , it follows that . But then and (see (6.19)). This implies that admits a –atomic –rm.
-
–
-
•
. We separate two cases according to , which can be either or (since ).
-
–
. Then as in the second Case of the case above, in the point there is a –atomic –rm for . (Note that is automatically strictly larger than , otherwise the measure was –atomic, which is not possible.)
-
–
. In this case we have
where we used (6.19) in the second and (6.50) in the third equality. Hence, has a –atomic rm if and –atomic rm if . It remains to show that in the case , there does not exist a –atomic rm. Since is not pd and , if has a –rm, then . Since , then with a –rm is at least –atomic (see (6.19)). If , then . Hence,
where we used (6.50) in the last equality.
-
–
-
•
Assume that holds. We separate two cases according to the value of .
-
–
. We separate two cases according to , i.e., . Note that cannot be , since and imply that .
-
*
. Then as in the second case of the case of above, in the point there is a –atomic –rm for . (Note that is automatically strictly larger than , otherwise the measure was –atomic, which is not possible.)
-
*
. In this case we have
where we used (6.19) in the first and (6.50) in the second equality. Hence, has a –atomic rm if and –atomic rm if . It remains to show that in the case , there does not exist a –atomic rm. Since , if is psd, it follows that by (6.14). But then if also admits a –rm, this rm is at least –atomic (see (6.19)). If or , then . Hence,
where we used (6.50) in the last equality.
-
*
-
–
. We separate two cases according to , i.e. . Note that cannot be , since otherwise , which cannot be psd by . By Claim 3, there is a point , such that and . By (6.19) and (6.32) we have
where we used (6.50) in the second equality. It remains to show that in the case , there does not exist a –atomic rm. Since , if is psd, it follows that by (6.14). But then if also admits a –rm, this rm is at least –atomic (see (6.19)). Since , by (6.32). Hence,
where we used (6.50) in the last equality.
-
–
This concludes the proof of the moreover part.
Since for a –pure sequence with , (6.50) implies that is pd, it follows by the moreover part that the existence of a –rm implies the existence of a –atomic –rm. ∎
The following example demonstrates the use of Theorem 6.1 to show that there exists a bivariate –pure sequence of degree 6 with a positive semidefinite and without a –rm.
Example 6.3.
Let be a bivariate degree 6 sequence given by
Assume the notation as in Theorem 6.1. is psd with the eigenvalues , , , , , , , , , , and the column relation . We have that
and so
The matrices and are equal to:
They are both pd with the eigenvalues , , , , and , , respectively. The matrix is equal to
and thus
(6.51) |
By Theorem 6.1, does not have a –rm, since by (2(c)ii) of Theorem 6.1, (6.51) should be positive.
References
- [Alb69] A. Albert, Conditions for positive and nonnegative definiteness in terms of pseudoinverses, SIAM J. Appl. Math. 17 (1969), 434–440.
- [Akh65] N.I. Akhiezer. The classical moment problem and some related questions in analysis, New York: Hafner Publishing Co., 1965.
- [AK62] N.I. Akhiezer, M. Krein. Some questions in the theory of moments, Transl. Math. Monographs 2. Providence: American Math. Soc., 1962.
- [BZ21] A. Bhardwaj, A. Zalar. The tracial moment problem on quadratic varieties, J. Math. Anal. Appl. 498 (2021). Available from: https://doi.org/10.1016/j.jmaa.2021.124936.
- [BW11] M. Bakonyi, H.J. Woerdeman, Matrix Completions, Moments, and Sums of Hermitian Squares, Princeton University Press, Princeton, 2011.
- [Ble15] G. Blekherman. Positive Gorenstein ideals, Proc. Amer. Math. Soc. 143 (2015) 69–86. Available from: https://doi.org/10.1090/S0002-9939-2014-12253-2.
- [BF20] G. Blekherman, L. Fialkow. The core variety and representing measures in the truncated moment problem, Journal of Operator Theory 84 (2020) 185–209.
- [CGIK+] R. Curto, M. Ghasemi, M. Infusino, S. Kuhlmann. The truncated moment problems for unital commutative -algebras, Journal of Operathor Theory, to appear. Available from: https://arxiv.org/pdf/2009.05115.pdf.
- [CHM74] D. Carlson, E. Haynsworth, T. Markham, A generalization of the Schur complement by means of the Moore-Penrose inverse, SIAM J. Appl. Math.. 26(1) (1974) 169–175.
- [CH69] D. Crabtree, E. Haynsworth, An identity for the Schur complement of a matrix. Proc. Am. Math. Soc. 22 (1969) 364–366.
- [CF91] R. Curto, L. Fialkow, Recursiveness, positivity, and truncated moment problems, Houston J. Math. 17 (1991) 603–635.
- [CF96] R. Curto, L. Fialkow, Solution of the truncated complex moment problem for flat data, Mem. Amer. Math. Soc. 119 (1996).
- [CF02] R. Curto, L. Fialkow, Solution of the singular quartic moment problem, J. Operator Theory 48 (2002) 315–354.
- [CF04] R. Curto, L. Fialkow, Solution of the truncated parabolic moment problem, Integral Equations Operator Theory 50 (2004), 169–196.
- [CF05] R. Curto, L. Fialkow, Solution of the truncated hyperbolic moment problem, Integral Equations Operator Theory 52 (2005) 181–218.
- [CF05b] R. Curto, L. Fialkow, Truncated -moment problems in several variables, J. Operator Theory 54 (2005) 189–226.
- [CF08] R. Curto, L. Fialkow, An analogue of the Riesz-Haviland theorem for the truncated moment problem, J. Funct. Anal. 225 (2008) 2709–2731.
- [CF13] R. Curto, L. Fialkow, Recursively determined representing measures for bivariate truncated moment sequences, J. Operator Theory 70(2) (2013) 401–436.
- [CFM08] R. Curto, L. Fialkow, H. M. Möller, The extremal truncated moment problem, Integral Equations Operator Theory 60(2) (2008) 177-200.
- [CY14] R. Curto, S. Yoo, Cubic column relations in the truncated moment problems, J. Funct. Anal. 266(3) (2014) 1611–1626.
- [CY15] R. Curto, S. Yoo, Non-extremal sextic moment problems, J. Funct. Anal. 269(3) (2015) 758–780.
- [CY16] R. Curto, S. Yoo, Concrete solution to the nonsingular quartic binary moment problem, Proc. Amer. Math. Soc. 144 (2016) 249–258.
- [Dan92] J. Dancis, Positive semidefinite completions of partial hermitian matrices, Linear Algebra Appl. 175 (1992) 97–114.
- [DS18] P.J. di Dio, K. Schmüdgen. The multidimensional truncated Moment Problem:Atoms, Determinacy, and Core Variety, J. Funct. Anal. 274 (2018) 3124–3148. Available from: https://doi.org/10.1016/j.jfa.2017.11.013.
- [Fia95] L. Fialkow, Positivity, extensions and the truncated complex moment problem, Contemporary Math. 185 (1995), 133–150.
- [Fia11] L. Fialkow, Solution of the truncated moment problem with variety , Trans. Amer. Math. Soc. 363 (2011) 3133–3165.
- [Fia15] L. Fialkow, The truncated moment problem on parallel lines, In: Theta Foundation International Book Series of Mathematical Texts 20 (2015), 99–116.
- [Fia17] L. Fialkow. The core variety of a multisequence in the truncated moment problem, J. Math. Anal. Appl. 456 (2017) 946–969. Available from: https://doi.org/10.1016/j.jmaa.2017.07.041.
- [FN10] L. Fialkow, J. Nie, Positivity of Riesz functionals and solutions of quadratic and quartic moment problems, J. Funct. An. 258 (2010), 328–356.
- [GJSW84] R. Grone, C. R. Johnson, E. M. Sá, H. Wolkowicz, Positive definite completions of partial hermitian matrices, Linear Algebra Appl. 58 (1984), 109–124.
- [Kim14] D.P. Kimsey. The cubic complex moment problem, Integral Equations Operator Theory 80 (2014) 353-–378. Available from: https://doi.org/10.1007/s00020-014-2183-4.
- [Kim21] D.P. Kimsey. On a minimal solution for the indefinite truncated multidimensional moment problem, J. Math. Anal. Appl. 500 (2021) Available from: https://doi.org/10.1016/j.jmaa.2021.125091.
- [KN77] K.G. Krein, A.A. Nudelman. The Markov moment problem and extremal problems, Translations of Mathematical Monographs, Amer. Math. Soc.; 1977.
- [Lau05] M. Laurent, Revising two theorems of Curto and Fialkow on moment matrices, Proc. Amer. Math. Soc. 133 (2005), 2965–2976.
- [Nie14] J. Nie. The -truncated -moment problem, Found. Comput. Math. 14 (2014) 1243–1276.
- [Sch17] K. Schmüdgen. The moment problem, Graduate Texts in Mathematics 277. Cham: Springer; 2017.
- [Wol] Wolfram Research, Inc., Mathematica, Version 12.0, Wolfram Research, Inc., Champaign, IL, 2020.
- [Yoo17a] S. Yoo, Sextic moment problems on 3 parallel lines, Bull. Korean Math. Soc. 54 (2017), 299–318.
- [Yoo17b] S. Yoo, Sextic moment problems with a reducible cubic column relation, Integral Equations Operator Theory 88 (2017), 45–63.
- [YZ+] S. Yoo, A. Zalar, The truncated moment problem on reducible cubic curves II: Hyperbolic type relations, in preparation.
- [Zal21] A. Zalar. The truncated Hamburger moment problem with gaps in the index set, Integral Equations Operator Theory 93 (2021) 36 pp. Available from: https://doi.org/10.1007/s00020-021-02628-6.
- [Zal22a] A. Zalar. The truncated moment problem on the union of parallel lines, Linear Algebra and its Applications 649 (2022) 186–239. Available from: https://doi.org/10.1016/j.laa.2022.05.008.
- [Zal22b] A. Zalar. The strong truncated Hamburger moment problem with and without gaps, J. Math. Anal. Appl. 516 (2022) 21pp. Available from: https://doi.org/10.1016/j.jmaa.2022.126563.
- [Zal23] A. Zalar. The truncated moment problem on curves and , Linear and Multilinear Algebra (2023) 45pp. Available from: https://doi.org/10.1080/03081087.2023.2212316.
- [Zha05] F. Zhang, The Schur Complement and Its Applications, Springer-Verlag, New York, 2005.