Low-rank sums-of-squares representations Cynthia Vinzant, North - - PowerPoint PPT Presentation

low rank sums of squares representations
SMART_READER_LITE
LIVE PREVIEW

Low-rank sums-of-squares representations Cynthia Vinzant, North - - PowerPoint PPT Presentation

Low-rank sums-of-squares representations Cynthia Vinzant, North Carolina State University joint work with Greg Blekherman, Daniel Plaumann, and Rainer Sinn JMM 2017 Cynthia Vinzant Low-rank sums-of-squares representations Sums of squares and


slide-1
SLIDE 1

Low-rank sums-of-squares representations

Cynthia Vinzant,

North Carolina State University

joint work with Greg Blekherman, Daniel Plaumann, and Rainer Sinn JMM 2017

Cynthia Vinzant Low-rank sums-of-squares representations

slide-2
SLIDE 2

Sums of squares and nonnegative polynomials

A representation of a element f ∈ R as a sum of squares over a ring R (usually R[x0, . . . , xn] or a quotient) is an expression f = h2

1 + . . . + h2 r

where hj ∈ R.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-3
SLIDE 3

Sums of squares and nonnegative polynomials

A representation of a element f ∈ R as a sum of squares over a ring R (usually R[x0, . . . , xn] or a quotient) is an expression f = h2

1 + . . . + h2 r

where hj ∈ R. Over R = R[x0, . . . , xn], this certifies the nonnegativity of f on Rn+1. e.g. x4 − 4x3y + 5x2y 2 − 2xy 3 + y 4

Cynthia Vinzant Low-rank sums-of-squares representations

slide-4
SLIDE 4

Sums of squares and nonnegative polynomials

A representation of a element f ∈ R as a sum of squares over a ring R (usually R[x0, . . . , xn] or a quotient) is an expression f = h2

1 + . . . + h2 r

where hj ∈ R. Over R = R[x0, . . . , xn], this certifies the nonnegativity of f on Rn+1. e.g. x4 − 4x3y + 5x2y 2 − 2xy 3 + y 4 = (x2 − 2xy)2 + (xy − y 2)2

Cynthia Vinzant Low-rank sums-of-squares representations

slide-5
SLIDE 5

Sums of squares and nonnegative polynomials

A representation of a element f ∈ R as a sum of squares over a ring R (usually R[x0, . . . , xn] or a quotient) is an expression f = h2

1 + . . . + h2 r

where hj ∈ R. Over R = R[x0, . . . , xn], this certifies the nonnegativity of f on Rn+1. e.g. x4 − 4x3y + 5x2y 2 − 2xy 3 + y 4 = (x2 − 2xy)2 + (xy − y 2)2 Let Σn,2d denote the sums of squares in R[x0, . . . , xn]2d and Pn,2d denote polynomials in R[x0, . . . , xn]2d nonnegative on Rn+1.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-6
SLIDE 6

Sums of squares and nonnegative polynomials

A representation of a element f ∈ R as a sum of squares over a ring R (usually R[x0, . . . , xn] or a quotient) is an expression f = h2

1 + . . . + h2 r

where hj ∈ R. Over R = R[x0, . . . , xn], this certifies the nonnegativity of f on Rn+1. e.g. x4 − 4x3y + 5x2y 2 − 2xy 3 + y 4 = (x2 − 2xy)2 + (xy − y 2)2 Let Σn,2d denote the sums of squares in R[x0, . . . , xn]2d and Pn,2d denote polynomials in R[x0, . . . , xn]2d nonnegative on Rn+1. Theorem (Hilbert): Σn,2d = Pn,2d if and only if n = 1

  • r

2d = 2

  • r

(n, 2d) = (2, 4). Motzkin non-example: x2y 4 + x4y 2 − 3x2y 2z2 + z6 ∈ P2,6\Σ2,6

Cynthia Vinzant Low-rank sums-of-squares representations

slide-7
SLIDE 7

Number of squares

n = 1: A nonnegative bivariate form is a sum of two squares Proof: Factor f = (p + ✐q)(p − ✐q) = p2 + q2 where p, q ∈ R[x0, x1]d 2d = 2: A nonnegative quadratic form in Pn,2 is a sum of n + 1 squares Proof: Diagonalization of quadratic forms (n, 2d) = (2, 4): A nonnegative ternary quartic is a sum of three squares Proof by Hilbert, 1888

Cynthia Vinzant Low-rank sums-of-squares representations

slide-8
SLIDE 8

Number of squares

n = 1: A nonnegative bivariate form is a sum of two squares Proof: Factor f = (p + ✐q)(p − ✐q) = p2 + q2 where p, q ∈ R[x0, x1]d 2d = 2: A nonnegative quadratic form in Pn,2 is a sum of n + 1 squares Proof: Diagonalization of quadratic forms (n, 2d) = (2, 4): A nonnegative ternary quartic is a sum of three squares Proof by Hilbert, 1888 Our goal: Unify/generalize these results using varieties of minimal degree

