Proofs on Sets: Help with Proving (A \cup B) X C

  • Context: Undergrad 
  • Thread starter Thread starter bigrodey77
  • Start date Start date
  • Tags Tags
    Proofs Sets
Click For Summary

Discussion Overview

The discussion revolves around proving the equality of two set expressions involving the Cartesian product: (A ∪ B) × C and (A × C) ∪ (B × C). Participants are seeking clarification on the proof structure and validity, as well as addressing potential misunderstandings regarding notation and logical steps.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Ryan presents a proof attempting to show that (A ∪ B) × C = (A × C) ∪ (B × C), starting with an element x in (A ∪ B) × C.
  • Some participants question the notation "X," with one suggesting it might represent intersection (∩), while another assumes it stands for Cartesian product.
  • A participant points out that the proof only establishes (A ∪ B) × C ⊆ (A × C) ∪ (B × C) and that the reverse inclusion must also be proven for equality.
  • Another participant suggests a more cautious approach by stating "IF x ∈ (A ∪ B) × C" to avoid issues if the set is empty.

Areas of Agreement / Disagreement

Participants express differing views on the validity of the proof and the interpretation of the notation. There is no consensus on the completeness of the proof, as some participants highlight missing steps necessary for establishing equality.

Contextual Notes

There are unresolved issues regarding the notation used and the logical structure of the proof. The discussion highlights the need for clarity in definitions and assumptions when dealing with set operations and proofs.

Who May Find This Useful

This discussion may be useful for students and individuals interested in set theory, particularly those learning about proofs involving Cartesian products and set operations.

bigrodey77
Messages
3
Reaction score
0
Hello all,

I'm having a hard time trying to prove a few things. I'm looking for a little help because I cannot seem to grasp the concept of proofs and what constitutes a valid proof and if my proof is wrong, correcting it.

I have a proof done and if anyone could "critique" it I would be very grateful.

Prove: (A \cup B) X C = (A X C) \cup (B X C)

Proof:
Let x \in (A \cup B) X C
Then x is of the type (y,z) where y \in A and z \in C
Then y \in A or y \in B
Since z \in C, (y,z) \in A X C or
Since z \in C, (y,z) \in B X C
Then (y,z) \in (A X C) \cup (B X C)
Therefore (A \cup B) X C = (A X C) \cup (B X C)

Thanks for your time,

Ryan
 
Physics news on Phys.org
What is X? does it stand for \cap?
 
EnumaElish said:
What is X? does it stand for \cap?

I would assume that it represents the cartesian product.
 
d_leet said:
I would assume that it represents the cartesian product.
"Duh!"

Let x in (A U B) X C
Then x is of the type (y,z) where y in A or B and z in C.

Otherwise your logic is correct.
 
Last edited:
Thank you guys very much for your responses, I am sure I'll have a couple more here tomorrow...

Thanks again!
 
Technical point: it would be better to say IF x\in (A\Cup B)\cross C. "let x ..." runs into trouble if the set is empty!

More important point: you have proved that (A\Cup B) X C \subset (A X C)\Cup (B X C), not that they are equal you still have to prove that "if x is in (A X C)\Cup (B X C), then it is in (A\Cup B) X C[\itex].
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K