ScholarQuill logoScholarQuillUniversity Notes
My Semester
Explore Notes
Past Papers12 New
Video CoursesNew
Search
Settings
Study Tools
GPA/CGPA Calculator
Schedule & To-Do
Student Portal
Contact
Contact
ScholarQuill logo
My Semester
Explore Notes
Past Papers12 New
Video CoursesNew
Search
Settings
GPA/CGPA Calculator
Schedule & To-Do
Student Portal
Contact
ScholarQuill logoScholarQuillUniversity Notes
Study PortalGE-167Existence Proof
Ctrl + K
Login
Explore
Search
Semester
Papers
CGPA
    GE-167

    Discrete Structures

    Progress0 / 67 done
    Topics67
    1Propositional and Predicate Logic
    2Logical Operators3Translations Between Symbolic Expressions and Formal English Expression4Logical Equivalences
    5Quantifiers6Nested Quantification7Equivalences in Predicate Logic8Translations Between Symbolic Forms and Formal English
    9Proof Methods and Strategies10Direct Proof11Proof by Contraposition12Proof by Induction13Proof by Implication14Existence Proof15Uniqueness Proofs16Trivial Proofs17Vacuous Proofs
    18Notations and Set Operations19Venn Diagrams20Countable and Uncountable Sets
    21Equivalence Relations and Partitions22Partial Orderings23Recurrence Relations51Reflexive, Symmetric, Transitive, and Antisymmetric52Equivalence Relations and Equivalence Classes53Partial Orders
    24Injective, Surjective, Bijective25Special Types of Functions26Function Composition27Inverse Functions28Recursive Functions29Compositions
    30Sequences and Series
    31Inclusion and Exclusion Principle32Pigeonhole Principle33Permutations and Combinations46Product Rule and Sum Rule47Principle of Inclusion-Exclusion48Binomial Coefficients49Pascal's Identity and Pascal’s Triangle50Binomial Theorem
    34Division Theorem35Modular Arithmetic36LCM and GCD37Euclidean and Extended Euclidean Method38Finding Solutions to Congruence
    39Fundamental Theorem of Arithmetic40Characterizations of Primes41Mersenne Primes
    42Weak Induction43Strong Induction
    44Formulation of Recurrences45Closed Formulas
    54Terminologies55Elements of Graph Theory56Planar Graphs57Graph Coloring58Euler Graph59Hamiltonian Path60Rooted Trees61Graph Traversals62Handshaking Lemma and Corollary63Special Families of Graphs64Graph Isomorphism65Planarity in Graphs66Eulerian and Hamiltonian Graphs67Trees in Graph Theory
    8 min read
    Topic 14 of 67
    Topic Study Note Illustration
    14

    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...

    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 view and download past papers

    Click on Show Past Papers to load available exam papers.

    Reading Progress
    0%
    8mremaining
    1.4kwords
    Intermediatelevel
    On This Page

    No headings found

    Study Toolkit

    Subject Portal

    Discrete Structures