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›Existence Proof
    Discrete StructuresTopic 14 of 67

    Existence Proof

    8 minread
    1,369words
    Intermediatelevel

    Existence Proof

    An existence proof is a method of proof used to demonstrate that a certain object (or element) with specific properties exists, without necessarily constructing the object or providing an explicit example of it. In other words, an existence proof shows that at least one object satisfies the given conditions, but it does not require explicitly identifying or constructing that object. Existence proofs are common in mathematics, especially in set theory, algebra, and number theory.

    There are two common approaches to proving existence:

    1. Constructive Existence Proof: This approach provides an explicit example or construction of the object.
    2. Non-Constructive Existence Proof: This approach proves the existence of an object, but does not provide a concrete example. Instead, it typically uses indirect reasoning or contradiction.

    Types of Existence Proofs

    1. Constructive Existence Proof

    In a constructive existence proof, the goal is to not only show that something exists, but also to explicitly demonstrate or construct the object that satisfies the given properties.

    • Example: Prove that there exists an even integer greater than 2.

      Solution: We can explicitly construct an example by providing an even integer greater than 2, such as 444, which clearly satisfies the condition of being even and greater than 2. Hence, the proof is constructive because it directly provides an example.

    2. Non-Constructive Existence Proof

    In a non-constructive existence proof, the goal is to prove that an object exists, but without explicitly constructing it. This can be done using logical arguments, indirect reasoning, or contradiction.

    • Example: Prove that there exists an irrational number xxx such that x2x^2x2 is rational.

      Solution: We can prove this using an indirect argument. Consider the number x=2+3x = \sqrt{2} + \sqrt{3}x=2​+3​. We can show that x2x^2x2 is rational without explicitly constructing xxx:

      x2=(2+3)2=2+3+26=5+26x^2 = (\sqrt{2} + \sqrt{3})^2 = 2 + 3 + 2\sqrt{6} = 5 + 2\sqrt{6}x2=(2​+3​)2=2+3+26​=5+26​

      The term 262\sqrt{6}26​ is irrational, so x2x^2x2 is irrational. Therefore, we must modify the proof to use a correct non-constructive argument (like selecting specific values), but the essence of the argument is to demonstrate the existence of irrational numbers satisfying the condition. The proof is non-constructive because it uses reasoning to assert the existence without showing an explicit example.


    Methods for Existence Proofs

    There are several techniques commonly used in existence proofs:

    1. Direct Construction: Construct the object explicitly.

      • Example: To prove that there exists an integer that is the sum of two squares, we might provide a specific example of such an integer (e.g., 5 = 12+221^2 + 2^212+22).
    2. Proof by Contradiction: Assume that no such object exists, and show that this assumption leads to a contradiction. This implies that the object must exist.

      • Example: To prove that there is no smallest positive rational number, assume that there is such a number. Then, find a contradiction by showing that there is always a smaller positive rational number.
    3. Existence via the Axiom of Choice: In some cases, the Axiom of Choice (in set theory) is used to prove the existence of objects without explicitly constructing them. The Axiom of Choice states that for any collection of non-empty sets, there exists a function that chooses one element from each set. This principle is often used to prove the existence of objects in more abstract settings, like in vector spaces or infinite sets.

      • Example: Proving the existence of a basis for every vector space (infinite-dimensional spaces can be tricky without the Axiom of Choice).
    4. Existence via the Well-Ordering Principle: This principle states that every set can be well-ordered, meaning there exists a first element in any non-empty subset. This can sometimes be used to prove the existence of objects in a given set.


    Example of an Existence Proof

    Example 1: Prove that there exists a real number xxx such that x2=2x^2 = 2x2=2.

    Solution:

    • Direct Construction: To prove this constructively, we can simply present x=2x = \sqrt{2}x=2​ as a real number such that (2)2=2(\sqrt{2})^2 = 2(2​)2=2. This directly shows that such an xxx exists.
    • Non-Constructive: Alternatively, we might use the Intermediate Value Theorem to show that there exists a solution to the equation x2=2x^2 = 2x2=2. This is a non-constructive argument: the theorem tells us that between x=1x = 1x=1 and x=2x = 2x=2, there exists a point where f(x)=x2−2=0f(x) = x^2 - 2 = 0f(x)=x2−2=0, but we don't explicitly construct the solution.

    Existence Proof Using Proof by Contradiction

    Example 2: Prove that there are infinitely many prime numbers.

    Solution:

    We prove the existence of infinitely many primes by contradiction.

    • Assumption: Suppose there are only finitely many primes, say p1,p2,…,pnp_1, p_2, \dots, p_np1​,p2​,…,pn​.

    • Construct a new number: Consider the number N=p1p2…pn+1N = p_1 p_2 \dots p_n + 1N=p1​p2​…pn​+1. By construction, NNN is not divisible by any of the primes p1,p2,…,pnp_1, p_2, \dots, p_np1​,p2​,…,pn​, because dividing NNN by any of these primes leaves a remainder of 1.

    • Conclusion: Therefore, NNN is either prime itself, or it has a prime factor that is not among p1,p2,…,pnp_1, p_2, \dots, p_np1​,p2​,…,pn​. Either way, there is a prime that was not in our original list, which contradicts the assumption that there are only finitely many primes.

    • Since assuming that there are finitely many primes leads to a contradiction, we conclude that there are infinitely many primes.

    This is a non-constructive existence proof because it does not explicitly give us a list of all primes, but it proves the existence of infinitely many primes.


    Key Concepts in Existence Proofs

    1. Existence is Not Construction: An existence proof shows that at least one object with certain properties exists, but it doesn’t require explicitly constructing the object.

    2. Indirect Proofs (e.g., Contradiction): Existence can sometimes be proven by assuming that no such object exists and showing that this leads to a contradiction.

    3. Constructive vs Non-Constructive: A constructive proof explicitly constructs the object, while a non-constructive proof shows existence without constructing an explicit example.

    4. Use of Theorems and Axioms: Many existence proofs rely on known theorems, such as the Intermediate Value Theorem, the Axiom of Choice, or other foundational principles, to assert the existence of objects in abstract settings.


    Conclusion

    Existence proofs are a fundamental tool in mathematics for demonstrating that certain objects with specific properties exist. These proofs can be constructive (providing an explicit example of the object) or non-constructive (using logical reasoning or contradiction to show existence without construction). The technique used depends on the nature of the problem and the mathematical context, but both types of proofs are widely used across various areas of mathematics.

    Previous topic 13
    Proof by Implication
    Next topic 15
    Uniqueness 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 time8 min
      Word count1,369
      Code examples0
      DifficultyIntermediate