Main Page: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
No edit summary
mNo edit summary
Line 1: Line 1:
{{refimprove|date=March 2010}}
{{Redirect|Countable|the linguistic concept|Count noun}}
{{distinguish2| [[recursively enumerable set|(recursively) enumerable sets]]}}
[[File:Normal Distribution CDF.svg|thumb|300px|Cumulative distribution function for the normal distribution]]
In [[mathematics]], a '''countable set''' is a [[Set (mathematics)|set]] with the same [[cardinality]] ([[cardinal number|number]] of elements) as some [[subset]] of the set of [[natural number]]s. A set that is not countable is called ''[[uncountable set|uncountable]]''. The term was originated by [[Georg Cantor]]. The elements of a countable set can be counted one at a time—although the counting may never finish, every element of the set will eventually be associated with a natural number.


In [[probability theory]] and [[statistics]], the '''cumulative distribution function''' ('''CDF'''), or just '''distribution function''', describes the probability that a real-valued [[random variable]] ''X'' with a given [[probability distribution]] will be found to have a value less than or equal to ''x''. In the case of a [[continuous distribution]], it gives the area under the [[probability density function]] from minus infinity to ''x''. Cumulative distribution functions are also used to specify the distribution of [[multivariate random variable]]s.
Some authors use ''countable set'' to mean a set with the same cardinality as the set of natural numbers.<ref name="Rudin">For an example of this usage see {{Harv|Rudin|1976|loc=Chapter 2}}</ref> The difference between the two definitions is that under the former, [[finite set]]s are also considered to be countable, while under the latter definition, they are not considered to be countable. To resolve this ambiguity, the term '''at most countable''' is sometimes used for the former notion, and '''countably infinite''' for the latter.  The term '''denumerable''' can also be used to mean countably infinite,<ref name="Lang">See {{Harv|Lang|1993|loc=&sect;2 of Chapter I}}.</ref> or countable, in contrast with the term '''nondenumerable'''.<ref name="Apostol">See {{Harv|Apostol|1969|loc=Chapter 13.19}}.</ref>


==Definition==
==Definition==
The cumulative distribution function of a real-valued [[random variable]] ''X'' is the function given by
A set ''S'' is called '''countable''' if there exists an [[injective function]] ''f'' from ''S'' to the [[natural numbers]] <math>\mathbb{N} = \{0,1,2,3,...\}.</math><ref>Since there is an obvious [[bijection]] between <math>\mathbb{N}</math> and <math>\mathbb{N}^* = \{1,2,3,...\},</math> it makes no difference whether one considers 0 to be a natural number of not. In any case, this article follows [[ISO 31-11]] and the standard convention in [[mathematical logic]], which make 0 a natural number.</ref>


:<math>F_X(x) = \operatorname{P}(X\leq x),</math>
If ''f'' is also [[surjective function|surjective]] and therefore [[bijection|bijective]] (since f is already defined to be [[injective]]), then ''S'' is called '''countably [[infinite set|infinite]].'''


where the right-hand side represents the [[probability]] that the random variable ''X'' takes on a value less than or
As noted above, this terminology is not universal: Some authors use countable to mean what is here called "countably infinite," and to not include finite sets.
equal to ''x''. The probability that ''X'' lies in the semi-closed [[interval (mathematics)|interval]] (''a'',&nbsp;''b''<nowiki>]</nowiki>, where ''a''&nbsp; < &nbsp;''b'', is therefore
:<math>\operatorname{P}(a < X \le b)= F_X(b)-F_X(a).</math>