Cynthia Vinzant Low-rank sums-of-squares representations

slide-9
SLIDE 9

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k,

Cynthia Vinzant Low-rank sums-of-squares representations

slide-10
SLIDE 10

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k, ΣX = {ℓ2

1 + . . . + ℓ2 r : ℓi ∈ R[X]1} ⊂ R[X]2, and

PX = {q ∈ R[X]2 : q(x) ≥ 0 for all x ∈ X(R)} ⊂ R[X]2

Cynthia Vinzant Low-rank sums-of-squares representations

slide-11
SLIDE 11

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k, ΣX = {ℓ2

1 + . . . + ℓ2 r : ℓi ∈ R[X]1} ⊂ R[X]2, and

PX = {q ∈ R[X]2 : q(x) ≥ 0 for all x ∈ X(R)} ⊂ R[X]2 If X = νd(Pn), then ΣX ∼ = Σn,2d and PX ∼ = Pn,2d.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-12
SLIDE 12

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k, ΣX = {ℓ2

1 + . . . + ℓ2 r : ℓi ∈ R[X]1} ⊂ R[X]2, and

PX = {q ∈ R[X]2 : q(x) ≥ 0 for all x ∈ X(R)} ⊂ R[X]2 If X = νd(Pn), then ΣX ∼ = Σn,2d and PX ∼ = Pn,2d. Ex: Let X = ν2(P1), where ν2([x : y]) = [x2 : xy : y 2] = [a : b : c]. Then (x2 − 2xy)2 + (xy − y 2)2 ∈ Σ1,4 ↔ (a − 2b)2 + (b − c)2 ∈ ΣX

Cynthia Vinzant Low-rank sums-of-squares representations

slide-13
SLIDE 13

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k, ΣX = {ℓ2

1 + . . . + ℓ2 r : ℓi ∈ R[X]1} ⊂ R[X]2, and

PX = {q ∈ R[X]2 : q(x) ≥ 0 for all x ∈ X(R)} ⊂ R[X]2 If X = νd(Pn), then ΣX ∼ = Σn,2d and PX ∼ = Pn,2d. Ex: Let X = ν2(P1), where ν2([x : y]) = [x2 : xy : y 2] = [a : b : c]. Then (x2 − 2xy)2 + (xy − y 2)2 ∈ Σ1,4 ↔ (a − 2b)2 + (b − c)2 ∈ ΣX Theorem (Blekherman-Smith-Velasco): ΣX = PX if and only if X is a variety of minimal degree (i.e. deg(X) = codim(X) + 1).

Cynthia Vinzant Low-rank sums-of-squares representations

slide-14
SLIDE 14

Quadratic forms on varieties

Let . . . X ⊂ PN(C) = a real, nondegenerate irreducible variety equal to X(R)

Zar,

R[X]k = R[x0, . . . , xN]k/I(X) = coordinate ring of X in degree k, ΣX = {ℓ2

1 + . . . + ℓ2 r : ℓi ∈ R[X]1} ⊂ R[X]2, and

PX = {q ∈ R[X]2 : q(x) ≥ 0 for all x ∈ X(R)} ⊂ R[X]2 If X = νd(Pn), then ΣX ∼ = Σn,2d and PX ∼ = Pn,2d. Ex: Let X = ν2(P1), where ν2([x : y]) = [x2 : xy : y 2] = [a : b : c]. Then (x2 − 2xy)2 + (xy − y 2)2 ∈ Σ1,4 ↔ (a − 2b)2 + (b − c)2 ∈ ΣX Theorem (Blekherman-Smith-Velasco): ΣX = PX if and only if X is a variety of minimal degree (i.e. deg(X) = codim(X) + 1). νd(Pn) has minimal degree ⇔ n = 1, d = 1, or (n, d) = (2, 2) Corollary: Hilbert’s result.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-15
SLIDE 15

Varieties of minimal degree

Theorem: If X is a variety of minimal degree, then any q ∈ PX is a sum of dim(X) + 1 squares. For generic q this bound is tight.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-16
SLIDE 16

Varieties of minimal degree

Theorem: If X is a variety of minimal degree, then any q ∈ PX is a sum of dim(X) + 1 squares. For generic q this bound is tight. A variety of minimal degree is isomorphic to one of the following:

◮ a quadratic hypersurface ◮ νd(P1) ◮ ν2(P2) ◮ a rational normal scroll ◮ a cone over one of the above.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-17
SLIDE 17

Varieties of minimal degree

