Math 2.0

concept

Direct proof

Summary

A direct proof of an implication p→qp \to q assumes pp and then gets qq by a chain of valid steps. The steps use axioms, definitions and theorems that are already proved.

Remarks

Example: if nn is odd, then n2n^2 is odd. Write n=2k+1n = 2k + 1. Then n2=2(2k2+2k)+1n^2 = 2(2k^2 + 2k) + 1, which is odd. When a direct proof is hard, a proof by contrapositive or a proof by contradiction can help.

Explanations

L1 human

In a direct proof you go straight from the hypothesis to the conclusion. You write down what the hypothesis means, then you compute or reason until you reach the conclusion.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Implication definition
  3. Modus ponens concept
  4. Mathematical proof concept
  5. Direct proof concept

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Direct_proof, lead section