Summary
In mathematics, a set A is Dedekind-infinite (named after the German mathematician Richard Dedekind) if some proper subset B of A is equinumerous to A. Explicitly, this means that there exists a bijective function from A onto some proper subset B of A. A set is Dedekind-finite if it is not Dedekind-infinite (i.e., no such bijection exists). Proposed by Dedekind in 1888, Dedekind-infiniteness was the first definition of "infinite" that did not rely on the definition of the natural numbers. A simple example is , the set of natural numbers. From Galileo's paradox, there exists a bijection that maps every natural number n to its square n2. Since the set of squares is a proper subset of , is Dedekind-infinite. Until the foundational crisis of mathematics showed the need for a more careful treatment of set theory, most mathematicians assumed that a set is infinite if and only if it is Dedekind-infinite. In the early twentieth century, Zermelo–Fraenkel set theory, today the most commonly used form of axiomatic set theory, was proposed as an axiomatic system to formulate a theory of sets free of paradoxes such as Russell's paradox. Using the axioms of Zermelo–Fraenkel set theory with the originally highly controversial axiom of choice included (ZFC) one can show that a set is Dedekind-finite if and only if it is finite in the usual sense. However, there exists a model of Zermelo–Fraenkel set theory without the axiom of choice (ZF) in which there exists an infinite, Dedekind-finite set, showing that the axioms of ZF are not strong enough to prove that every set that is Dedekind-finite is finite. There are definitions of finiteness and infiniteness of sets besides the one given by Dedekind that do not depend on the axiom of choice. A vaguely related notion is that of a Dedekind-finite ring. This definition of "infinite set" should be compared with the usual definition: a set A is infinite when it cannot be put in bijection with a finite ordinal, namely a set of the form {0, 1, 2, ...
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (13)
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
MATH-328: Algebraic geometry I - Curves
Algebraic geometry is the common language for many branches of modern research in mathematics. This course gives an introduction to this field by studying algebraic curves and their intersection theor
MATH-201: Analysis III
Calcul différentiel et intégral. Eléments d'analyse complexe.
Show more
Related lectures (136)
Derangements: Permutations and ProbabilitiesCS-101: Advanced information, computation, communication I
Covers advanced counting, probabilities, and information theory, including solving linear homogeneous recurrence relations and hat-check problems.
Complex Analysis: Laurent SeriesMATH-201: Analysis III
Explores Laurent series in complex analysis, emphasizing singularities, residues, and the Cauchy theorem.
Shell Components in Meromorphic Parameter Spaces
Explores shell components in transcendental parameter planes and attracting cycles.
Show more