The K-moment problem for continuous linear functionals

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Given a closed (and non necessarily compact) basic semi-algebraic set $K\subseteq R^n$, we solve the $K$-moment problem for continuous linear functionals. Namely, we introduce a weighted $\ell_1$-norm $\ell_w$ on $R[x]$, and show that the $\ell_w$-closures of the preordering $P$ and quadratic module $Q$ (associated with the generators of $K$) is the cone $psd(K)$ of polynomials nonnegative on $K$. We also prove that $P$ an $Q$ solve the $K$-moment problem for $\ell_w$-continuous linear functionals and completely characterize those $\ell_w$-continuous linear functionals nonnegative on $P$ and $Q$ (hence on $psd(K)$). When $K$ has a nonempty interior we also provide in explicit form a canonical $\ell_w$-projection $g^w_f$ for any polynomial $f$, on the (degree-truncated) preordering or quadratic module. Remarkably, the support of $g^w_f$ is very sparse and does not depend on $K$! This enables us to provide an explicit Positivstellensatz on $K$. At last but not least, we provide a simple characterization of polynomials nonnegative on $K$, which is crucial in proving the above results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The K-moment problem for continuous linear functionals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The K-moment problem for continuous linear functionals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The K-moment problem for continuous linear functionals will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-440735

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.