What Does Order Mean in the Context of Finite Sets?

  • Context: Undergrad 
  • Thread starter Thread starter Shing
  • Start date Start date
  • Tags Tags
    Sets
Click For Summary
SUMMARY

A finite set of order n is defined as a set containing exactly n elements. The Cartesian product of sets, denoted as A = A_1 × A_2 × ... × A_n, results in an ordered n-tuple of elements from those sets. To prove that the number of subsets of a finite set of order n is 2^n, one can use mathematical induction, demonstrating that each subset corresponds uniquely to an n-tuple of binary indicators representing the presence or absence of each element.

PREREQUISITES
  • Understanding of finite sets and their properties
  • Familiarity with Cartesian products of sets
  • Basic knowledge of mathematical induction
  • Concept of n-tuples and their representation
NEXT STEPS
  • Study the properties of Cartesian products in set theory
  • Learn about mathematical induction techniques in proofs
  • Explore the concept of subsets and their cardinality
  • Investigate the relationship between binary representations and set membership
USEFUL FOR

Students of mathematics, particularly those studying set theory and combinatorics, as well as educators looking to enhance their understanding of finite sets and their properties.

Shing
Messages
141
Reaction score
1
I am reading a book named sets & groups,
I would like to ask:
What exactly is a finite set of order n? [itex]A_1\times A_2\times A_3...A_n[/itex] ?
is pair [itex](x_1,x_2,x_3...x_m)[/itex] counted as a single element? or a set? or an order?
also how should I prove that the number of subsets, including empty set, of a finite set of order n is [itex]2^n[/itex]?


Thanks!
 
Physics news on Phys.org
The order of a set is just the number of elements in a set. So a finite set of order n is a set with n elements.

You can also look at Cartesian products of set, and then the elements of that set will be pairs / triples / (n-)tuples of elements from those sets. You can prove that the order of the product [itex]A = A_1 \times A_2 \times \cdots \times A_n[/itex] is [itex]|A| = |A_1| \times |A_2| \times \cdots \times |A_n|[/itex] where |X| denotes the order of set X.

For your last question: note that if you have finitely many elements you can list them all. One way to proceed is to write down a one or zero for each of them, indicating whether they are in a given subset or not. You can put all of these in an n-tuple. Then show that each such n-tuple corresponds to one particular subset and that each subset can be written as one particular n-tuple; finally count then number of n-tuples you can make.
 
Shing said:
I am reading a book named sets & groups,
I would like to ask:
What exactly is a finite set of order n?
A set containing exactly n members.

[itex]A_1\times A_2\times A_3...A_n[/itex] ?
Since you haven't said what A1 etc. are, I can't say!

is pair [itex](x_1,x_2,x_3...x_m)[/itex] counted as a single element? or a set? or an order?
Well, that's not a "pair" of course, but the "ordered m-tuplet" is a member of
[itex]A_1\times A_2\times A_3...A_n[/itex].

also how should I prove that the number of subsets, including empty set, of a finite set of order n is [itex]2^n[/itex]?Thanks!


By induction on n. If A is of order 1, it contains the single element {a} and so has 21= 2 subsets, {} and {a}.

Now, suppose A has k+1 members. Choose one of them, call it z, and note that any subset of A either contains z or doesn't. If it doesn't contain z, it is a subset of A-{z} which has k members. If it does contain z, it can be written as [itex]C\union {z}[/itex]
and C is a subset of A-{z}.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 28 ·
Replies
28
Views
6K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
1
Views
2K