Borel measures with a density on a compact semi-algebraic set
نویسندگان
چکیده
منابع مشابه
Borel measures with a density on a compact semi-algebraic set
Let K ⊂ R be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no à priori bounding parameter) for a real sequence y = (yα), α ∈ N, to have a finite representing Borel measure absolutely continuous w.r.t. the Lebesgue measure on K, and with a density in ∩p≥1Lp(K). With an additional condition involving a bounding parameter, the condition is necessary and ...
متن کاملThe Ring of Bounded Polynomials on a Semi-algebraic Set
Let V be a normal affine R-variety, and let S be a semi-algebraic subset of V (R) which is Zariski dense in V . We study the subring BV (S) of R[V ] consisting of the polynomials that are bounded on S. We introduce the notion of S-compatible completions of V , and we prove the existence of such completions when dim(V ) ≤ 2 or S = V (R). An S-compatible completionX of V yields a ring isomorphism...
متن کاملThe narrow topology on the set of Borel probability measures on a metrizable space
In this note we talk about the total variation metric and the narrow topology (also called the weak-* topology) on the set of Borel probability measures on a metrizable topological space. In the course of the note we define all the terms used in the previous sentence. The reason for talking about metrizable spaces rather than metric spaces in this note is to make explicit that the objects we de...
متن کاملA dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2 is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2 is the countable union of countable sets, then there exists an Fσδ set C ⊆ 2 such that C is uncountable but contains no perfect subset. Finally, we c...
متن کاملOn Polynomial Optimization Over Non-compact Semi-algebraic Sets
We consider the class of polynomial optimization problems inf{f(x) : x ∈ K} for which the quadratic module generated by the polynomials that define K and the polynomial c − f (for some scalar c) is Archimedean. For such problems, the optimal value can be approximated as closely as desired by solving a hierarchy of semidefinite programs and the convergence is finite generically. Moreover, the Ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2013
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-013-0557-5