Philosophy of basic set theory proofs involving or .

Click For Summary

Discussion Overview

The discussion revolves around the philosophy and methodology of proving statements in basic set theory, particularly focusing on the logical structure of "or" statements. Participants explore different approaches to handling such statements in proofs, including the implications of splitting them into cases.

Discussion Character

  • Exploratory
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant proposes splitting the "or" statement into three cases: when one is true and the other is false, and when both are true, to analyze the proof effectively.
  • Another participant suggests an alternative approach of breaking it into two cases, focusing on the truth values of each component.
  • A later reply questions the acceptability of this method in analysis, indicating a concern about its commonality in professional papers.
  • One participant introduces the concept of logical identities and the use of truth tables, arguing that the true/false distinction may not be significant in certain proofs.
  • Another participant expresses confusion regarding the previous post's explanation, indicating a lack of clarity in the discussion.
  • There is a reiteration of the initial question about the common practice of handling "or" statements in proofs, emphasizing the need for clarity and alternative methods.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the best approach to handling "or" statements in proofs. Multiple competing views remain regarding the methodology and its acceptance in formal analysis.

Contextual Notes

Some participants express uncertainty about the implications of using truth values in proofs, and there are references to the complexity of longer proofs versus shorter ones. The discussion highlights the potential limitations of different approaches without resolving them.

Who May Find This Useful

Readers interested in foundational aspects of set theory, logical reasoning in mathematics, and the philosophy of mathematical proofs may find this discussion relevant.

scorpion990
Messages
86
Reaction score
0
Philosophy of basic set theory proofs involving "or".

Hey!

I'm working through an Introduction to Analysis text, and I'm currently on the first chapter, which covers set theory. In one of the end-of-chapter problems, I'm asked to prove a basic theorem which leads to the following statement: x is an element of A, and (x is an element of B or x is an element of C).

My text (Maxwell Rosenlicht's Introduction to Analysis) lacks in the "example" department, and so for a little while, I wasn't sure how to handle this statement. I've been pondering this for a few days, and realized that "a or b" is true if:
1. a is true. b is false.
2. b is true. a is false.
3. both a and b are true.
So, I realized that the only thing I could do was split the argument into these three possibilities. I then showed that for my particular proof, all three possibilities lead to the same statement.

I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.
 
Physics news on Phys.org


One other way would be to break it into two cases:

a is true, b is unknown
a is false, b is true
 


Hmm... Yes. I noticed that the case in which both a and b are true is a repeat of another proof.

So is this an "acceptable" practice in analysis?
 


scorpion990 said:
Hey!

I'm working through an Introduction to Analysis text, and I'm currently on the first chapter, which covers set theory. In one of the end-of-chapter problems, I'm asked to prove a basic theorem which leads to the following statement: x is an element of A, and (x is an element of B or x is an element of C).

My text (Maxwell Rosenlicht's Introduction to Analysis) lacks in the "example" department, and so for a little while, I wasn't sure how to handle this statement. I've been pondering this for a few days, and realized that "a or b" is true if:
1. a is true. b is false.
2. b is true. a is false.
3. both a and b are true.
So, I realized that the only thing I could do was split the argument into these three possibilities. I then showed that for my particular proof, all three possibilities lead to the same statement.

I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.

in a mathematical proof we use logical identities called laws of logic which are always true whether your a's or b's are true or false.

So the use of true or false have no significance at all.

try to prove a theorem by using tables of true or false values,i mean a long theorem not a short one it will get you into trouble.
lets say you want to prove AU(B&C)=(AUB)&(AUC) by using your approach
furthermore mathematicians use the true false approach ,because it is too difficult for them to
grasp very simple but powerfully proofs.
For example in proving that the empty set is a set of every other set in staring the proof they have to assume , xεΦ and from that to prove xεA,where A is any set . Is very difficult for them while for a logician is an easy thing.
And what do they do?They use the F----->T trick.
Because the proof is short one and it Will not get them into trouble had they had to curry on like
in a long proof
 


I'm afraid I don't quite understand the last post =(
 


scorpion990 said:
I have a quick question: Is it common practice in set theory to split "or" statements into the three possible statements which can make it true, and proceed in this way? It makes a lot of sense intuitively, but I've never seen it done in any professional papers. Is there any other way to handle such statements? Thanks.

Try to do it in proving ...AU(B&C)=(AUB)&(AUC)
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 54 ·
2
Replies
54
Views
7K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 14 ·
Replies
14
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K