General and overarching topics Concept
Direct proof
Builds on Mathematical proofImplication
Summary
A direct proof of an implication assumes and then gets by a chain of valid steps. The steps use axioms, definitions and theorems that are already proved.
Remarks
Example: if is odd, then is odd. Write . Then , which is odd. When a direct proof is hard, a proof by contrapositive or a proof by contradiction can help.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Proposition concept
- Implication definition
- Modus ponens concept
- Mathematical proof concept
- Direct proof concept
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Direct_proof, lead section
About this page
| Tag | 0NTF6DMVAP |
|---|---|
| URI | m2://0NTF6DMVAP |
| Kind | concept |
| Writing | W1 stated |
| MSC | 00A35 |
| Specializes | Mathematical proof |
| Part of | Proof methods |
| Uses | Mathematical proof, Implication |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
Proofs that use this method
- Proof that cyclic groups are abelian
- Proof that the kernel is a normal subgroup
- Proof that the order of an element divides the order of the group
- Proof that a homomorphism is injective iff its kernel is trivial
- Proof that groups of prime order are cyclic
- Proof of the uniqueness of inverses
- Proof of Lagrange's theorem
- Proof of the cancellation laws