Where is the error in this proof?

  • Thread starter Thread starter Syrus
  • Start date Start date
  • Tags Tags
    Error Proof
Click For Summary

Homework Help Overview

The discussion revolves around the properties of minimal elements in partially ordered sets, specifically whether a subset with exactly one minimal element must also contain a smallest element. Participants are tasked with providing a proof or counterexample to this assertion.

Discussion Character

  • Conceptual clarification, Problem interpretation, Assumption checking

Approaches and Questions Raised

  • Participants explore the translation of the definition of minimal elements and question the validity of the original proof attempt. There is a focus on the logical implications of the definitions used and whether the assumptions hold true in specific cases.

Discussion Status

Several participants have pointed out potential errors in the original proof attempt, particularly in the translation of definitions and the application of logical implications. There is ongoing clarification of terms and assumptions, with some participants suggesting alternative interpretations and questioning the correctness of the reasoning presented.

Contextual Notes

Participants are working under the constraints of a homework assignment, which requires them to either prove or provide a counterexample regarding the relationship between minimal and smallest elements in partially ordered sets. There is an acknowledgment of possible errors in the initial reasoning and translations, which are being actively discussed.

Syrus
Messages
213
Reaction score
0

Homework Statement



If a subset (call it B) of a partially ordered (by a relation R) set A has exactly one minimal element, must that element be a smallest element? Give proof or counterexample.


Homework Equations



Well, our given, "exactly one minimal element" in PC (pred calc.) translates to:

(∃b)((∀x)((x,b) ∈ R → x = b) ∧ (∀y)((∀z)((z,y) ∈ R → b = y))

i hope...


The Attempt at a Solution



Call b the unique minimal element of B and let k ∈ B. Since (k,k) ∈ R, then using our assumption (∀y)((∀z)((z,y) ∈ R → b = y), b = k. Thus, (b,k) ∈ R.
 
Last edited:
Physics news on Phys.org
You made an error in the translation (and you forgot a ")" at the end).
Take for example the natural numbers (for which of course b=0), then the second part of your statement says if we have two numbers such that z \leq y then y=0.
Or am I making a mistake?
 
I see I did make an error. I basically used the definition of Existence and uniqueness and plugged in the definition of minimal element to come up with the above statement. Would this, then, be the correct translation of the statement?

(∃b)((∀x)((x,b) ∈ R → x = b) ∧ (∀y)((∀z)((z,y) ∈ R → z = y) → b = y)

And if so, it would seem my same "proof" above still holds. Any other suggestions/insight?
My "proof" would now be:
Call b the unique minimal element of B and let k ∈ B. Since (k,k) ∈ R, and (clearly) thus k = k, using our assumption (∀y)((∀z)((z,y) ∈ R → b = y), b = k. Thus, (b,k) ∈ R.

By the way, there is a counterexample to this "theorem", but i am just trying to figure out where I went wrong in an attempt to prove it.
 
Last edited:
"using our assumption (∀y)((∀z)((z,y) ∈ R → b = y), b = k"

Can you explain this? What is the assumption there? What is the conclusion there? It's not making sense for me
 
Well, to "prove" the statement, we use the antecedent of the implication to be proven, "If a subset (call it B) of a partially ordered (by a relation R) set A has exactly one minimal element," as a given. This statement may be logically expressed as (∃b)((∀x)((x,b) ∈ R → x = b) ∧ (∀y)((∀z)((z,y) ∈ R → z = y) → b = y). Thus, we assume there is some b ∈ B such that (∀x)((x,b) ∈ R → x = b) and (∀y)((∀z)((z,y) ∈ R → z = y) → b = y).

Now, our goal is (∀x)((b,x) ∈ R).

As a result, let x ∈ B. Since (x,x) ∈ R (which is true since R is a partial order) implies x = x (which is true anyways), then using the second conjunct of the given above (which is what is referred to earlier when I stated "using our assumption..." above) we may conclude b = x, so (b,x) ∈ R
 
Last edited:
mr. vodka said:
"using our assumption (∀y)((∀z)((z,y) ∈ R → b = y), b = k"

Also, note i edited my first post, your quote above should be changed to (∀y)((∀z)((z,y) ∈ R → z = y) → b = k)
 
"Also, note i edited my first post, your quote above should be changed to..."

You didn't though :p

Anyway: it's not clear to me how you apply "(∀y)((∀z)((z,y) ∈ R → z = y) → b = k)"
What variable is representing your x?
 
mr. vodka said:
You didn't though :p

Sorry, heh heh, guess i meant my following post. It's not letting me edit the original one.



mr. vodka said:
Anyway: it's not clear to me how you apply "(∀y)((∀z)((z,y) ∈ R → z = y) → b = k)"
What variable is representing your x?

I mistyped a letter above, it should be "(∀y)((∀z)((z,y) ∈ R → z = y) → b = y)

I am letting the arbitrary x introduced be used for both z and y.
 
Last edited:
Well, i am letting x be y and z.
You're misreading what "(∀y)((∀z)((z,y) ∈ R → z = y) → b = y)" means.

It says that (given a certain y) IF "(∀z)((z,y) ∈ R → z = y)" THEN "b = y"
Is the IF part true in your case?
 
  • #10
Let me be more exact: in your case y = x, okay, now you have to check that "(∀z)((z,x) ∈ R → z = x)"
but you have only verified this for the trivial case of z = x
 
  • #11
Aha!
 

Similar threads

Replies
2
Views
1K
Replies
3
Views
2K
Replies
1
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
3
Views
2K