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›Direct Proof
    Discrete StructuresTopic 10 of 67

    Direct Proof

    5 minread
    880words
    Beginnerlevel

    Direct Proof

    A direct proof is one of the most straightforward and commonly used methods of proof in mathematics and logic. In a direct proof, we start with the given premises or assumptions and use logical reasoning, applying rules of inference to derive the conclusion step by step. This method does not rely on contradiction or contrapositive; it directly establishes the truth of a statement by constructing a sequence of valid logical steps.


    Steps in a Direct Proof

    1. Assume the given premise(s): You start by assuming the premises or hypotheses of the statement are true. These premises are the starting point for your proof.

    2. Apply logical rules and definitions: Use valid rules of inference (such as Modus Ponens, Hypothetical Syllogism, etc.) along with any relevant definitions or theorems to manipulate the given information.

    3. Derive the conclusion: Gradually build up to the conclusion you need to prove, using logical steps. The idea is that by the end of the proof, you will have reached the desired conclusion.

    4. Conclude that the statement is true: Once the conclusion has been derived from the assumptions and premises, we can state that the original statement is true.


    Example of Direct Proof

    Example 1: Prove that if nnn is an even integer, then n2n^2n2 is also even.

    Step 1: State the assumption (premise)

    • We assume that nnn is an even integer. By definition, an integer is even if it can be written as n=2kn = 2kn=2k, where kkk is some integer.

    Step 2: Apply the assumption and logical reasoning

    • Since n=2kn = 2kn=2k, we substitute this into n2n^2n2 to express n2n^2n2 in terms of kkk. n2=(2k)2=4k2n^2 = (2k)^2 = 4k^2n2=(2k)2=4k2
    • Now, observe that 4k24k^24k2 is divisible by 2 because it is clearly a multiple of 2 (it is 2 times 2k22k^22k2).

    Step 3: Conclusion

    • Since n2=4k2n^2 = 4k^2n2=4k2 is divisible by 2, it follows that n2n^2n2 is an even number. Therefore, we have shown that if nnn is even, n2n^2n2 must also be even.

    Example 2: Prove that the sum of two even integers is even.

    Step 1: State the assumption (premise)

    • Let aaa and bbb be two even integers. By definition, an integer is even if it can be written as a=2k1a = 2k_1a=2k1​ and b=2k2b = 2k_2b=2k2​, where k1k_1k1​ and k2k_2k2​ are integers.

    Step 2: Apply the assumption and logical reasoning

    • The sum of aaa and bbb is: a+b=2k1+2k2a + b = 2k_1 + 2k_2a+b=2k1​+2k2​
    • Factor out the common factor of 2: a+b=2(k1+k2)a + b = 2(k_1 + k_2)a+b=2(k1​+k2​)
    • Since k1+k2k_1 + k_2k1​+k2​ is an integer (the sum of two integers is always an integer), we can conclude that a+ba + ba+b is of the form 2m2m2m, where mmm is an integer.

    Step 3: Conclusion

    • Thus, a+ba + ba+b is divisible by 2, and therefore the sum of two even integers is even.

    Key Features of a Direct Proof

    • Clarity and structure: Direct proofs are typically straightforward and organized in a step-by-step manner.
    • Assumption-based: A direct proof begins with the assumption of the hypothesis (premise) being true and then logically derives the conclusion from there.
    • No contradiction: Unlike proof by contradiction, direct proofs do not assume the negation of the conclusion. You directly show how the premises lead to the conclusion.

    When to Use Direct Proof

    Direct proofs are appropriate when the problem involves clear assumptions that can lead logically to the conclusion. This is often the case in problems dealing with algebraic identities, properties of numbers (like even and odd integers), geometry, and set theory, where we can directly manipulate expressions or use well-known definitions and theorems.


    Summary

    A direct proof is a method of establishing the truth of a statement by assuming the premises are true and logically deriving the conclusion step-by-step using valid rules of inference and definitions. This method is useful when the structure of the problem allows for a clear and direct path to the conclusion.

    Previous topic 9
    Rules of Inference: Proof Methods and Strategies
    Next topic 11
    Proof by Contraposition

    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 time5 min
      Word count880
      Code examples0
      DifficultyBeginner