Intermediate value theorem
From Maths
Stub grade: D
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Needs linking to from other pages!
Contents
[hide]Statement
Let (X,J) be a connected topological space and suppose f:X→R is a continuous function, then[1]:
- ∀x1,x2∈X∀r∈R[(Min(f(x1),f(x2))≤r≤Max(f(x1),f(x2)))⟹∃x∈X[f(x)=r]][Note 1]
- In words: for any x1, x2∈X and any r∈R, if r is between f(x1) and f(x2) then there exists an x∈X such that f(x) equals r.
Proof
- Let x1, x2∈X be given
- Let r∈R be given
- Define m:=Min(f(x1),f(x2)) and let M:=Max(f(x1),f(x2))
- Suppose that (m≤r)∧(r≤M) is false, that it doesn't hold. Then by the nature of logical implication the implication evaluates to true regardless of the truth or falsity of the RHS
- Suppose that (m≤r)∧(r≤M) holds, by the nature of logical implication we must show that in this case ∃x∈X[f(x)=r] for the implication to be true
- By the image of a connected topological space is connected we see that, as X is connected, so is f(X)⊆R
- By a non-empty subset of the reals is connected if and only if it is a singleton or an interval we see that f(X) is an interval if we consider [a,a] as {a} - which is sensible.
- As m∈f(X) and M∈f(X) we see that [m,M]⊆f(X) - note this may be a singleton or it may be an interval
- We can perform the rest of the analysis using case analysis
- Notice first:
- [m,M]⊆f(X) may be a singleton, but it may not be
- we are considering the case where r∈[m,M] this is okay because we know m≤r≤M - which is the very definition of r∈[m,M] - see closed interval for more.
- The case analysis follows, we have 2 main cases: [m,M] is a singleton and it is not, then some cases on r[Note 2]
- Suppose [m,M] is a singleton
- then as r∈[m,M] we must have r=m and r=M (as m=M for it to be a singleton)
- We see next that r=f(x1) and r=f(x2)
- Choose x:=x1 (x2 would have worked)
- We see that f(x)=r as required for our choice of x
- Choose x:=x1 (x2 would have worked)
- We see next that r=f(x1) and r=f(x2)
- then as r∈[m,M] we must have r=m and r=M (as m=M for it to be a singleton)
- Suppose [m,M] is not a singleton. We create 3 cases: r=m, r=M and r∈(m,M)
- r=m
- This means r=f(xi) for some i∈{1,2}, as m:=Min(f(x1),f(x2)) remember.
- Choose x:=xi
- We see that f(x)=f(xi)=r so f(x)=r as required
- Choose x:=xi
- This means r=f(xi) for some i∈{1,2}, as m:=Min(f(x1),f(x2)) remember.
- r=M
- This means r=f(xi) for some i∈{1,2}, as M:=Max(f(x1),f(x2)) remember.
- Choose x:=xi
- We see that f(x)=f(xi)=r so f(x)=r as required
- Choose x:=xi
- This means r=f(xi) for some i∈{1,2}, as M:=Max(f(x1),f(x2)) remember.
- r∈(m,M)
- r=m
- Suppose [m,M] is a singleton
- We see that in all cases (and their sub-cases) that: ∃x∈X[f(x)=r], as required.
- Note: We could have tidied up the cases a bit, however we chose not to, as per[Note 2].
- Notice first:
- By a non-empty subset of the reals is connected if and only if it is a singleton or an interval we see that f(X) is an interval if we consider [a,a] as {a} - which is sensible.
- We have seen that if (m≤r)∧(r≤M) that ∃x∈X[f(x)=r] indeed holds
- By the image of a connected topological space is connected we see that, as X is connected, so is f(X)⊆R
- The implication holds
- Define m:=Min(f(x1),f(x2)) and let M:=Max(f(x1),f(x2))
- Since r∈R was arbitrary the implication holds for all such r
- Let r∈R be given
- Since x1,x2∈X were arbitrary the implication holds for all such x1,x2
This completes the proof.
Notes
- Jump up ↑ Recall that a≤b≤c really means (a≤b)∧(b≤c) - so a≤b and b≤c.
- ↑ Jump up to: 2.0 2.1 We could get rid of one of our cases by noting that m∈[m,M] regardless of whether or not it is a singleton, we didn't do this to keep the "purity" of the case analysis
- Jump up ↑ Really in this case we have (m,M)⊂[m,M] but ⊆ still works, remember to claim it's a proper subset means to claim they're not equal, we do not bother with this here, even though it is true
References
Categories:
- Stub pages
- Theorems
- Theorems, lemmas and corollaries
- Topology Theorems
- Topology Theorems, lemmas and corollaries
- Topology
- Functional Analysis Theorems
- Functional Analysis Theorems, lemmas and corollaries
- Functional Analysis
- Analysis Theorems
- Analysis Theorems, lemmas and corollaries
- Analysis
- Real Analysis Theorems
- Real Analysis Theorems, lemmas and corollaries
- Real Analysis