In the definition above, the "less than or equal to" sign, "≤", is a convention, not a universally used one (e.g. Hungarian literature uses "<"), but is important for discrete distributions. The proper use of tables of the [[Binomial distribution|binomial]] and [[Poisson distribution]]s depends upon this convention. Moreover, important formulas like [[Paul Lévy (mathematician)|Paul Lévy]]'s inversion formula for the [[Characteristic function (probability theory)#Inversion formulas|characteristic function]] also rely on the "less than or equal" formulation.
For alternative (equivalent) formulations of the definition in terms of a bijective function or a surjective function, see the section [[#Formal definition and properties|Formal definition and properties]] below.


If treating several random variables ''X'',&nbsp;''Y'',&nbsp;... etc. the corresponding letters are used as subscripts while, if treating only one, the subscript is usually omitted. It is conventional to use a capital ''F'' for a cumulative distribution function, in contrast to the lower-case ''f'' used for [[probability density function]]s and [[probability mass function]]s. This applies when discussing general distributions: some specific distributions have their own conventional notation, for example the [[normal distribution]].
==Introduction==


The CDF of a [[continuous random variable]] ''X'' can be expressed as the integral of its [[probability density function]] ƒ<sub>X</sub> as follows:
A ''[[Set (mathematics)|set]]'' is a collection of ''elements'', and may be described in many ways. One way is simply to list all of its elements; for example, the set consisting of the integers 3, 4, and 5 may be denoted <math>\{ 3, 4, 5 \}</math>. This is only effective for small sets, however; for larger sets, this would be time-consuming and error-prone. Instead of listing every single element, sometimes an ellipsis ("...") is used, if the writer believes that the reader can easily guess what is missing; for example, <math>\{ 1, 2, 3, \dots, 100 \}</math> presumably denotes the set of [[integer]]s from 1 to 100. Even in this case, however, it is still ''possible'' to list all the elements, because the set is ''finite''; it has a specific number of elements.


:<math>F_X(x) = \int_{-\infty}^x f_X(t)\,dt.</math>
Some sets are ''infinite''; these sets have more than ''n'' elements for any integer ''n''. For example, the set of natural numbers, denotable by <math>\{0, 1, 2, 3, 4, 5, \dots \}</math>, has infinitely many elements, and we cannot use any normal number to give its size. Nonetheless, it turns out that infinite sets do have a well-defined notion of size (or more properly, of ''cardinality'', which is the technical term for the number of elements in a set), and not all infinite sets have the same cardinality.


In the case of a random variable ''X'' which has distribution having a discrete component at a value ''b'',
To understand what this means, we first examine what it ''does not'' mean. For example, there are infinitely many odd integers, infinitely many even integers, and (hence) infinitely many integers overall. However, it turns out that the number of odd integers, which is the same as the number of even integers, is also the same as the number of integers overall. This is because we arrange things such that for every integer, there is a distinct odd integer: ... −2 → −3, −1 → −1, 0 → 1, 1 → 3, 2 → 5, ...; or, more generally, ''n'' → 2''n'' + 1. What we have done here is arranged the integers and the odd integers into a ''one-to-one correspondence'' (or ''[[bijection]]''), which is a [[function (mathematics)|function]] that maps between two sets such that each element of each set corresponds to a single element in the other set.
:<math>\operatorname{P}(X=b) = F_X(b) - \lim_{x \to b^{-}} F_X(x).</math>


If ''F<sub>X</sub>'' is continuous at ''b'', this equals zero and there is no discrete component at ''b''.
However, not all infinite sets have the same cardinality. For example, [[Georg Cantor]] (who introduced this concept) demonstrated that the [[real number]]s cannot be put into one-to-one correspondence with the natural numbers (non-negative integers), and therefore that the set of real numbers has a greater cardinality than the set of natural numbers.


== Properties ==
A set is ''countable'' if: (1) it is finite, or (2) it has the same cardinality (size) as the set of natural numbers. Equivalently, a set is ''countable'' if it has the same cardinality as some [[subset]] of the set of natural numbers. Otherwise, it is ''uncountable''.
[[Image:Discrete probability distribution illustration.svg|right|thumb|From top to bottom, the cumulative distribution function of a discrete probability distribution, continuous probability distribution, and a distribution which has both a continuous part and a discrete part.]]


Every cumulative distribution function ''F'' is [[monotone increasing|non-decreasing]] and [[right-continuous]], which makes it a [[càdlàg]] function. Furthermore,
==Formal definition and properties==
:<math>\lim_{x\to -\infty}F(x)=0, \quad \lim_{x\to +\infty}F(x)=1.</math>
By definition a set ''S'' is '''countable''' if there exists an [[injective function]]
:<math>f: S \to \mathbb{N} </math>
from ''S'' to the [[natural numbers]] <math>\mathbb{N} = \{0,1,2,3,...\}.</math>


Every function with these four properties is a CDF, i.e., for every such function, a [[random variable]] can be defined such that the function is the cumulative distribution function of that random variable.
It might seem natural to divide the sets into different classes: put all the sets containing one element together; all the sets containing two elements together; ...; finally, put together all infinite sets and consider them as having the same size.
This view is not tenable, however, under the natural definition of size.


If ''X'' is a purely [[discrete random variable]], then it attains values ''x''<sub>1</sub>, ''x''<sub>2</sub>, ... with probability ''p''<sub>i</sub> = P(''x''<sub>i</sub>), and the CDF of ''X'' will be discontinuous at the points ''x''<sub>''i''</sub> and constant in between:
To elaborate this we need the concept of a [[bijection]]. Although a "bijection" seems a more advanced concept than a number, the usual development of mathematics in terms of set theory defines functions before numbers, as they are based on much simpler sets. This is where the concept of a bijection comes in: define the correspondence


:<math>F(x) = \operatorname{P}(X\leq x) = \sum_{x_i \leq x} \operatorname{P}(X = x_i) = \sum_{x_i \leq x} p(x_i).</math>
:''a'' ↔ 1, ''b'' ↔ 2, ''c'' ↔ 3


If the CDF ''F'' of a real valued random variable ''X'' is [[continuous function|continuous]], then ''X'' is a [[continuous random variable]]; if furthermore ''F'' is [[absolute continuity|absolutely continuous]], then there exists a [[Lebesgue integral|Lebesgue-integrable]] function ''f''(''x'') such that
Since every element of { ''a'', ''b'', ''c'' } is paired with ''precisely one'' element of { 1, 2, 3 }, ''and'' vice versa, this defines a bijection.


:<math>F(b)-F(a) = \operatorname{P}(a< X\leq b) = \int_a^b f(x)\,dx</math>
We now generalize this situation and ''define'' two sets to be of the same size if (and only if) there is a bijection between them. For all finite sets this gives us the usual definition of "the same size". What does it tell us about the size of infinite sets?


for all real numbers ''a'' and ''b''. The function ''f'' is equal to the [[derivative]] of ''F'' [[almost everywhere]], and it is called the [[probability density function]] of the distribution of ''X''.
Consider the sets ''A'' = { 1, 2, 3, ... }, the set of positive [[integer]]s and ''B'' = { 2, 4, 6, ... }, the set of even positive integers. We claim that, under our definition, these sets have the same size, and that therefore ''B'' is countably infinite. Recall that to prove this we need to exhibit a bijection between them. But this is easy, using n ↔ 2n, so that
:1 ↔ 2, 2 ↔ 4, 3 ↔ 6, 4 ↔ 8, ....


== Examples ==
As in the earlier example, every element of A has been paired off with precisely one element of B, and vice versa. Hence they have the same size. This gives an example of a set which is of the same size as one of its proper subsets, a situation which is impossible for finite sets.
As an example, suppose <math>X</math> is [[uniform distribution (continuous)|uniformly distributed]] on the unit interval [0,&nbsp;1].
Then the CDF of <math>X</math> is given by


:<math>F(x) = \begin{cases}
Likewise, the set of all [[ordered pair]]s of natural numbers is countably infinite, as can be seen by following a path like the one in the picture: [[File:Pairing natural.svg|thumb|300px|The [[Cantor pairing function]] assigns one natural number to each pair of natural numbers]] The resulting mapping is like this:
0 &:\ x < 0\\
:0 ↔ (0,0), 1 ↔ (1,0), 2 ↔ (0,1), 3 ↔ (2,0), 4 ↔ (1,1), 5 ↔ (0,2), 6 ↔ (3,0) ....
x &:\ 0 \le x < 1\\
It is evident that this mapping will cover all such ordered pairs.
1 &:\ 1 \le x.
\end{cases}</math>


Suppose instead that <math>X</math> takes only the discrete values 0 and 1, with equal probability.
Interestingly: if you treat each pair as being the [[numerator]] and [[denominator]] of a [[vulgar fraction]], then for every positive fraction, we can come up with a distinct number corresponding to it. This representation includes also the natural numbers, since every natural number is also a fraction ''N''/1. So we can conclude that there are exactly as many positive rational numbers as there are positive integers. This is true also for all rational numbers, as can be seen below (a more complex presentation is needed to deal with negative numbers).
Then the CDF of <math>X</math> is given by


:<math>F(x) = \begin{cases}
'''Theorem:''' The [[Cartesian product]] of finitely many countable sets is countable.
0 &:\ x < 0\\
1/2 &:\ 0 \le x < 1\\
1 &:\ 1 \le x.
\end{cases}</math>


==Derived functions==
This form of triangular [[Map (mathematics)|mapping]] [[recursion|recursively]] generalizes to [[vector space|vectors]] of finitely many natural numbers by repeatedly mapping the first two elements to a natural number. For example, (0,2,3) maps to (5,3) which maps to 39.
===Complementary cumulative distribution function (tail distribution)===<!-- This section is linked from [[Power law]], [[Stretched exponential function]] and [[Weibull distribution]] -->
Sometimes, it is useful to study the opposite question and ask how often the random variable is ''above'' a particular level. This is called the '''complementary cumulative distribution function''' ('''ccdf''') or simply the '''tail distribution''' or '''exceedance''', and is defined as


:<math>\bar F(x) = \operatorname{P}(X > x) = 1 - F(x).</math>
Sometimes more than one mapping is useful. This is where you map the set which you want to show countably infinite, onto another set; and then map this other set to the natural numbers. For example, the positive [[rational number]]s can easily be mapped to (a subset of) the pairs of natural numbers because ''p''/''q ''maps to (''p'', ''q'').


This has applications in [[statistics|statistical]] [[hypothesis test]]ing, for example, because the one-sided [[p-value]] is the probability of observing a test statistic ''at least'' as extreme as the one observed. Thus, provided that the [[test statistic]], ''T'', has a continuous distribution,  the one-sided [[p-value]] is simply given by the ccdf: for an observed value ''t'' of the test statistic
What about infinite subsets of countably infinite sets? Do these have fewer elements than '''N'''?
:<math>p= \operatorname{P}(T \ge t) = \operatorname{P}(T > t) =1 - F_T(t).</math>


In [[survival analysis]], <math>\bar F(x)</math> is called the '''[[survival function]]''' and denoted <math> S(x) </math>, while the term ''reliability function'' is common in [[engineering]].
'''Theorem:''' Every subset of a countable set is countable. In particular, every infinite subset of a countably infinite set is countably infinite.


;Properties
For example, the set of [[prime number]]s is countable, by mapping the ''n''-th prime number to ''n'':
* For a non-negative continuous random variable having an expectation, [[Markov's inequality]] states that<ref name="ZK">{{cite book| last1 = Zwillinger| first1 = Daniel| last2 = Kokoska| first2 = Stephen| title = CRC Standard Probability and Statistics Tables and Formulae| year = 2010| publisher = CRC Press| isbn = 978-1-58488-059-2| page = 49 }}</ref>
*2 maps to 1
:: <math>\bar F(x) \leq \frac{\mathbb E(X)}{x} .</math>
*3 maps to 2
* As <math> x \to \infty, \bar F(x) \to 0 \ </math>, and in fact <math> \bar F(x) = o(1/x) </math> provided that <math>\mathbb E(X)</math> is finite.
*5 maps to 3
:Proof:{{citation needed|date=April 2012}} Assuming X has a density function f, for any <math> c> 0 </math>
*7 maps to 4
::<math>
*11 maps to 5
\mathbb E(X) = \int_0^\infty xf(x)dx \geq \int_0^c xf(x)dx + c\int_c^\infty f(x)dx
*13 maps to 6
</math>
*17 maps to 7
:Then, on recognizing <math>\bar F(c) = \int_c^\infty f(x)dx </math> and rearranging terms,
*19 maps to 8
::<math>
*23 maps to 9
0 \leq c\bar F(c) \leq \mathbb E(X) - \int_0^c x f(x)dx \to 0 \text{  as  } c \to \infty
*etc.
</math>
:as claimed.


===Folded cumulative distribution===
What about sets being "larger than" '''N'''? An obvious place to look would be '''Q''', the set of all [[rational number]]s, which intuitively may seem much bigger than '''N'''. But looks can be deceiving, for we assert:
[[Image:Folded-cumulative-distribution-function.svg|thumb|right|Example of the folded cumulative distribution for a [[normal distribution]] function with an [[expected value]] of 0 and a [[standard deviation]] of 1.]]
While the plot of a cumulative distribution often has an S-like shape, an alternative illustration is the '''folded cumulative distribution''' or '''mountain plot''', which folds the top half of the graph over,<ref name="Gentle">{{cite book| author = Gentle, J.E.| title = Computational Statistics| url = http://books.google.com/?id=m4r-KVxpLsAC&pg=PA348| accessdate = 2010-08-06| year = 2009| publisher = [[Springer Science+Business Media|Springer]]| isbn = 978-0-387-98145-1 }}{{Page needed|date=June 2011}}</ref><ref name="Monti">
{{cite journal|author=Monti, K.L.|pages=342–345|year=1995|title=Folded Empirical Distribution Function Curves (Mountain Plots) |journal=The American Statistician|volume=49|jstor=2684570}}</ref>
thus using two scales, one for the upslope and another for the downslope. This form of illustration emphasises the [[median (statistics)|median]] and [[dispersion (statistics)|dispersion]] (the [[mean absolute deviation]] from the median<ref>{{Cite journal
| last1 = Xue | first1 = J. H.
| last2 = Titterington | first2 = D. M.
| doi = 10.1016/j.spl.2011.03.014
| title = The p-folded cumulative distribution function and the mean absolute deviation from the p-quantile
| journal = Statistics & Probability Letters
| volume = 81 | issue = 8 | pages = 1179–1182
| year = 2011
| pmid =  | pmc = }}<</ref>) of the distribution or of the empirical results.


===Inverse distribution function (quantile function)===
'''Theorem:''' '''Q''' (the set of all rational numbers) is countable.
If the CDF ''F'' is strictly increasing and continuous then <math> F^{-1}( y ), y \in [0,1], </math> is the unique real number <math> x </math> such that <math> F(x) = y </math>. In such a case, this defines the '''inverse distribution function''' or [[quantile function]].


Unfortunately, the distribution does not, in general, have an inverse.  One may define, for <math> y \in [0,1] </math>, the '''generalized inverse distribution function''': {{Clarify|date=March 2014}}
'''Q''' can be defined as the set of all fractions ''a''/''b'' where ''a'' and ''b'' are integers and ''b'' > 0. This can be mapped onto the subset of ordered triples of natural numbers (''a'', ''b'', ''c'') such that ''a'' ≥ 0, ''b'' > 0, ''a'' and ''b'' are [[coprime]], and ''c'' ∈ {0, 1} such that ''c'' = 0 if ''a''/''b'' ≥ 0 and ''c'' = 1 otherwise.
:<math>
F^{-1}(y) = \inf  \{x \in \mathbb{R}: F(x) \geq y \}.
</math>


* Example 1: The median is <math>F^{-1}( 0.5 )</math>.
*0 maps to (0,1,0)
* Example 2: Put <math> \tau = F^{-1}( 0.95 ) </math>.  Then we call <math> \tau </math> the 95th percentile.
*1 maps to (1,1,0)
*−1 maps to (1,1,1)
*1/2 maps to (1,2,0)
*−1/2 maps to (1,2,1)
*2 maps to (2,1,0)
*−2 maps to (2,1,1)
*1/3 maps to (1,3,0)
*−1/3 maps to (1,3,1)
*3 maps to (3,1,0)
*−3 maps to (3,1,1)


The inverse of the cdf is called the [[quantile function]].
*1/4 maps to (1,4,0)
*−1/4 maps to (1,4,1)
*2/3 maps to (2,3,0)
*−2/3 maps to (2,3,1)
*3/2 maps to (3,2,0)
*−3/2 maps to (3,2,1)
*4 maps to (4,1,0)
*−4 maps to (4,1,1)
*...


The inverse of the cdf can be used to translate results obtained for the uniform distribution to other distributions. Some useful properties of the inverse cdf are:
By a similar development, the set of [[algebraic number]]s is countable, and so is the set of [[definable number]]s.


# <math>F^{-1}</math> is nondecreasing
'''Theorem:''' (Assuming the [[axiom of countable choice]]) The [[union (set theory)|union]] of countably many countable sets is countable.
# <math>F^{-1}(F(x)) \leq x</math>
# <math>F(F^{-1}(y)) \geq y</math>
# <math>F^{-1}(y) \leq x</math> if and only if <math>y \leq F(x)</math>
# If <math>Y</math> has a <math>U[0, 1]</math> distribution then <math>F^{-1}(Y)</math> is distributed as <math>F</math>. This is used in [[random number generation]] using the [[inverse transform sampling]]-method.
# If <math>\{X_\alpha\}</math> is a collection of independent <math>F</math>-distributed random variables defined on the same sample space, then there exist random variables <math>Y_\alpha</math> such that <math>Y_\alpha</math> is distributed as <math>U[0,1]</math> and <math>F^{-1}(Y_\alpha) = X_\alpha</math> with probability 1 for all <math>\alpha</math>.


==Multivariate case ==
For example, given countable sets '''a''', '''b''', '''c''' ...
When dealing simultaneously with more than one random variable the ''joint'' cumulative distribution function can also be defined. For example, for a pair of random variables ''X,Y'', the joint CDF <math>F</math> is given by


:<math>F(x,y) = \operatorname{P}(X\leq x,Y\leq y),</math>
Using a variant of the triangular enumeration we saw above:


where the right-hand side represents the [[probability]] that the random variable ''X'' takes on a value less than or
*''a''<sub>0</sub> maps to 0
equal to ''x'' and that ''Y'' takes on a value less than or
equal to ''y''.


Every multivariate CDF is:
*''a''<sub>1</sub> maps to 1
# Monotonically non-decreasing for each of its variables
*''b''<sub>0</sub> maps to 2
# Right-continuous for each of its variables.
# <math>0\leq F(x_{1},...,x_{n})\leq 1</math>
# <math>\lim_{x_{1},...,x_{n}\rightarrow+\infty}F(x_{1},...,x_{n})=1</math> and <math>\lim_{x_{i}\rightarrow-\infty}F(x_{1},...,x_{n})=0,\quad \mbox{for all }i</math>


==Use in statistical analysis==
*''a''<sub>2</sub> maps to 3
*''b''<sub>1</sub> maps to 4
*''c''<sub>0</sub> maps to 5


The concept of the cumulative distribution function makes an explicit appearance in statistical analysis in two (similar) ways. [[Cumulative frequency analysis]] is the analysis of the frequency of occurrence of values of a phenomenon less than a reference value. The [[empirical distribution function]] is a formal direct estimate of the cumulative distribution function for which simple statistical properties can be derived and which can form the basis of various [[statistical hypothesis test]]s. Such tests can assess whether there is evidence against a sample of data having arisen from a given distribution, or evidence against two samples of data having arisen from  the same (unknown) population distribution.
*''a''<sub>3</sub> maps to 6
*''b''<sub>2</sub> maps to 7
*''c''<sub>1</sub> maps to 8
*''d''<sub>0</sub> maps to 9


===Kolmogorov–Smirnov and Kuiper's tests===
*''a''<sub>4</sub> maps to 10
The [[Kolmogorov–Smirnov test]] is based on cumulative distribution functions and can be used to test to see whether two empirical distributions are different or whether an empirical distribution is different from an ideal distribution. The closely related [[Kuiper's test]] is useful if the domain of the distribution is cyclic as in day of the week. For instance Kuiper's test might be used to see if the number of tornadoes varies during the year or if sales of a product vary by day of the week or day of the month.
*...
 
Note that this only works if the sets '''a''', '''b''', '''c''',... are [[disjoint sets|disjoint]]. If not, then the union is even smaller and is therefore also countable by a previous theorem.
 
Also note that the [[axiom of countable choice]] is needed in order to index ''all'' of the sets '''a''', '''b''', '''c''',...
 
'''Theorem:''' The set of all finite-length [[sequence]]s of natural numbers is countable.
 
This set is the union of the length-1 sequences, the length-2 sequences, the length-3 sequences, each of which is a countable set (finite Cartesian product). So we are talking about a countable union of countable sets, which is countable by the previous theorem.
 
'''Theorem:''' The set of all finite [[subset]]s of the natural numbers is countable.
 
If you have a finite subset, you can order the elements into a finite sequence. There are only countably many finite sequences, so also there are only countably many finite subsets.
 
The following theorem gives equivalent formulations in terms of a bijective function or a [[surjective function]].  A proof of this result can be found in Lang's text.<ref name="Lang"/>
 
'''Theorem:''' Let ''S'' be a set. The following statements are equivalent:
# ''S'' is countable, i.e. there exists an injective function
#:<math>f\colon S \to \mathbb{N}</math>.
# Either ''S'' is empty or there exists a surjective function
#:<math>g\colon \mathbb{N} \to S</math>.
# Either ''S'' is finite or there exists a [[bijection]]
#:<math>h\colon \mathbb{N} \to S</math>.
 
Several standard properties follow easily from this theorem.  We present them here tersely.  For a gentler presentation see the sections above.  Observe that <math>\mathbb{N}</math> in the theorem can be replaced with any countably infinite set.  In particular we have the following Corollary.
 
'''Corollary:''' Let ''S'' and ''T'' be sets.
# If the function
#:<math>f\colon S \to T</math> is injective and ''T'' is countable then ''S'' is countable.
# If the function
#:<math>g: S \to T</math> is surjective and ''S'' is countable then ''T'' is countable.
 
'''Proof:''' For (1) observe that if ''T'' is countable there is an injective function
<math>h: T \to \mathbb{N}.</math>  Then if
<math>f: S \to T</math> is injective
the composition <math>h \circ f: S \to \mathbb{N} </math> is injective, so ''S'' is countable.
 
For (2) observe that if ''S'' is countable there is a surjective function
<math>h: \mathbb{N} \to S.</math>  Then if <math>g\colon S \to T</math> is surjective the composition <math>g \circ h: \mathbb{N} \to T</math> is surjective, so ''T'' is countable.
 
'''Proposition:''' Any subset of a countable set is countable.
 
'''Proof:''' The restriction of an injective function to a subset of its [[domain (mathematics)|domain]] is still injective.
 
'''Proposition:'''  The [[Cartesian product]] of two countable sets ''A'' and ''B'' is countable.
 
'''Proof:''' Note that <math>\mathbb{N} \times \mathbb{N}</math> is countable as a consequence of the definition because the function <math>f: \mathbb{N} \times \mathbb{N} \to \mathbb{N}</math> given by <math>f(m,n) = 2^m 3^n</math> is injective.  It then follows from the Basic Theorem and the Corollary that the Cartesian product of any two countable sets is countable. This follows because if ''A'' and ''B'' are countable there are surjections <math>f: \mathbb{N} \to A</math> and <math>g: \mathbb{N} \to B</math>. So
:<math>f \times g: \mathbb{N} \times \mathbb{N} \to A \times B</math>
is a surjection from the countable set <math> \mathbb{N} \times \mathbb{N}</math> to the set
<math> A \times B</math> and the Corollary implies <math> A \times B</math> is countable. This result generalizes to the Cartesian product of any finite collection of countable sets and the proof follows by [[mathematical induction|induction]] on the number of sets in the collection.
 
'''Proposition:''' The [[integers]] <math>\mathbb{Z}</math> are countable and the [[rational numbers]] <math>\mathbb{Q}</math> are countable.
 
'''Proof:''' The integers <math>\mathbb{Z}</math> are countable because the function <math>f\colon \mathbb{Z} \to \mathbb{N}</math> given by <math>f(n) = 2^n</math> if ''n'' is non-negative and <math>f(n) = 3^{|n|}</math> if ''n'' is negative is an injective function. The rational numbers <math>\mathbb{Q}</math> are countable because the function <math>g\colon \mathbb{Z} \times \mathbb{N} \to \mathbb{Q}</math> given by <math>g(m,n) = m/(n+1)</math> is a surjection from the countable set <math>\mathbb{Z} \times \mathbb{N}</math> to the rationals <math>\mathbb{Q}</math>.
 
'''Proposition:''' If <math>A_n</math> is a countable set for each <math>n \in \mathbb{N}</math> then <math>\bigcup_{n \in \mathbb{N}} A_n</math> is countable.
 
'''Proof:''' This is a consequence of the fact that for each ''n'' there is a surjective function <math> g_n : \mathbb{N} \to A_n</math> and hence the function
:<math>G : \mathbb{N} \times \mathbb{N} \to \bigcup_{n \in \mathbb{N}} A_n</math>
given by <math> G(n,m) = g_n(m)</math> is a surjection.  Since <math>\mathbb{N} \times \mathbb{N}</math> is countable the Corollary implies <math> \bigcup_{n \in \mathbb{N}} A_n</math> is countable. We are using the [[axiom of countable choice]] in this proof in order to pick for each <math>n \in \mathbb{N}</math> a surjection <math>g_n</math> from the non-empty collection of surjections from <math>\mathbb{N}</math> to <math>A_n</math>.
 
'''[[Cantor's Theorem]]''' asserts that if <math>A</math> is a set and <math>\mathcal{P}(A)</math> is its [[power set]], i.e. the set of all subsets of <math>A</math>, then there is no surjective function from <math>A</math> to <math>\mathcal{P}(A)</math>.  A proof is given in the article [[Cantor's Theorem]].  As an immediate consequence of this and the Basic Theorem above we have:
 
'''Proposition:''' The set <math>\mathcal{P}(\mathbb{N})</math> is not countable; i.e. it is [[uncountable]].
 
For an elaboration of this result see [[Cantor's diagonal argument]].
 
The set of [[real number]]s is uncountable (see [[Cantor's first uncountability proof]]), and so is the set of all infinite [[sequence]]s of natural numbers.  A topological proof for the uncountability of the real numbers is described at [[finite intersection property]].
 
==Minimal model of set theory is countable==
If there is a set which is a standard model (see [[inner model]]) of ZFC set theory, then there is a minimal standard model (''see'' [[Constructible universe]]). The [[Löwenheim-Skolem theorem]] can be used to show that this minimal model is countable. The fact that the notion of "uncountability" makes sense even in this model, and in particular that this model ''M'' contains elements which are
* subsets of ''M'', hence countable,
* but uncountable from the point of view of ''M'',
was seen as paradoxical in the early days of set theory, see [[Skolem's paradox]].
 
The minimal standard model includes all the [[algebraic number]]s and all effectively computable [[transcendental number]]s, as well as many other kinds of numbers.
 
==Total orders==
Countable sets can be [[total order|totally ordered]] in various ways, e.g.:
*[[Well order]]s (see also [[ordinal number]]):
**The usual order of natural numbers (0, 1, 2, 3, 4, 5, ...)
**The integers in the order (0, 1, 2, 3, ...; −1, −2, −3, ...)
*Other (NOT well orders):
**The usual order of integers (..., -3, -2, -1, 0, 1, 2, 3, ...)
**The usual order of rational numbers (Cannot be explicitly written as a list!)
 
Note that in both examples of well orders here, any subset has a ''least element''; and in both examples of non-well orders, ''some'' subsets do NOT have a ''least element''.
This is the key definition that determines whether a total order is also a well order.


==See also==
==See also==
* [[Descriptive statistics]]
{{Wiktionary|countable}}
* [[Distribution fitting]]
* [[Aleph number]]
* [[Counting]]
* [[Hilbert's paradox of the Grand Hotel]]
 
==Notes==
<references/>
 
==References==
* {{Citation | last1=Lang | first1=Serge | author1-link=Serge Lang | title=Real and Functional Analysis | publisher=[[Springer-Verlag]] | location=Berlin, New York | isbn=0-387-94001-4 | year=1993}}
* {{Citation | last1=Rudin | first1=Walter | author1-link=Walter Rudin | title=Principles of Mathematical Analysis | publisher=[[McGraw-Hill]]| location=New York | isbn=0-07-054235-X | year=1976}}


== References ==
{{logic}}
{{reflist}}


== External links ==
[[Category:Basic concepts in infinite set theory]]
* {{commons category-inline|Cumulative distribution functions}}
[[Category:Cardinal numbers]]
[[Category:Infinity]]


{{Theory of probability distributions}}
{{Link FA|lmo}}


{{DEFAULTSORT:Cumulative Distribution Function}}
[[ar:مجموعة قابلة للعد]]
[[Category:Theory of probability distributions]]
[[bn:গণনাযোগ্য সেট]]
[[bg:Изброимо множество]]
[[ca:Conjunt numerable]]
[[cs:Spočetná množina]]
[[da:Tællelig mængde]]
[[de:Abzählbarkeit]]
[[es:Conjunto numerable]]
[[eo:Kalkulebla aro]]
[[eu:Multzo zenbakarri]]
[[fa:مجموعه شمارا]]
[[fr:Ensemble dénombrable]]
[[gl:Conxunto contábel]]
[[ko:가산 집합]]
[[is:Teljanlegt mengi]]
[[it:Insieme numerabile]]
[[he:קבוצה בת מנייה]]
[[ka:თვლადი სიმრავლე]]
[[kk:Саналымсыз жиын]]
[[lt:Skaiti aibė]]
[[lmo:Cungjuunt cüntàbil]]
[[nl:Aftelbare verzameling]]
[[ja:可算集合]]
[[no:Tellbar]]
[[nn:Teljeleg]]
[[pl:Zbiór przeliczalny]]
[[pt:Conjunto contável]]
[[ru:Счётное множество]]
[[simple:Countable set]]
[[sk:Spočítateľná množina]]
[[sl:Števna množica]]
[[sr:Пребројив скуп]]
[[fi:Numeroituva joukko]]
[[sv:Uppräknelig]]
[[ta:எண்ணுறுமையும் எண்ணுறாமையும்]]
[[uk:Зліченна множина]]
[[vi:Tập hợp đếm được]]
[[zh:可數集]]

Revision as of 08:16, 8 August 2014

Name: Jodi Junker
My age: 32
Country: Netherlands
Home town: Oudkarspel
Post code: 1724 Xg
Street: Waterlelie 22

my page - www.hostgator1centcoupon.info Template:Distinguish2 In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of natural numbers. A set that is not countable is called uncountable. The term was originated by Georg Cantor. The elements of a countable set can be counted one at a time—although the counting may never finish, every element of the set will eventually be associated with a natural number.

Some authors use countable set to mean a set with the same cardinality as the set of natural numbers.[1] The difference between the two definitions is that under the former, finite sets are also considered to be countable, while under the latter definition, they are not considered to be countable. To resolve this ambiguity, the term at most countable is sometimes used for the former notion, and countably infinite for the latter. The term denumerable can also be used to mean countably infinite,[2] or countable, in contrast with the term nondenumerable.[3]

Definition

A set S is called countable if there exists an injective function f from S to the natural numbers [4]

If f is also surjective and therefore bijective (since f is already defined to be injective), then S is called countably infinite.

As noted above, this terminology is not universal: Some authors use countable to mean what is here called "countably infinite," and to not include finite sets.

For alternative (equivalent) formulations of the definition in terms of a bijective function or a surjective function, see the section Formal definition and properties below.

Introduction

A set is a collection of elements, and may be described in many ways. One way is simply to list all of its elements; for example, the set consisting of the integers 3, 4, and 5 may be denoted . This is only effective for small sets, however; for larger sets, this would be time-consuming and error-prone. Instead of listing every single element, sometimes an ellipsis ("...") is used, if the writer believes that the reader can easily guess what is missing; for example, presumably denotes the set of integers from 1 to 100. Even in this case, however, it is still possible to list all the elements, because the set is finite; it has a specific number of elements.

Some sets are infinite; these sets have more than n elements for any integer n. For example, the set of natural numbers, denotable by , has infinitely many elements, and we cannot use any normal number to give its size. Nonetheless, it turns out that infinite sets do have a well-defined notion of size (or more properly, of cardinality, which is the technical term for the number of elements in a set), and not all infinite sets have the same cardinality.

To understand what this means, we first examine what it does not mean. For example, there are infinitely many odd integers, infinitely many even integers, and (hence) infinitely many integers overall. However, it turns out that the number of odd integers, which is the same as the number of even integers, is also the same as the number of integers overall. This is because we arrange things such that for every integer, there is a distinct odd integer: ... −2 → −3, −1 → −1, 0 → 1, 1 → 3, 2 → 5, ...; or, more generally, n → 2n + 1. What we have done here is arranged the integers and the odd integers into a one-to-one correspondence (or bijection), which is a function that maps between two sets such that each element of each set corresponds to a single element in the other set.

However, not all infinite sets have the same cardinality. For example, Georg Cantor (who introduced this concept) demonstrated that the real numbers cannot be put into one-to-one correspondence with the natural numbers (non-negative integers), and therefore that the set of real numbers has a greater cardinality than the set of natural numbers.

A set is countable if: (1) it is finite, or (2) it has the same cardinality (size) as the set of natural numbers. Equivalently, a set is countable if it has the same cardinality as some subset of the set of natural numbers. Otherwise, it is uncountable.

Formal definition and properties

By definition a set S is countable if there exists an injective function

from S to the natural numbers

It might seem natural to divide the sets into different classes: put all the sets containing one element together; all the sets containing two elements together; ...; finally, put together all infinite sets and consider them as having the same size. This view is not tenable, however, under the natural definition of size.

To elaborate this we need the concept of a bijection. Although a "bijection" seems a more advanced concept than a number, the usual development of mathematics in terms of set theory defines functions before numbers, as they are based on much simpler sets. This is where the concept of a bijection comes in: define the correspondence

a ↔ 1, b ↔ 2, c ↔ 3

Since every element of { a, b, c } is paired with precisely one element of { 1, 2, 3 }, and vice versa, this defines a bijection.

We now generalize this situation and define two sets to be of the same size if (and only if) there is a bijection between them. For all finite sets this gives us the usual definition of "the same size". What does it tell us about the size of infinite sets?

Consider the sets A = { 1, 2, 3, ... }, the set of positive integers and B = { 2, 4, 6, ... }, the set of even positive integers. We claim that, under our definition, these sets have the same size, and that therefore B is countably infinite. Recall that to prove this we need to exhibit a bijection between them. But this is easy, using n ↔ 2n, so that

1 ↔ 2, 2 ↔ 4, 3 ↔ 6, 4 ↔ 8, ....

As in the earlier example, every element of A has been paired off with precisely one element of B, and vice versa. Hence they have the same size. This gives an example of a set which is of the same size as one of its proper subsets, a situation which is impossible for finite sets.

Likewise, the set of all ordered pairs of natural numbers is countably infinite, as can be seen by following a path like the one in the picture:

The Cantor pairing function assigns one natural number to each pair of natural numbers

The resulting mapping is like this:

0 ↔ (0,0), 1 ↔ (1,0), 2 ↔ (0,1), 3 ↔ (2,0), 4 ↔ (1,1), 5 ↔ (0,2), 6 ↔ (3,0) ....

It is evident that this mapping will cover all such ordered pairs.

Interestingly: if you treat each pair as being the numerator and denominator of a vulgar fraction, then for every positive fraction, we can come up with a distinct number corresponding to it. This representation includes also the natural numbers, since every natural number is also a fraction N/1. So we can conclude that there are exactly as many positive rational numbers as there are positive integers. This is true also for all rational numbers, as can be seen below (a more complex presentation is needed to deal with negative numbers).

Theorem: The Cartesian product of finitely many countable sets is countable.

This form of triangular mapping recursively generalizes to vectors of finitely many natural numbers by repeatedly mapping the first two elements to a natural number. For example, (0,2,3) maps to (5,3) which maps to 39.

Sometimes more than one mapping is useful. This is where you map the set which you want to show countably infinite, onto another set; and then map this other set to the natural numbers. For example, the positive rational numbers can easily be mapped to (a subset of) the pairs of natural numbers because p/q maps to (pq).

What about infinite subsets of countably infinite sets? Do these have fewer elements than N?

Theorem: Every subset of a countable set is countable. In particular, every infinite subset of a countably infinite set is countably infinite.

For example, the set of prime numbers is countable, by mapping the n-th prime number to n:

  • 2 maps to 1
  • 3 maps to 2
  • 5 maps to 3
  • 7 maps to 4
  • 11 maps to 5
  • 13 maps to 6
  • 17 maps to 7
  • 19 maps to 8
  • 23 maps to 9
  • etc.

What about sets being "larger than" N? An obvious place to look would be Q, the set of all rational numbers, which intuitively may seem much bigger than N. But looks can be deceiving, for we assert:

Theorem: Q (the set of all rational numbers) is countable.

Q can be defined as the set of all fractions a/b where a and b are integers and b > 0. This can be mapped onto the subset of ordered triples of natural numbers (a, b, c) such that a ≥ 0, b > 0, a and b are coprime, and c ∈ {0, 1} such that c = 0 if a/b ≥ 0 and c = 1 otherwise.

  • 0 maps to (0,1,0)
  • 1 maps to (1,1,0)
  • −1 maps to (1,1,1)
  • 1/2 maps to (1,2,0)
  • −1/2 maps to (1,2,1)
  • 2 maps to (2,1,0)
  • −2 maps to (2,1,1)
  • 1/3 maps to (1,3,0)
  • −1/3 maps to (1,3,1)
  • 3 maps to (3,1,0)
  • −3 maps to (3,1,1)
  • 1/4 maps to (1,4,0)
  • −1/4 maps to (1,4,1)
  • 2/3 maps to (2,3,0)
  • −2/3 maps to (2,3,1)
  • 3/2 maps to (3,2,0)
  • −3/2 maps to (3,2,1)
  • 4 maps to (4,1,0)
  • −4 maps to (4,1,1)
  • ...

By a similar development, the set of algebraic numbers is countable, and so is the set of definable numbers.

Theorem: (Assuming the axiom of countable choice) The union of countably many countable sets is countable.

For example, given countable sets a, b, c ...

Using a variant of the triangular enumeration we saw above:

  • a0 maps to 0
  • a1 maps to 1
  • b0 maps to 2
  • a2 maps to 3
  • b1 maps to 4
  • c0 maps to 5
  • a3 maps to 6
  • b2 maps to 7
  • c1 maps to 8
  • d0 maps to 9
  • a4 maps to 10
  • ...

Note that this only works if the sets a, b, c,... are disjoint. If not, then the union is even smaller and is therefore also countable by a previous theorem.

Also note that the axiom of countable choice is needed in order to index all of the sets a, b, c,...

Theorem: The set of all finite-length sequences of natural numbers is countable.

This set is the union of the length-1 sequences, the length-2 sequences, the length-3 sequences, each of which is a countable set (finite Cartesian product). So we are talking about a countable union of countable sets, which is countable by the previous theorem.

Theorem: The set of all finite subsets of the natural numbers is countable.

If you have a finite subset, you can order the elements into a finite sequence. There are only countably many finite sequences, so also there are only countably many finite subsets.

The following theorem gives equivalent formulations in terms of a bijective function or a surjective function. A proof of this result can be found in Lang's text.[2]

Theorem: Let S be a set. The following statements are equivalent:

  1. S is countable, i.e. there exists an injective function
    .
  2. Either S is empty or there exists a surjective function
    .
  3. Either S is finite or there exists a bijection
    .

Several standard properties follow easily from this theorem. We present them here tersely. For a gentler presentation see the sections above. Observe that in the theorem can be replaced with any countably infinite set. In particular we have the following Corollary.

Corollary: Let S and T be sets.

  1. If the function
    is injective and T is countable then S is countable.
  2. If the function
    is surjective and S is countable then T is countable.

Proof: For (1) observe that if T is countable there is an injective function Then if is injective the composition is injective, so S is countable.

For (2) observe that if S is countable there is a surjective function Then if is surjective the composition is surjective, so T is countable.

Proposition: Any subset of a countable set is countable.

Proof: The restriction of an injective function to a subset of its domain is still injective.

Proposition: The Cartesian product of two countable sets A and B is countable.

Proof: Note that is countable as a consequence of the definition because the function given by is injective. It then follows from the Basic Theorem and the Corollary that the Cartesian product of any two countable sets is countable. This follows because if A and B are countable there are surjections and . So

is a surjection from the countable set to the set and the Corollary implies is countable. This result generalizes to the Cartesian product of any finite collection of countable sets and the proof follows by induction on the number of sets in the collection.

Proposition: The integers are countable and the rational numbers are countable.

Proof: The integers are countable because the function given by if n is non-negative and if n is negative is an injective function. The rational numbers are countable because the function given by is a surjection from the countable set to the rationals .

Proposition: If is a countable set for each then is countable.

Proof: This is a consequence of the fact that for each n there is a surjective function and hence the function

given by is a surjection. Since is countable the Corollary implies is countable. We are using the axiom of countable choice in this proof in order to pick for each a surjection from the non-empty collection of surjections from to .

Cantor's Theorem asserts that if is a set and is its power set, i.e. the set of all subsets of , then there is no surjective function from to . A proof is given in the article Cantor's Theorem. As an immediate consequence of this and the Basic Theorem above we have:

Proposition: The set is not countable; i.e. it is uncountable.

For an elaboration of this result see Cantor's diagonal argument.

The set of real numbers is uncountable (see Cantor's first uncountability proof), and so is the set of all infinite sequences of natural numbers. A topological proof for the uncountability of the real numbers is described at finite intersection property.

Minimal model of set theory is countable

If there is a set which is a standard model (see inner model) of ZFC set theory, then there is a minimal standard model (see Constructible universe). The Löwenheim-Skolem theorem can be used to show that this minimal model is countable. The fact that the notion of "uncountability" makes sense even in this model, and in particular that this model M contains elements which are

  • subsets of M, hence countable,
  • but uncountable from the point of view of M,

was seen as paradoxical in the early days of set theory, see Skolem's paradox.

The minimal standard model includes all the algebraic numbers and all effectively computable transcendental numbers, as well as many other kinds of numbers.

Total orders

Countable sets can be totally ordered in various ways, e.g.:

  • Well orders (see also ordinal number):
    • The usual order of natural numbers (0, 1, 2, 3, 4, 5, ...)
    • The integers in the order (0, 1, 2, 3, ...; −1, −2, −3, ...)
  • Other (NOT well orders):
    • The usual order of integers (..., -3, -2, -1, 0, 1, 2, 3, ...)
    • The usual order of rational numbers (Cannot be explicitly written as a list!)

Note that in both examples of well orders here, any subset has a least element; and in both examples of non-well orders, some subsets do NOT have a least element. This is the key definition that determines whether a total order is also a well order.

See also

Property Brokers and Team Managers – Looking for good Actual Estate Agency to join or contemplating which is the Finest Property Agency to join in Singapore? Join Leon Low in OrangeTee Singapore! In OrangeTee, we've much more attractive commission structure than before, enrichment courses, 10 most vital components to hitch OrangeTee and 1 motive to join Leon Low and his Workforce. 1. Conducive working environment

Via PropNex International, we continually construct on our fame in the international property enviornment. Click here for more of our abroad initiatives. Instances have modified. We don't see those unlawful hawkers anymore. Instead, nicely dressed property brokers were seen reaching out to people visiting the market in the morning. Real estate can be a lonely enterprise and it is straightforward to really feel demoralised, especially when there are no enquiries despite your greatest effort in advertising your shopper's property. That is the place having the fitting assist from fellow associates is essential. Our firm offers administration services for condominiums and apartments. With a crew of qualified folks, we assist to make your estate a nicer place to stay in. HDB Flat for Hire 2 Rooms

Achievers are all the time the first to check new technologies & providers that can help them enhance their sales. When property guru first began, many brokers didn't consider in it until they began listening to other colleagues getting unbelievable outcomes. Most brokers needs to see proof first, before they dare to take the first step in attempting. These are often the late comers or late adopters. There is a purpose why top achievers are heading the wave or heading the best way. Just because they try new properties in singapore issues ahead of others. The rest just observe after!

Firstly, a Fraudulent Misrepresentation is one that is made knowingly by the Representor that it was false or if it was made without belief in its fact or made recklessly without concerning whether or not it is true or false. For instance estate agent A told the potential consumers that the tenure of a landed property they are considering is freehold when it is really one with a ninety nine-yr leasehold! A is responsible of constructing a fraudulent misrepresentation if he is aware of that the tenure is the truth is a ninety nine-yr leasehold instead of it being freehold or he didn't consider that the tenure of the house was freehold or he had made the assertion with out caring whether or not the tenure of the topic property is in fact freehold.

I such as you to be, am a brand new projects specialist. You've got the conception that new tasks personnel should be showflat certain. Should you're eager, let me train you the right way to master the entire show flats island vast as a substitute of getting to stay just at 1 place. Is that attainable you may ask, well, I've achieved it in 6 months, you can too. Which company is well-recognized and is actually dedicated for developing rookie within the industry in venture sales market with success? Can a rookie join the company's core group from day one? I wish to propose a third class, which I have been grooming my agents in the direction of, and that is as a Huttons agent, you will be able to market and have knowledge of ALL Huttons projects, and if essential, projects exterior of Huttons as properly.

GPS has assembled a high workforce of personnel who are additionally well-known figures in the native actual property scene to pioneer this up-and-coming organization. At GPS Alliance, WE LEAD THE WAY! Many people have asked me how I managed to earn S$114,000 from my sales job (my third job) at age 24. The reply is easy. After graduation from NUS with a Historical past diploma, my first job was in actual estate. Within the ultimate part of this series, I interview one of the top agents in ERA Horizon Group and share with you the secrets to his success! Learn it RIGHT HERE

Notice that the application must be submitted by the appointed Key Government Officer (KEO) such as the CEO, COO, or MD. Once the KEO has submitted the mandatory paperwork and assuming all documents are in order, an email notification shall be sent stating that the applying is permitted. No hardcopy of the license might be issued. A delicate-copy could be downloaded and printed by logging into the CEA website. It takes roughly four-6 weeks to course of an utility.

Notes

  1. For an example of this usage see Template:Harv
  2. 2.0 2.1 See Template:Harv.
  3. See Template:Harv.
  4. Since there is an obvious bijection between and it makes no difference whether one considers 0 to be a natural number of not. In any case, this article follows ISO 31-11 and the standard convention in mathematical logic, which make 0 a natural number.

References

  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  • Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010

Template:Logic

Real Estate Agent Renaldo Lester from Saint-Jean-Chrysostome, has several hobbies which include leathercrafting, property developers in singapore apartment for sale, this contact form, and crochet. Loves to see new cities and places like Ruins of Loropéni.

ar:مجموعة قابلة للعد bn:গণনাযোগ্য সেট bg:Изброимо множество ca:Conjunt numerable cs:Spočetná množina da:Tællelig mængde de:Abzählbarkeit es:Conjunto numerable eo:Kalkulebla aro eu:Multzo zenbakarri fa:مجموعه شمارا fr:Ensemble dénombrable gl:Conxunto contábel ko:가산 집합 is:Teljanlegt mengi it:Insieme numerabile he:קבוצה בת מנייה ka:თვლადი სიმრავლე kk:Саналымсыз жиын lt:Skaiti aibė lmo:Cungjuunt cüntàbil nl:Aftelbare verzameling ja:可算集合 no:Tellbar nn:Teljeleg pl:Zbiór przeliczalny pt:Conjunto contável ru:Счётное множество simple:Countable set sk:Spočítateľná množina sl:Števna množica sr:Пребројив скуп fi:Numeroituva joukko sv:Uppräknelig ta:எண்ணுறுமையும் எண்ணுறாமையும் uk:Зліченна множина vi:Tập hợp đếm được zh:可數集