Undergrad Negating the uniqueness quantifier

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Uniqueness
Click For Summary
Negating the uniqueness quantifier ##\exists ! x P(x)## leads to the expression ##\forall x (\neg P(x) \lor \exists y (P(y) \wedge y \ne x))##. This can be interpreted in natural language as stating that either no value of x satisfies P(x) or more than one value does. The discussion emphasizes that the negation reflects a violation of both existence and uniqueness, confirming that either none or multiple instances can occur. Examples involving odd and even primes illustrate this concept, reinforcing that the negation cannot allow both conditions to be true simultaneously. Thus, the negation effectively conveys the absence of a unique solution for P(x).
Mr Davis 97
Messages
1,461
Reaction score
44
I am trying to negate ##\exists ! x P(x)##, which expanded means ##\exists x (P(x) \wedge \forall y (P(y) \rightarrow y=x))##. The negation of this is ##\forall x (\neg P(x) \lor \exists y (P(y) \wedge y \ne x))##. How can this be interpreted in natural language? Is it logically equivalent to the statement that either 0 or more than 1 value of x satisfies P(x)?
 
Physics news on Phys.org
Mr Davis 97 said:
I am trying to negate ##\exists ! x P(x)##, which expanded means ##\exists x (P(x) \wedge \forall y (P(y) \rightarrow y=x))##. The negation of this is ##\forall x (\neg P(x) \lor \exists y (P(y) \wedge y \ne x))##. How can this be interpreted in natural language? Is it logically equivalent to the statement that either 0 or more than 1 value of x satisfies P(x)?
Yes, because there exists exactly one are two statements: existence and uniqueness, so both can be violated in the negation. This means either none exists at all or if, then more than one.

There is exactly one odd prime. is wrong, so the contrary is true: there are either more than one odd primes (true) or all primes are even (wrong). But true or wrong is true.

There is exactly one even prime greater than ##2##. is wrong, so the contrary is true: there are either more than one even prime greater than ##2## (wrong) or all primes greater than ##2## are odd (true). Again wrong or true is true.

The case true and true cannot occur, since either there are many or none at all, which cannot both be true. So the negation of ##\exists !## can be expressed by an exclusive or, sometimes noted as ##\dot{\vee}##.
 
You want to negate "There exists a unique x such that the statement P(x)" holds. One expects that the negation is "There is no unique x such that P(x) holds"

The last one is a true statement if either the existence fails, or the uniqueness.

The former means that there just isn't an x such that P(x) holds, the latter means that two different ones can be found such that the statement holds and this is precisely what the logic describes (because there is no x such that P(x) holds is equivalent with saying that for all x P(x) does not hold)
 
If there are an infinite number of natural numbers, and an infinite number of fractions in between any two natural numbers, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and an infinite number of fractions in between any two of those fractions, and... then that must mean that there are not only infinite infinities, but an infinite number of those infinities. and an infinite number of those...

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
2
Views
2K