I Contrapositive of theorem and issue with proof

  • I
  • Thread starter Thread starter psie
  • Start date Start date
  • Tags Tags
    Logic
psie
Messages
315
Reaction score
40
TL;DR Summary
I'm stuck on a contrapositive of a theorem and a logical issue with a proof. It concerns the statement that the image of a connected set is connected under a continuous map.
Consider the following theorem:

Theorem Suppose that ##f:X\to Y## is a continuous map between two topological spaces ##X## and ##Y##. Then ##f(X)## is connected if ##X## is.

First, I don't know how to take the contrapositive of this statement. I'm not sure if the opening hypothesis, that is, ##f## is continuous, remains outside. Because the way this is proved in the text I'm reading is by assuming ##f(X)## is disconnected and then using continuity to show that ##X## is also disconnected. Since the author uses the continuity assumption, it seems like that is not a part of the statement that one takes the contrapositive of.

Yet, I saw someone claim,

Claim If a function has a connected domain ##X## and a disconnected range ##f(X)##, then the function is not continuous on ##X##.

So in this claim it seems like that the continuity is actually negated as well. I'm confused and I'm now doubting the validity of the proof of the theorem. What is correct and what isn't?
 
Last edited:
Physics news on Phys.org
A: A function f(X) is a continuous map between two topological spaces X and f(X)
B: f(X) is connected
C: X is connected

If C and Not B, then Not A.

So the original sentence is When A: Then B, if C.
This can be rewritten: If A, then (if C then B)
The contrapositive: If not (if C then B) then not A.

(if C then B) is false only when C is true and B is false
so: not (if C then B) == ( C and not B)
Thus: If not (if C then B) then not A == if (C and not B) then not A

QED
 
psie said:
So in this claim it seems like that the continuity is actually negated as well. I'm confused and I'm now doubting the validity of the proof of the theorem. What is correct and what isn't?
The theorem itself is of the form:

Suppose ##f## is continuous, then property A holds.

The contrapositive of that is:

If property A does not hold, then ##f## is not continuous.

That's probably the answer for the contrapositive of the theorem.

In this case, property A is also an "if-then":

If ##X## is connected, then ##f(X)## is connected.

The contrapositive of property A is:

If ##f(X)## is not connected, then ##X## is not connected. But, that's not the contrapositive of the theorem.
 
Hmm, ok. I'm still uncertain about that proof. Is it correct to use the continuity of the function when proving the contrapositive of the theorem?
 
psie said:
Hmm, ok. I'm still uncertain about that proof. Is it correct to use the continuity of the function when proving the contrapositive of the theorem?
What I said was that there is a difference between the contrapositive (statement) of the theorem and the contrapositive (statement) of a condition or property used in the theorem.

In that sense, we are arguing about a definition of what precisely the contrapositive means in this case. There's no error in either argument that is not based on an interpretation of the question.
 
Let ##A##, ##B## and ##C## be propositions. Then the following formulas are equivalent.
\begin{align*}
&A\to (B\to C)\\
&A\land B\to C\\
&B\to (A\to C)\end{align*}Therefore there are many ways to construct equivalent statements using contrapositive. Below ##F\equiv G## means that ##F## and ##G## are equivalent.
\begin{align*}
A\to (B\to C)&\quad\equiv\quad\neg(B\to C)\to\neg A&&\equiv\quad B\land\neg C\to\neg A\tag{1}\\
A\to (B\to C)&\quad\equiv\quad A\to(\neg C\to\neg B)\tag{2}\\
A\land B\to C&\quad\equiv\quad\neg C\to\neg(A\land B)&&\equiv\quad\neg C\to\neg A\lor\neg B\tag{3}\\
B\to (A\to C)&\quad\equiv\quad\neg(A\to C)\to\neg B&&\equiv\quad A\land\neg C\to\neg B\tag{4}\\
B\to (A\to C)&\quad\equiv\quad B\to(\neg C\to\neg A)\tag{5}\end{align*}Usually contrapositive is applied when the assumption and the conclusion of the implication are atomic rather than compound propositions. This means that proving formulas at the end of lines (1) and (4) is somewhat unusual but still valid way to prove ##A\to(B\to C)##. I believe a more common way is to leave one of the assumptions ##A## or ##B## unchanged and then take the contrapositive of the remaining implication as in lines (2) and (5).

In this situation if we denote "##f## is continuous" by ##A##, "##X## is connected" by ##B## and "##f(X)## is connected" by ##C##, then the text proved formula in (2). The second claim in post 1 is (1).
 
  • Like
Likes psie and PeroK
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
7
Views
1K
Replies
10
Views
2K
Replies
5
Views
535
Replies
2
Views
2K
Replies
9
Views
2K
Back
Top