What it means to negate the following statement?

  • Thread starter Thread starter cris(c)
  • Start date Start date
  • Tags Tags
    Means
Click For Summary

Homework Help Overview

The discussion revolves around the negation of a mathematical statement concerning a collection of functions, specifically focusing on the conditions under which the functions are less than or equal to zero and the implications of negating that statement.

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the implications of negating the original statement, questioning whether the negation imposes restrictions on other functions in the collection. They discuss the application of De Morgan's Law to derive alternative forms of the negation.

Discussion Status

There is an ongoing exploration of different interpretations of the negation, with some participants suggesting multiple valid forms of negation. Clarifications are being sought regarding the implications of these negations on the functions involved.

Contextual Notes

Participants express uncertainty about the correctness of their interpretations and the implications of the negation, indicating a need for further discussion on the topic.

cris(c)
Messages
21
Reaction score
0

Homework Statement



Suppose you have a collection of functions [itex]{f_1,f_2,\ldots,f_m}[/itex] and you make the following statement: [itex]f_k ≤ 0[/itex] for all k with strict inequality for at least some k.

Homework Equations



The negation of the above statement is [itex]\exists k[/itex] such that [itex]f_k>0 [\itex].<h2>The Attempt at a Solution</h2><br /> <br /> Does the negation of the statement above impose any restriction on the remaining functions (other than [itex]f_k[/itex]? or I am free to assume anything about these other functions?[/itex]
 
Physics news on Phys.org
cris(c) said:

Homework Statement



Suppose you have a collection of functions [itex]{f_1,f_2,\ldots,f_m}[/itex] and you make the following statement: [itex]f_k ≤ 0[/itex] for all k with strict inequality for at least some k.

Homework Equations



The negation of the above statement is [itex]\exists k[/itex] such that [itex]f_k>0[/itex].

The Attempt at a Solution



Does the negation of the statement above impose any restriction on the remaining functions (other than [itex]f_k[/itex]? or I am free to assume anything about these other functions?
That's not the negation .

What if [itex]f_k=0[/itex] for all k ?
 
Think of this as an AND statement. Two propositions A and B.

Proposition 1: [itex]f_k \leq 0 \forall k[/itex]

AND

Proposition 2: [itex]\exists k[/itex] such that [itex]f_k < 0[/itex]

Now apply De Morgan's Law: [itex]\overline{AB} = \overline{A} + \overline{B}[/itex]

So the result is the negation of proposition 1 OR the negation or proposition 2.

NOT proposition 1: [itex]\exists k[/itex] such that [itex]f_k > 0[/itex]

OR

NOT proposition 2: [itex]f_k \geq 0 \forall k[/itex]

EITHER of these statements is an equally valid negation of the original statement. Either of those conditions, if met, will violate one of the propositions in the original statement, invalidating it.

Sorry for all the edits, but I think I finally have it right this time! :biggrin:
 
Last edited:
Curious3141 said:
Think of this as an AND statement. Two propositions A and B.

Proposition 1: [itex]f_k \leq 0 \forall k[/itex]

AND

Proposition 2: [itex]\exists k[/itex] such that [itex]f_k < 0[/itex]

Now apply De Morgan's Law: [itex]\overline{AB} = \overline{A} + \overline{B}[/itex]

So the result is the negation of proposition 1 OR the negation or proposition 2.

NOT proposition 1: [itex]\exists k[/itex] such that [itex]f_k > 0[/itex]

OR

NOT proposition 2: [itex]f_k \geq 0 \forall k[/itex]

EITHER of these statements is an equally valid negation of the original statement. Either of those conditions, if met, will violate one of the propositions in the original statement, invalidating it.

Sorry for all the edits, but I think I finally have it right this time! :biggrin:

Thanks a lot for your clarifying answer...this really helps a lot!
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
15
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K