Ranks of Real Symmetric Tensors

Similar documents
Ternary forms with lots of zeros

Gram Spectrahedra. Lynn Chua UC Berkeley. joint work with Daniel Plaumann, Rainer Sinn, and Cynthia Vinzant

Ranks and generalized ranks

Eigenvectors of Tensors and Waring Decomposition

The Pythagoras numbers of projective varieties.

Higher secant varieties of classical projective varieties

Tensor decomposition and tensor rank

Representations of Positive Polynomials: Theory, Practice, and

Semidefinite Programming

Optimization over Polynomials with Sums of Squares and Moment Matrices

On the Waring problem for polynomial rings

ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION

Generic properties of Symmetric Tensors

Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry

SOS TENSOR DECOMPOSITION: THEORY AND APPLICATIONS

Tensor decomposition and moment matrices

Global Optimization of Polynomials

Real Symmetric Matrices and Semidefinite Programming

arxiv: v2 [math.ag] 3 Dec 2016

On Strassen s Conjecture

POSITIVE POLYNOMIALS LECTURE NOTES (09: 10/05/10) Contents

TWO LECTURES ON APOLARITY AND THE VARIETY OF SUMS OF POWERS

arxiv: v3 [math.ag] 15 Dec 2016

DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES

Sixty-Four Curves of Degree Six

Skew-symmetric tensor decomposition

SPECTRAHEDRA. Bernd Sturmfels UC Berkeley

The Waring rank of the Vandermonde determinant

Sparse representations from moments

On generic and maximal k-ranks of binary forms

HYPERBOLIC POLYNOMIALS, INTERLACERS AND SUMS OF SQUARES

Convex Optimization & Parsimony of L p-balls representation

arxiv: v3 [math.ag] 2 May 2018

How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization

Quadratic families of elliptic curves and degree 1 conic bundles

Giorgio Ottaviani. Università di Firenze. Tutorial on Tensor rank and tensor decomposition

DIRECT SUM DECOMPOSABILITY OF POLYNOMIALS AND FACTORIZATION OF ASSOCIATED FORMS

Maximum Waring Ranks of Monomials and Sums of Coprime Monomials

Are There Sixth Order Three Dimensional PNS Hankel Tensors?

Forms as sums of powers of lower degree forms

A new look at nonnegativity on closed sets

Special Session on Secant Varieties. and Related Topics. Secant Varieties of Grassmann and Segre Varieties. Giorgio Ottaviani

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Polynomials. Math 4800/6080 Project Course

Tensors: a geometric view Open lecture November 24, 2014 Simons Institute, Berkeley. Giorgio Ottaviani, Università di Firenze

Section 0.2 & 0.3 Worksheet. Types of Functions

Convexity Properties of The Cone of Nonnegative Polynomials

How to find good starting tensors for matrix multiplication

12. Hilbert Polynomials and Bézout s Theorem

Complexity of Deciding Convexity in Polynomial Optimization

MAKSYM FEDORCHUK. n ) = z1 d 1 zn d 1.

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

10. Smooth Varieties. 82 Andreas Gathmann

to appear insiam Journal on Matrix Analysis and Applications.

Algebraic Varieties. Notes by Mateusz Micha lek for the lecture on April 17, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra

on Semialgebraic Sets for Nonnnegative Polynomials Finding Representations

Approximation Algorithms

Lecture 5. 1 Goermans-Williamson Algorithm for the maxcut problem

Toric Varieties. Madeline Brandt. April 26, 2017

Rank-one Generated Spectral Cones Defined by Two Homogeneous Linear Matrix Inequalities

Large graphs and symmetric sums of squares

2. Intersection Multiplicities

Semidefinite Programming Basics and Applications

Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 2

Direct Sum Decomposability of Polynomials

AN ELEMENTARY PROOF OF HILBERT S THEOREM ON TERNARY QUARTICS

Semidefinite Programming

Convex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013

Resultants. Chapter Elimination Theory. Resultants

Robust and Optimal Control, Spring 2015

The Hilbert-Mumford Criterion

Polynomials, Ideals, and Gröbner Bases

Tensors. Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra

SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic

Approximation algorithms for nonnegative polynomial optimization problems over unit spheres

Permutation invariant proper polyhedral cones and their Lyapunov rank

Secant Varieties of Segre Varieties. M. Catalisano, A.V. Geramita, A. Gimigliano

On self-concordant barriers for generalized power cones

4. Algebra and Duality

Positive semidefinite matrix approximation with a trace constraint

Non-Convex Optimization via Real Algebraic Geometry

Kernel Method: Data Analysis with Positive Definite Kernels

6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC

Semidefinite Relaxations Approach to Polynomial Optimization and One Application. Li Wang

Hilbert function, Betti numbers. Daniel Gromada

CLOSED RANGE POSITIVE OPERATORS ON BANACH SPACES

