Brandon Taylor
New member
- Joined
- Sep 2, 2022
- Messages
- 2
Suppose I have a function f(x), which takes some x, a real number between 0 and 2 inclusive, and returns a boolean value, true or false. Say that I also know that
f(0) = false, and
f(2) = true
I'm interested in the following two statements:
Statement A: There a minimum value of x in (0, 2] for which f will return true
Statement B: There a maximum value of x in [0, 2) for which f will return false
I suspect that one xor the other must be true, just by intuition. For example,
If f(x) = x > 1, then statement B is true but statement A is false.
If f(x) = x ≥ 1, then statement A is true but statement B is false.
I have two questions.
- Is there such way to generalize statement A to always be true? Maybe by using some kind of limit minimum? Like,
min x such that ( ∀ x' ∈ [0, 2) ( x' < x → ¬ f(x) ) )
- If not, what constraints can I put on the function f such that statement A will always be true? Maybe something about continuity?
I'm new here, so please let me know if this is the wrong kind of question for this forum.
Thanks!
Brandon
f(0) = false, and
f(2) = true
I'm interested in the following two statements:
Statement A: There a minimum value of x in (0, 2] for which f will return true
Statement B: There a maximum value of x in [0, 2) for which f will return false
I suspect that one xor the other must be true, just by intuition. For example,
If f(x) = x > 1, then statement B is true but statement A is false.
If f(x) = x ≥ 1, then statement A is true but statement B is false.
I have two questions.
- Is there such way to generalize statement A to always be true? Maybe by using some kind of limit minimum? Like,
min x such that ( ∀ x' ∈ [0, 2) ( x' < x → ¬ f(x) ) )
- If not, what constraints can I put on the function f such that statement A will always be true? Maybe something about continuity?
I'm new here, so please let me know if this is the wrong kind of question for this forum.
Thanks!
Brandon
Last edited: