|
Universally Measurable Set
In mathematics, a subset A of a Polish space X is universally measurable if it is measurable with respect to every complete probability measure on X that measures all Borel subsets of X. In particular, a universally measurable set of reals is necessarily Lebesgue measurable (see below). Every analytic set is universally measurable. It follows from projective determinacy, which in turn follows from sufficient large cardinals, that every projective set is universally measurable. Finiteness condition The condition that the measure be a probability measure; that is, that the measure of X itself be 1, is less restrictive than it may appear. For example, Lebesgue measure on the reals is not a probability measure, yet every universally measurable set is Lebesgue measurable. To see this, divide the real line into countably many intervals of length 1; say, ''N''0=[0,1), ''N''1=[1,2), ''N''2=[-1,0), ''N''3=[2,3), ''N''4=[-2,-1), and so on. Now letting μ be Lebesgue measure, define ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Set
In the mathematical field of descriptive set theory, a subset A of a Polish space X is projective if it is \boldsymbol^1_n for some positive integer n. Here A is * \boldsymbol^1_1 if A is analytic * \boldsymbol^1_n if the complement of A, X\setminus A, is \boldsymbol^1_n * \boldsymbol^1_ if there is a Polish space Y and a \boldsymbol^1_n subset C\subseteq X\times Y such that A is the projection of C; that is, A=\ The choice of the Polish space Y in the third clause above is not very important; it could be replaced in the definition by a fixed uncountable Polish space, say Baire space or Cantor space or the real line. Relationship to the analytical hierarchy There is a close relationship between the relativized analytical hierarchy on subsets of Baire space (denoted by lightface letters \Sigma and \Pi) and the projective hierarchy on subsets of Baire space (denoted by boldface letters \boldsymbol and \boldsymbol). Not every \boldsymbol^1_n subset of Baire space is \Sigma^1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Descriptive Set Theory
In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and group actions, and mathematical logic. Polish spaces Descriptive set theory begins with the study of Polish spaces and their Borel sets. A Polish space is a second-countable topological space that is metrizable with a complete metric. Heuristically, it is a complete separable metric space whose metric has been "forgotten". Examples include the real line \mathbb, the Baire space \mathcal, the Cantor space \mathcal, and the Hilbert cube I^. Universality properties The class of Polish spaces has several universality properties, which show that there is no loss of generality in considering Polish spaces of certain restricted form ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexander Kechris
Alexander Sotirios Kechris ( el, Αλέξανδρος Σωτήριος Κεχρής; born March 23, 1946) is a set theorist and logician at the California Institute of Technology. Contributions Kechris has made contributions to the theory of Borel equivalence relations and the theory of automorphism groups of uncountable structures. His research interests cover foundations of mathematics, mathematical logic and set theory and their interactions with analysis and dynamical systems. Kechris earned his Ph.D. at UCLA in 1972 under the direction of Yiannis N. Moschovakis, with a dissertation titled '' Projective Ordinals and Countable Analytic Sets''. During his academic career he advised 23 PhD students and sponsored 20 postdoctoral researchers. In 2012, he became an Inaugural Fellow of the American Mathematical Society. Honors *1986 - Invited Speaker at the International Congress of Mathematicians in Berkeley (Mathematical Logic & Foundations) *1998 - Gödel Lecturer (Current T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by arbitrarily choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family (S_i)_ of nonempty sets, there exists an indexed set (x_i)_ such that x_i \in S_i for every i \in I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. In many cases, a set arising from choosing elements arbitrarily can be made without invoking the axiom of choice; this is, in particular, the case if the number of sets from which to choose the elements is finite, or if a canonical rule on how to choose the elements is available – some distinguishin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability
Probability is the branch of mathematics concerning numerical descriptions of how likely an Event (probability theory), event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speaking, 0 indicates impossibility of the event and 1 indicates certainty."Kendall's Advanced Theory of Statistics, Volume 1: Distribution Theory", Alan Stuart and Keith Ord, 6th Ed, (2009), .William Feller, ''An Introduction to Probability Theory and Its Applications'', (Vol 1), 3rd Ed, (1968), Wiley, . The higher the probability of an event, the more likely it is that the event will occur. A simple example is the tossing of a fair (unbiased) coin. Since the coin is fair, the two outcomes ("heads" and "tails") are both equally probable; the probability of "heads" equals the probability of "tails"; and since no other outcomes are possible, the probability of either "heads" or "tails" is 1/2 (which could also be written ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lebesgue Measure
In measure theory, a branch of mathematics, the Lebesgue measure, named after French mathematician Henri Lebesgue, is the standard way of assigning a measure to subsets of ''n''-dimensional Euclidean space. For ''n'' = 1, 2, or 3, it coincides with the standard measure of length, area, or volume. In general, it is also called ''n''-dimensional volume, ''n''-volume, or simply volume. It is used throughout real analysis, in particular to define Lebesgue integration. Sets that can be assigned a Lebesgue measure are called Lebesgue-measurable; the measure of the Lebesgue-measurable set ''A'' is here denoted by ''λ''(''A''). Henri Lebesgue described this measure in the year 1901, followed the next year by his description of the Lebesgue integral. Both were published as part of his dissertation in 1902. Definition For any interval I = ,b/math>, or I = (a, b), in the set \mathbb of real numbers, let \ell(I)= b - a denote its length. For any subset E\subseteq\mathbb, the Lebesgue oute ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter 'M' first and 'Y' last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be ''finite'', as in these examples, or ''infi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cantor Space
In mathematics, a Cantor space, named for Georg Cantor, is a topological abstraction of the classical Cantor set: a topological space is a Cantor space if it is homeomorphic to the Cantor set. In set theory, the topological space 2ω is called "the" Cantor space. Examples The Cantor set itself is a Cantor space. But the canonical example of a Cantor space is the countably infinite topological product of the discrete 2-point space . This is usually written as 2^\mathbb or 2ω (where 2 denotes the 2-element set with the discrete topology). A point in 2ω is an infinite binary sequence, that is a sequence which assumes only the values 0 or 1. Given such a sequence ''a''0, ''a''1, ''a''2,..., one can map it to the real number :\sum_^\infty \frac. This mapping gives a homeomorphism from 2ω onto the Cantor set, demonstrating that 2ω is indeed a Cantor space. Cantor spaces occur abundantly in real analysis. For example, they exist as subspaces in every perfect, complete metric ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Cardinal
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least α such that α=ωα). The proposition that such cardinals exist cannot be proved in the most common axiomatization of set theory, namely ZFC, and such propositions can be viewed as ways of measuring how "much", beyond ZFC, one needs to assume to be able to prove certain desired results. In other words, they can be seen, in Dana Scott's phrase, as quantifying the fact "that if you want more you have to assume more". There is a rough convention that results provable from ZFC alone may be stated without hypotheses, but that if the proof requires other assumptions (such as the existence of large cardinals), these should be stated. Whether this is simply a linguistic convention, or something more, is a controversial point among distinct philo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Subset
In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are unequal, then ''A'' is a proper subset of ''B''. The relationship of one set being a subset of another is called inclusion (or sometimes containment). ''A'' is a subset of ''B'' may also be expressed as ''B'' includes (or contains) ''A'' or ''A'' is included (or contained) in ''B''. A ''k''-subset is a subset with ''k'' elements. The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra (structure), Boolean algebra under the subset relation, in which the join and meet are given by Intersection (set theory), intersection and Union (set theory), union, and the subset relation itself is the Inclusion (Boolean algebra), Boolean inclusion relation. Definition If ''A'' and ''B'' are sets and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Probability")
