Proof By Example
   HOME

TheInfoList



OR:

In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure o ...
and
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, proof by example (sometimes known as inappropriate generalization) is a
logical fallacy In logic and philosophy, a formal fallacy is a pattern of reasoning rendered invalid by a flaw in its logical structure. Propositional logic, for example, is concerned with the meanings of sentences and the relationships between them. It focuses ...
whereby the validity of a statement is illustrated through one or more examples or cases—rather than a full-fledged
proof Proof most often refers to: * Proof (truth), argument or sufficient evidence for the truth of a proposition * Alcohol proof, a measure of an alcoholic drink's strength Proof may also refer to: Mathematics and formal logic * Formal proof, a co ...
. The structure,
argument form In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system. Informally, the logical form attempts to formalize a possibly ambiguous statement into a statement with a precise, unamb ...
and formal form of a proof by example generally proceeds as follows: Structure: :I know that ''X'' is such. :Therefore, anything related to ''X'' is also such.
Argument form In logic, the logical form of a statement is a precisely specified semantic version of that statement in a formal system. Informally, the logical form attempts to formalize a possibly ambiguous statement into a statement with a precise, unamb ...
: :I know that ''x'', which is a member of group ''X'', has the property ''P''. :Therefore, all other elements of ''X'' must have the property ''P''. Formal form: :\exists x:P(x)\;\;\vdash\;\;\forall x:P(x) The following example demonstrates why this line of reasoning is a logical fallacy: : I've seen a person shoot someone dead. : Therefore, all people are murderers. In the common discourse, a proof by example can also be used to describe an attempt to establish a claim using
statistically insignificant In statistical hypothesis testing, a result has statistical significance when a result at least as "extreme" would be very infrequent if the null hypothesis were true. More precisely, a study's defined significance level, denoted by \alpha, is the ...
examples. In which case, the merit of each argument might have to be assessed on an individual basis.


Valid cases of proof by example

In certain circumstances, examples can suffice as logically valid proof.


Proofs of existential statements

In some scenarios, an argument by example may be valid if it leads from a singular premise to an ''existential'' conclusion (i.e. proving that a claim is true for at least one case, instead of for all cases). For example: :Socrates is wise. :Therefore, someone is wise. (or) :I've seen a person steal. :Therefore, (some) people can steal. These examples outline the informal version of the logical rule known as existential introduction, also known as ''particularisation'' or ''existential generalization'': ;Existential Introduction : \underline\,\! : \exists \alpha\, \varphi\,\! (where \varphi(\beta / \alpha) denotes the
formula In science, a formula is a concise way of expressing information symbolically, as in a mathematical formula or a ''chemical formula''. The informal use of the term ''formula'' in science refers to the general construct of a relationship betwe ...
formed by substituting all free occurrences of the variable \alpha in \varphi by \beta.) Likewise, finding a
counterexample A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "student John Smith is not lazy" is a c ...
disproves (proves the
negation In logic, negation, also called the logical not or logical complement, is an operation (mathematics), operation that takes a Proposition (mathematics), proposition P to another proposition "not P", written \neg P, \mathord P, P^\prime or \over ...
of) a universal conclusion. This is used in a
proof by contradiction In logic, proof by contradiction is a form of proof that establishes the truth or the validity of a proposition by showing that assuming the proposition to be false leads to a contradiction. Although it is quite freely used in mathematical pr ...
.


Exhaustive proofs

Examples also constitute valid, if inelegant, proof, when it has ''also'' been demonstrated that the examples treated cover all possible cases. In mathematics, proof by example can also be used to refer to attempts to illustrate a claim by proving cases of the claim, with the understanding that these cases contain key ideas which can be generalized into a full-fledged proof.


See also

*
Affirming the consequent In propositional logic, affirming the consequent (also known as converse error, fallacy of the converse, or confusion of necessity and sufficiency) is a formal fallacy (or an invalid form of argument) that is committed when, in the context of a ...
*
Anecdotal evidence Anecdotal evidence (or anecdata) is evidence based on descriptions and reports of individual, personal experiences, or observations, collected in a non- systematic manner. The term ''anecdotal'' encompasses a variety of forms of evidence. This ...
*
Bayesian probability Bayesian probability ( or ) is an interpretation of the concept of probability, in which, instead of frequency or propensity of some phenomenon, probability is interpreted as reasonable expectation representing a state of knowledge or as quant ...
*
Counterexample A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "student John Smith is not lazy" is a c ...
*
Hand-waving Hand-waving (with various spellings) is a pejorative label for attempting to be seen as effective – in word, reasoning, or deed – while actually doing nothing effective or substantial. Cites the ''Random House Dictionary'' and ''The Dictionary ...
*
Inductive reasoning Inductive reasoning refers to a variety of method of reasoning, methods of reasoning in which the conclusion of an argument is supported not with deductive certainty, but with some degree of probability. Unlike Deductive reasoning, ''deductive'' ...
**
Problem of induction The problem of induction is a philosophical problem that questions the rationality of predictions about unobserved things based on previous observations. These inferences from the observed to the unobserved are known as "inductive inferences" ...
*
Modus ponens In propositional logic, (; MP), also known as (), implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "''P'' implies ''Q.'' ''P'' is true. Therefore, ''Q'' must ...
* Proof by construction * Proof by intimidation


References


Further reading

* Benjamin Matschke: Valid proofs by example in mathematics (arXiv) {{DEFAULTSORT:Proof By Example Quantificational fallacies