Partition Axioms for Set P: Is P a Partition of Set A?

  • Thread starter Thread starter iHeartof12
  • Start date Start date
  • Tags Tags
    Partition Set
Click For Summary

Homework Help Overview

The discussion revolves around determining whether a given set P is a partition of the set A, where A is defined as ℝ and P consists of the intervals (-∞,-1), [-1,1], and (1,∞). Participants are exploring the criteria that define a partition in set theory.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants are questioning the definition of a partition and discussing the necessary conditions for P to qualify as one. They are considering whether the subsets are non-intersecting and whether their union covers the original set A. There is also a reference to a formal definition of a partition provided by one participant.

Discussion Status

The conversation is ongoing, with participants clarifying the definition of a partition and examining the specific conditions that apply to the sets in question. There is an acknowledgment of the definition's validity, and participants are prompted to evaluate which axioms hold true for the sets being discussed.

Contextual Notes

Participants are operating under the assumption that the subsets must be non-empty, non-intersecting, and collectively exhaustive to satisfy the definition of a partition. There is a focus on verifying these conditions for the specific sets involved.

iHeartof12
Messages
24
Reaction score
0
For the given set A, determine whether P is a partition of A.

A= ℝ, P=(-∞,-1)[itex]\cup[/itex][-1,1][itex]\cup[/itex](1,∞)

Is it correct to say that P is not partition? I don't understand why.

Thank you
 
Physics news on Phys.org
A partition, as far as I know, is just a division of the set into non-intersecting subsets s.t. the union of all subsets is the original set and all subsets are non-empty.

How can you show whether or not the sets are non-intersecting? How can you show whether or not the union of the sets covers the original set? It is pretty easy to show no subset is empty.

More simply, do any of the subsets overlap with other subsets? Is there any element of ℝ that isn't in one of the subsets? If either of these is true, then the definition of a partition fails. If both are false, then we have satisfied the definition of a partition.
 
Last edited:
Here's the definition of partition as described by my one of my professor's notes:

Let [itex]X \not= \emptyset[/itex] and let each [itex]A_\alpha[/itex], where [itex]\alpha \in \Omega[/itex], be a subset of [itex]X[/itex]. Then the family of subsets [itex]\{ A_\alpha : \alpha \in \Omega \}[/itex] of [itex]X[/itex] is a partition of [itex]X[/itex] if and only if

(i) [itex]A_\alpha \not= \emptyset, \forall \alpha \in \Omega[/itex]

(ii) [itex]\bigcup_{\alpha \in \Omega} A_\alpha = X[/itex]

(iii) [itex]\forall \alpha, \beta \in \Omega[/itex], either [itex]A_\alpha = A_\beta[/itex] or [itex]A_\alpha \cap A_\beta = \emptyset[/itex].​

Does this make sense?
 
The definition makes sense, yes. Which of these three axioms would you say are true in the problem you're considering?
 

Similar threads

Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 22 ·
Replies
22
Views
5K
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K