Theorem: If X is a variety of minimal degree, then any q ∈ PX is a sum of dim(X) + 1 squares. For generic q this bound is tight. A variety of minimal degree is isomorphic to one of the following:

◮ a quadratic hypersurface ◮ νd(P1)

⇒ f ∈ P1,2d = sum of 2 squares

◮ ν2(P2) ◮ a rational normal scroll ◮ a cone over one of the above.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-18
SLIDE 18

Varieties of minimal degree

Theorem: If X is a variety of minimal degree, then any q ∈ PX is a sum of dim(X) + 1 squares. For generic q this bound is tight. A variety of minimal degree is isomorphic to one of the following:

◮ a quadratic hypersurface ◮ νd(P1)

⇒ f ∈ P1,2d = sum of 2 squares

◮ ν2(P2)

⇒ f ∈ P2,4 = sum of 3 squares

◮ a rational normal scroll ◮ a cone over one of the above.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-19
SLIDE 19

Varieties of minimal degree

Theorem: If X is a variety of minimal degree, then any q ∈ PX is a sum of dim(X) + 1 squares. For generic q this bound is tight. A variety of minimal degree is isomorphic to one of the following:

◮ a quadratic hypersurface ◮ νd(P1)

⇒ f ∈ P1,2d = sum of 2 squares

◮ ν2(P2)

⇒ f ∈ P2,4 = sum of 3 squares

◮ a rational normal scroll

⇒ ??

◮ a cone over one of the above.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-20
SLIDE 20

Rational normal scrolls and biforms

Rational normal scroll X = closure of the image of C × Pn−1 under (t, x) → [x1 : x1t : . . . : x1td1 : . . . : xn : xnt : . . . : xntdn] ∈ Pd1+...+dn+n−1

Cynthia Vinzant Low-rank sums-of-squares representations

slide-21
SLIDE 21

Rational normal scrolls and biforms

Rational normal scroll X = closure of the image of C × Pn−1 under (t, x) → [x1 : x1t : . . . : x1td1 : . . . : xn : xnt : . . . : xntdn] ∈ Pd1+...+dn+n−1 A quadratic form on X corresponds to a biform (Choi, Lam, Reznick), which can be written as f =    x1 . . . xn   

T 

  a11 . . . a1n . . . ... . . . a1n . . . ann       x1 . . . xn    where aij ∈ R[t]≤di+dj.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-22
SLIDE 22

Rational normal scrolls and biforms

Rational normal scroll X = closure of the image of C × Pn−1 under (t, x) → [x1 : x1t : . . . : x1td1 : . . . : xn : xnt : . . . : xntdn] ∈ Pd1+...+dn+n−1 A quadratic form on X corresponds to a biform (Choi, Lam, Reznick), which can be written as f =    x1 . . . xn   

T 

  a11 . . . a1n . . . ... . . . a1n . . . ann       x1 . . . xn    where aij ∈ R[t]≤di+dj. f is nonnegative ⇔ A = (aij)ij is positive semidefinite for all t ∈ R f is a sum of r squares ⇔ A = BBT where B ∈ R[t]n×r

Cynthia Vinzant Low-rank sums-of-squares representations

slide-23
SLIDE 23

Rational normal scrolls and biforms

Rational normal scroll X = closure of the image of C × Pn−1 under (t, x) → [x1 : x1t : . . . : x1td1 : . . . : xn : xnt : . . . : xntdn] ∈ Pd1+...+dn+n−1 A quadratic form on X corresponds to a biform (Choi, Lam, Reznick), which can be written as f =    x1 . . . xn   

T 

  a11 . . . a1n . . . ... . . . a1n . . . ann       x1 . . . xn    where aij ∈ R[t]≤di+dj. f is nonnegative ⇔ A = (aij)ij is positive semidefinite for all t ∈ R f is a sum of r squares ⇔ A = BBT where B ∈ R[t]n×r Cor: If A is p.s.d. for all t ∈ R, then A = BBT where B ∈ R[t]n×(n+1).

Cynthia Vinzant Low-rank sums-of-squares representations

slide-24
SLIDE 24

Biforms: an example (n = 2, d1 = 1, d2 = 2 )

Let X ⊂ P4 be the closure of the image of C × P1 under (t, [x : y]) → [x : xt : y : yt : yt2] = [u0 : . . . : u4] ∈ P4.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-25
SLIDE 25

Biforms: an example (n = 2, d1 = 1, d2 = 2 )

Let X ⊂ P4 be the closure of the image of C × P1 under (t, [x : y]) → [x : xt : y : yt : yt2] = [u0 : . . . : u4] ∈ P4. The quadratic form q = 4

i=0 u2 i in R[X]2 corresponds to the biform

f = (1 + t2)x2 + (1 + t2 + t4)y 2 =

  • x