arxiv: v1 [math.oc] 31 Jan 2017

Direct Sum Decomposability of Polynomials

Hyperdeterminants of Polynomials

hal , version 1-8 Oct 2008

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

Polynomials 6c Classifying the Zeros of a Polynomial Functions

Mathematische Annalen

MIT Algebraic techniques and semidefinite optimization February 16, Lecture 4

Example: feasibility. Interpretation as formal proof. Example: linear inequalities and Farkas lemma

Real rank geometry of ternary forms

We simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS

LP Duality: outline. Duality theory for Linear Programming. alternatives. optimization I Idea: polyhedra

Converse Results on Existence of Sum of Squares Lyapunov Functions

Transcription:

Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions

Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like to decompose f as r f = c i l d i, where l i are real linear forms. The minimal r for which such decomposition exists is the rank of f. i=1 Illustrative example: 2x 3 6xy 2 = (x + 1y) 3 + (x 1y) 3. Over C a generic form has unique rank, given by the Alexander-Hirschowitz theorem. Call rank r typical for forms in R[x 1,..., x n ] d if the set of forms of ranks r includes an open subset of R[x 1,..., x n ] d. For real forms there can be many typical ranks.

Binary Forms Theorem(Comon-Ottaviani, Causa-Re, Reznick): Let f R[x, y] d be a form with distinct roots. Then f has rank d if and only if all roots of f are real. Conjecture (Comon-Ottaviani): All ranks r with d+2 2 r d are typical for forms in R[x, y] d. Now a Theorem (B.).

To a monomial x α = x a 1 1... x n an Enter Apolarity x α = associate a differential operator x a 1 1 an.... xn To a polynomial f = c α x α associate a differential operator f = c α x α. For f k[x 1,..., x n ] define the apolar ideal f of f by f = {g k[x 1,..., x n ] g(f ) = 0}. Apolar inner product: f, g = f (g).

The Key Lemma Apolarity Lemma: Let f be a form of degree d. Then f can be written as f = r i=1 ld i with l i = c i1 x 1 + + c in x n if and only if the vanishing ideal of the points c i = (c i1,..., c in ), 1 i r is contained in the apolar ideal f. Restatement about rank: A form f has rank at most r if and only if the apolar ideal f contains the vanishing ideal of some r points. For binary forms: A form f has rank at most r if and only if f contains a form of degree r that factors completely into distinct factors (over the appropriate field!). Idea of Proof: Let f be a form of rank r. We need that for any small perturbation g of f the apolar ideal g contains a form of degree r with all real roots and no forms of degree r 1 with all real roots.

Nonnegative Decompositions Two Questions: (1) Given a real form f of even degree 2d is is possible to write f as a positive combination of 2d-th powers of linear forms: f = α i l 2d i, α i 0. (2) Given a linear functional L : R[x] n,2d R is it possible to write L as integration with respect to a measure µ: L(f ) = f dµ. R n The 2nd question is the homogeneous truncated moment problem. But the questions are equivalent via apolarity! Let v = (v 1 x 1 + + v n x n ) 2d and define linear operator L v by L v (f ) = v(f ) = f (v).

Some Convexity Sums of 2d-th powers of linear forms are a convex cone in R[x] n,2d. By the above this cone is dual to the cone of nonnegative forms P n,2d in R[x] n,2d. The dual cone Σ n,2d to the cone of sums of squares Σ n,2d consists of forms with positive semidefinite middle catalecticant matrix; this is the matrix of the quadratic form Q f : R[x] n,d R given by: Q f (p) = f (p 2 ). Corollary: Suppose P n,2d = Σ n,2d and f has a positive semidefinite middle catalecticant matrix. Then f is a sum of 2d-th powers and nonnegative rank of f is equal to the rank of the middle catalecticant matrix. By Hilbert s Theorem this only happens for (1) Binary forms (2) Quadratic Forms (3) Ternary Quartics.

A Generalization Can this situation be repeated? YES! Theorem: (B.) Let f R[x] n,2d and suppose that rank Q f 3d 3 for d 3 or rank Q f 5 for d = 2. Then f is a sum of 2d-th powers and rank f = rank Q f. These bounds are tight. Proposition: (B.) Let f R[x] 3,6 be a sum of 6-th powers. Then rank f 11 and this bound is sharp. Can construct example where nonnegative rank is larger than the real rank.

Completely Speculative Let f R[x] n,2d. Suppose that we demand that the decomposition is not real but conjugate invariant, i.e. if l 2d occurs in the decomposition of f, then so does l 2d. What can be said about the conjugate rank?

Open Questions What happens for more variables? Describe all typical ranks for ternary quartics. Can show that 7 is a typical rank and any ternary quartic has rank at most 8. Conjugate invariant rank. Describe all cases (in terms of degree and number of variables) where nonnegative rank is equal to the real rank.

THANK YOU!