ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Discrete Structures
    GE-167
    Progress0 / 67 topics
    Topics
    1. Mathematical Reasoning: Propositional and Predicate Logic2. Propositional Logic: Logical Operators3. Translations Between Symbolic Expressions and Formal English Expression4. Logical Equivalences5. Predicate Logic: Quantifiers6. Nested Quantification7. Equivalences in Predicate Logic8. Translations Between Symbolic Forms and Formal English9. Rules of Inference: Proof Methods and Strategies10. Direct Proof11. Proof by Contraposition12. Proof by Induction13. Proof by Implication14. Existence Proof15. Uniqueness Proofs16. Trivial Proofs17. Vacuous Proofs18. Sets: Notations and Set Operations19. Venn Diagrams20. Countable and Uncountable Sets21. Relations: Equivalence Relations and Partitions22. Partial Orderings23. Recurrence Relations24. Functions: Injective, Surjective, Bijective25. Special Types of Functions26. Function Composition27. Inverse Functions28. Recursive Functions29. Compositions30. Number Theory: Sequences and Series31. Counting: Inclusion and Exclusion Principle32. Pigeonhole Principle33. Permutations and Combinations34. Integers and Divisibility: Division Theorem35. Modular Arithmetic36. LCM and GCD37. Euclidean and Extended Euclidean Method38. Finding Solutions to Congruence39. Primes: Fundamental Theorem of Arithmetic40. Characterizations of Primes41. Mersenne Primes42. Induction: Weak Induction43. Strong Induction44. Recursion and Recurrences: Formulation of Recurrences45. Closed Formulas46. Counting: Product Rule and Sum Rule47. Principle of Inclusion-Exclusion48. Binomial Coefficients49. Pascal's Identity and Pascal’s Triangle50. Binomial Theorem51. Relations: Reflexive, Symmetric, Transitive, and Antisymmetric52. Equivalence Relations and Equivalence Classes53. Partial Orders54. Graph Theory: Terminologies55. Elements of Graph Theory56. Planar Graphs57. Graph Coloring58. Euler Graph59. Hamiltonian Path60. Rooted Trees61. Graph Traversals62. Handshaking Lemma and Corollary63. Special Families of Graphs64. Graph Isomorphism65. Planarity in Graphs66. Eulerian and Hamiltonian Graphs67. Trees in Graph Theory
    GE-167›Uniqueness Proofs
    Discrete StructuresTopic 15 of 67

    Uniqueness Proofs

    9 minread
    1,608words
    Intermediatelevel

    Uniqueness Proofs

    A uniqueness proof is a type of proof used in mathematics to show that there is exactly one object (or element) that satisfies a given property or condition. These proofs typically demonstrate that an object exists and that this object is the only one that satisfies the given conditions, ensuring that no other object can fulfill the same criteria.

    Uniqueness proofs are often used in conjunction with existence proofs. After showing that an object exists, a uniqueness proof is used to demonstrate that no other distinct object can satisfy the same properties. Together, existence and uniqueness establish that there is exactly one object that satisfies the given conditions.


    Structure of a Uniqueness Proof

    A typical uniqueness proof follows this structure:

    1. Existence: Prove that at least one object satisfies the given conditions (this is often already done in the existence proof).
    2. Uniqueness: Prove that if there are two such objects, they must be identical.

    General Formulation of a Uniqueness Statement

    A typical uniqueness statement can be phrased as:

    • "There exists a unique xxx such that P(x)P(x)P(x) is true."

    This means:

    • There exists an xxx such that P(x)P(x)P(x) holds.
    • If any other yyy also satisfies P(y)P(y)P(y), then x=yx = yx=y.

    In logical terms, this can be written as:

    ∃x (P(x))and∀y [P(y)  ⟹  y=x]\exists x \, (P(x)) \quad \text{and} \quad \forall y \, \left[ P(y) \implies y = x \right]∃x(P(x))and∀y[P(y)⟹y=x]

    Methods for Proving Uniqueness

    There are two common methods for proving uniqueness:

    1. Proof by Contradiction

    This method involves assuming that there are two distinct objects that satisfy the condition and showing that this leads to a contradiction, thus proving that there can only be one such object.

    2. Direct Proof

    In a direct uniqueness proof, you show that if two objects xxx and yyy satisfy the given property, then xxx must equal yyy. This is usually done by demonstrating that the conditions imply x=yx = yx=y.


    Example of a Uniqueness Proof

    Example 1: Prove that the solution to the equation x2=4x^2 = 4x2=4 is unique.

    We want to prove that there is exactly one real number xxx such that x2=4x^2 = 4x2=4.

    Step 1: Existence Proof

    • We first show that there are solutions to the equation. The solutions are x=2x = 2x=2 and x=−2x = -2x=−2, which are both real numbers and satisfy x2=4x^2 = 4x2=4. So, two solutions exist.

    Step 2: Uniqueness Proof

    • We need to prove that there is exactly one real number xxx such that x2=4x^2 = 4x2=4. Let x1x_1x1​ and x2x_2x2​ be two real numbers that satisfy the equation x2=4x^2 = 4x2=4. Then we have:

      x12=4andx22=4x_1^2 = 4 \quad \text{and} \quad x_2^2 = 4x12​=4andx22​=4

      This means that:

      (x1−x2)(x1+x2)=0(x_1 - x_2)(x_1 + x_2) = 0(x1​−x2​)(x1​+x2​)=0

      For the product to be zero, either x1−x2=0x_1 - x_2 = 0x1​−x2​=0 or x1+x2=0x_1 + x_2 = 0x1​+x2​=0.

      • If x1−x2=0x_1 - x_2 = 0x1​−x2​=0, then x1=x2x_1 = x_2x1​=x2​, meaning the two solutions are the same.
      • If x1+x2=0x_1 + x_2 = 0x1​+x2​=0, then x1=−x2x_1 = -x_2x1​=−x2​.

      So, the only solutions are x1=2x_1 = 2x1​=2 and x2=−2x_2 = -2x2​=−2, and they are distinct. Therefore, we have two distinct real solutions, not one.

    Thus, the solutions 222 and −2-2−2 are unique for the equation x2=4x^2 = 4x2=4.


    Example 2: Prove that the additive inverse of an integer is unique.

    Statement: Prove that for every integer aaa, there exists a unique integer bbb such that a+b=0a + b = 0a+b=0.

    Step 1: Existence Proof

    • We know that for any integer aaa, the number −a-a−a satisfies a+(−a)=0a + (-a) = 0a+(−a)=0. So, the integer b=−ab = -ab=−a exists.

    Step 2: Uniqueness Proof

    • Suppose there are two integers b1b_1b1​ and b2b_2b2​ such that a+b1=0a + b_1 = 0a+b1​=0 and a+b2=0a + b_2 = 0a+b2​=0.
    • From these equations, we have: b1=−aandb2=−ab_1 = -a \quad \text{and} \quad b_2 = -ab1​=−aandb2​=−a Therefore, b1=b2b_1 = b_2b1​=b2​.

    Thus, the integer bbb that satisfies a+b=0a + b = 0a+b=0 is unique. Therefore, the additive inverse of an integer is unique.


    Proof by Contradiction (Uniqueness)

    Example 3: Prove that the square root of 2 is irrational.

    To prove that 2\sqrt{2}2​ is irrational, we use proof by contradiction, which also involves uniqueness.

    Proof by Contradiction:

    • Assume that 2\sqrt{2}2​ is rational. This means that 2\sqrt{2}2​ can be expressed as pq\frac{p}{q}qp​, where ppp and qqq are integers with no common factors (i.e., ppp and qqq are coprime), and q≠0q \neq 0q=0.

      Thus, we assume:

      2=pq\sqrt{2} = \frac{p}{q}2​=qp​

      Squaring both sides:

      2=p2q22 = \frac{p^2}{q^2}2=q2p2​ p2=2q2p^2 = 2q^2p2=2q2
    • This equation implies that p2p^2p2 is even (since it is divisible by 2). Since p2p^2p2 is even, ppp must also be even (because the square of an odd number is odd).

    • Let p=2kp = 2kp=2k, where kkk is an integer. Substituting into the equation p2=2q2p^2 = 2q^2p2=2q2:

      (2k)2=2q2(2k)^2 = 2q^2(2k)2=2q2 4k2=2q24k^2 = 2q^24k2=2q2 2k2=q22k^2 = q^22k2=q2
    • This shows that q2q^2q2 is also even, so qqq must be even.

    • But if both ppp and qqq are even, this contradicts the assumption that ppp and qqq have no common factors (i.e., they are coprime). Hence, the assumption that 2\sqrt{2}2​ is rational must be false.

    • Therefore, 2\sqrt{2}2​ is irrational, and its uniqueness (as the only real solution to x2=2x^2 = 2x2=2) is proved.


    Conclusion

    A uniqueness proof establishes that an object with certain properties is not only guaranteed to exist but is also the only object that satisfies those properties. Uniqueness proofs can be done through direct proofs (showing that two objects must be identical) or by contradiction (assuming the existence of two objects and showing that this leads to a contradiction). Such proofs are commonly used in fields like algebra, number theory, and analysis to ensure the distinctness of solutions or elements.

    Previous topic 14
    Existence Proof
    Next topic 16
    Trivial Proofs

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time9 min
      Word count1,608
      Code examples0
      DifficultyIntermediate