y T 1 + t2 1 + t2 + t4 x y

  • .

Cynthia Vinzant Low-rank sums-of-squares representations

slide-26
SLIDE 26

Biforms: an example (n = 2, d1 = 1, d2 = 2 )

Let X ⊂ P4 be the closure of the image of C × P1 under (t, [x : y]) → [x : xt : y : yt : yt2] = [u0 : . . . : u4] ∈ P4. The quadratic form q = 4

i=0 u2 i in R[X]2 corresponds to the biform

f = (1 + t2)x2 + (1 + t2 + t4)y 2 =

  • x

y T 1 + t2 1 + t2 + t4 x y

  • .

The representation of f = y 2 + (xt + yt)2 + (x − yt2)2 gives 1 + t2 1 + t2 + t4

  • = BBT

where B = t 1 1 t −t2

  • .

Cynthia Vinzant Low-rank sums-of-squares representations

slide-27
SLIDE 27

Numbers of SOS representations

Theorem (Choi-Lam-Reznick): A generic positive bivariate form of degree 2d has 2d−1 representations as a sum of 2 squares.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-28
SLIDE 28

Numbers of SOS representations

Theorem (Choi-Lam-Reznick): A generic positive bivariate form of degree 2d has 2d−1 representations as a sum of 2 squares. Theorem (Powers-Reznick-Scheiderer-Sottile): A generic positive ternary quartic has 8 representations as a sum of 3 squares.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-29
SLIDE 29

Numbers of SOS representations

Theorem (Choi-Lam-Reznick): A generic positive bivariate form of degree 2d has 2d−1 representations as a sum of 2 squares. Theorem (Powers-Reznick-Scheiderer-Sottile): A generic positive ternary quartic has 8 representations as a sum of 3 squares. Theorem: If X ⊂ PN is a surface of minimal degree, then a generic q ∈ PX has 2N−2 representations as a sum of 3 squares.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-30
SLIDE 30

Numbers of SOS representations

Theorem (Choi-Lam-Reznick): A generic positive bivariate form of degree 2d has 2d−1 representations as a sum of 2 squares. Theorem (Powers-Reznick-Scheiderer-Sottile): A generic positive ternary quartic has 8 representations as a sum of 3 squares. Theorem: If X ⊂ PN is a surface of minimal degree, then a generic q ∈ PX has 2N−2 representations as a sum of 3 squares. Conjecture: If X ⊂ PN is a variety of minimal degree, then a generic q ∈ PX has 2codim(X) representations as a sum of dim(X) + 1 squares.

(Possible proof by Hanselka and Sinn)

Cynthia Vinzant Low-rank sums-of-squares representations

slide-31
SLIDE 31

Real vs. complex representations

Remarkably, the number of real representations as sums of few squares is more stable over R than C.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-32
SLIDE 32

Real vs. complex representations

Remarkably, the number of real representations as sums of few squares is more stable over R than C.

  • Example. There are four surfaces of minimal degree in P5:

the cone over ν4(P1), ν2(P2), and the rational normal scrolls Xd1,d2 with (d1, d2) = (2, 2), (1, 3). A general element q ∈ PX is a sum of 3 squares q = h2

1 + h2 2 + h2 3.

If h1, h2, h3 ∈ F[X]1, say the representation is over the field F.

Cynthia Vinzant Low-rank sums-of-squares representations

slide-33
SLIDE 33

Real vs. complex representations

Remarkably, the number of real representations as sums of few squares is more stable over R than C.

  • Example. There are four surfaces of minimal degree in P5:

the cone over ν4(P1), ν2(P2), and the rational normal scrolls Xd1,d2 with (d1, d2) = (2, 2), (1, 3). A general element q ∈ PX is a sum of 3 squares q = h2

1 + h2 2 + h2 3.

If h1, h2, h3 ∈ F[X]1, say the representation is over the field F. X # reps. over R # reps. over C cone(ν4(P1)) 8 35 ν2(P2) 8 63 X2,2 8 64 X3,1 8 64

Cynthia Vinzant Low-rank sums-of-squares representations

slide-34
SLIDE 34

Real vs. complex representations

Remarkably, the number of real representations as sums of few squares is more stable over R than C.

  • Example. There are four surfaces of minimal degree in P5:

the cone over ν4(P1), ν2(P2), and the rational normal scrolls Xd1,d2 with (d1, d2) = (2, 2), (1, 3). A general element q ∈ PX is a sum of 3 squares q = h2

1 + h2 2 + h2 3.

If h1, h2, h3 ∈ F[X]1, say the representation is over the field F. X # reps. over R # reps. over C cone(ν4(P1)) 8 35 ν2(P2) 8 63 X2,2 8 64 X3,1 8 64 Thanks!

Cynthia Vinzant Low-rank sums-of-squares representations