Mathematical proof
Summary
A mathematical proof is an argument that shows that a statement follows from axioms, definitions and statements that are already proved. Each step of a proof follows from earlier steps by a valid rule of inference, such as modus ponens. A proved statement is a theorem.
Remarks
Common methods are direct proof, proof by contrapositive, proof by contradiction and proof by cases. A formal proof is a sequence of formulas in a formal system. A computer can check it, for example in Lean. Examples, however many, do not prove a universal statement.
Explanations
L1 human
A proof is a chain of small steps, and each step is certainly correct. It starts from things that you accept or already know, and it ends at the statement. After a correct proof, the statement is true in every case, not only in the cases that you tested.
What this node 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)
- edge specializes both: the more general notions and the special cases (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 4 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Proposition concept
- Implication definition
- Modus ponens concept
- Mathematical proof concept
What depends on this
6 nodes use this node, directly or through other nodes.
- Constructive proof 01XM7JEKHY
- Proof by contrapositive 0BB5TPGQ1N
- Russell's paradox 0HESMMSYEG
- Proof by contradiction 0J0XBKG64S
- Direct proof 0NTF6DMVAP
- Proof by cases 0WCP0PVET6
Sources
- Web https://en.wikipedia.org/wiki/Mathematical_proof, lead section
What links here
Used by
- Constructive proof 01XM7JEKHY
- Proof by contradiction 0J0XBKG64S
- Direct proof 0NTF6DMVAP
- Proof by cases 0WCP0PVET6