Content deleted Content added
m potential application of set theory |
m clean up, replaced: journal=Turkish Journal of Computer and Mathematics Education (TURCOMAT) → journal=Turkish Journal of Computer and Mathematics Education |
||
(22 intermediate revisions by 14 users not shown) | |||
Line 1:
{{Short description|Set that is not a finite set}}
▲{{Refimprove|date=September 2011}}
[[File:Real numbers.svg|alt=Set Theory Image|thumb|Set Theory Image]]
In [[set theory]], an '''infinite set''' is a [[Set (mathematics)|set]] that is not a [[finite set]]. [[Infinity|Infinite]] sets may be [[countable set|countable]] or [[uncountable set|uncountable]].
==Properties==
The set of [[natural numbers]] (whose existence is postulated by the [[axiom of infinity]]) is infinite.<ref name=
A set is infinite if and only if for every natural number, the set has a [[subset]] whose [[cardinality]] is that natural number.<ref>{{
If the [[axiom of choice]] holds, then a set is infinite if and only if it includes a countable infinite subset.
If a [[set of sets]] is infinite or contains an infinite element, then its union is infinite. The [[power set]] of an infinite set is infinite.<ref name=":1" /> Any [[subset|superset]] of an infinite set is infinite. If an infinite set is partitioned into finitely many subsets, then at least one of them must be infinite. Any set which can be mapped ''[[onto]]'' an infinite set is infinite. The [[Cartesian product]] of an infinite set and a nonempty set is infinite. The Cartesian product of an infinite number of sets, each containing at least two elements, is either empty or infinite; if the axiom of choice holds, then it is infinite.
If an infinite set is a [[well-ordered set]], then it must have a nonempty, nontrivial subset that has no greatest element.
Line 28:
If an infinite set is a [[well-orderable set]], then it has many well-orderings which are non-isomorphic.
==History==
Both Burton and Rogers use finite sets to start to explain infinite sets using proof concepts such as mapping, proof by induction, or proof by contradiction.
In Chapter 12 of ''The History of Mathematics: An Introduction'', Burton emphasizes how mathematicians such as [[Ernst Zermelo|Zermelo]], [[Dedekind]], [[Galileo]], [[Leopold Kronecker|Kronecker]], Cantor, and [[Bernard Bolzano|Bolzano]] investigated and influenced infinite set theory. Many
One potential application of infinite set theory is in genetics and biology.
▲One potential application of infinite set theory is in genetics and biology. <ref>{{Cite journal |last=Shelah |first=Saharon |last2=Strüngmann |first2=Lutz |date=2021-06-01 |title=Infinite combinatorics in mathematical biology |url=https://www.sciencedirect.com/science/article/pii/S0303264721000496 |journal=Biosystems |language=en |volume=204 |pages=104392 |doi=10.1016/j.biosystems.2021.104392 |issn=0303-2647}}</ref>
==Examples==
===Countably infinite sets===
The set of all [[integer]]s, {...,
The set of all [[
===Uncountably infinite sets===
The set of all [[real number]]s is an uncountably infinite set. The set of all [[
The set of all subsets of the integers is uncountably infinite.
==See also==
Line 54 ⟶ 55:
==References==
{{Reflist}}
== External links ==
|