Constructing proofs of denumerable sets

  • Context: Graduate 
  • Thread starter Thread starter buffordboy23
  • Start date Start date
  • Tags Tags
    Proofs Sets
Click For Summary
SUMMARY

This discussion focuses on the construction of proofs for denumerable sets within the context of functional analysis and set theory. It emphasizes the necessity of establishing a one-to-one correspondence between the elements of a set and the natural numbers to demonstrate denumerability. The diagonal method is highlighted as a crucial technique for enumerating elements in cases where sets can be represented in an infinite table format. The conversation concludes that diagonal counting is essential when dealing with denumerable collections of denumerable sets.

PREREQUISITES
  • Understanding of functional analysis concepts
  • Familiarity with set theory and denumerability
  • Knowledge of the diagonal method in proofs
  • Ability to construct one-to-one correspondences
NEXT STEPS
  • Study the diagonal method in detail for proving denumerability
  • Explore the implications of denumerable sets in functional analysis
  • Learn about one-to-one correspondence techniques in set theory
  • Investigate the properties of infinite sets and their enumerations
USEFUL FOR

Students and researchers in mathematics, particularly those focusing on functional analysis and set theory, as well as educators teaching concepts related to denumerable sets.

buffordboy23
Messages
545
Reaction score
2
Hi, I am doing some self-studying on the topic of functional analysis, specifically set theory at the moment.

Suppose that we want to show that some set is denumerable. Is it required that we directly show the one-to-one correspondence between the elements of the set and the set of natural numbers? This seems to be the method of proof employed in the text for the given theorems, but the results of the theorems themselves seem to offer hand-waving. For example, the set that consists of the sum of a denumerable number of denumerable sets is itself denumerable.

Now suppose that the elements of some set that we are trying to prove is denumerable can be represented by a table of infinite elements. Must we use the "diagonal method" to prove that we can enumerate the elements of this set? Or is it sufficient to enumerate row by row, although the number of elements in each row of the table is infinite (we would never make it to the next row)?
 
Physics news on Phys.org
HI

when constructing proofs for a denumerable number of denumerable sets you will need to use diagonal counting.
 

Similar threads

Undergrad Missing(?) rigor in proof involving countable union of countable sets
  • · Replies 10 ·
Replies
10
Views
2K
Undergrad Is an algorithm for a proof required to halt?
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad Countability of binary Strings
  • · Replies 18 ·
Replies
18
Views
4K
Proving that the algebraic numbers are denumerable
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad An easy proof of Gödel's first incompleteness theorem?
  • · Replies 16 ·
Replies
16
Views
3K
Undergrad Error(?) in proof that the rational numbers are denumerable
  • · Replies 3 ·
Replies
3
Views
2K
High School One thing I don't understand about Cantor's diagonal argument
  • · Replies 55 ·
2
Replies
55
Views
9K
Undergrad Does the definition of cardinality assume distinguishability?
  • · Replies 9 ·
Replies
9
Views
2K
Undergrad Add an exponential number of elements, what will be the final cardinality?
  • · Replies 16 ·
Replies
16
Views
2K
Undergrad Thinking about equality of infinite sets
  • · Replies 5 ·
Replies
5
Views
3K