Minimal counterexample (original) (raw)
In mathematics, a minimal counterexample is the smallest example which falsifies a claim, and a proof by minimal counterexample is a method of proof which combines the use of a minimal counterexample with the ideas of proof by induction and proof by contradiction. More specifically, in trying to prove a proposition P, one first assumes by contradiction that it is false, and that therefore there must be at least one counterexample. With respect to some idea of size (which may need to be chosen carefully), one then concludes that there is such a counterexample C that is minimal. In regard to the argument, C is generally something quite hypothetical (since the truth of P excludes the possibility of C), but it may be possible to argue that if C existed, then it would have some definite propert
| Property | Value |
|---|---|
| dbo:abstract | In mathematics, a minimal counterexample is the smallest example which falsifies a claim, and a proof by minimal counterexample is a method of proof which combines the use of a minimal counterexample with the ideas of proof by induction and proof by contradiction. More specifically, in trying to prove a proposition P, one first assumes by contradiction that it is false, and that therefore there must be at least one counterexample. With respect to some idea of size (which may need to be chosen carefully), one then concludes that there is such a counterexample C that is minimal. In regard to the argument, C is generally something quite hypothetical (since the truth of P excludes the possibility of C), but it may be possible to argue that if C existed, then it would have some definite properties which, after applying some reasoning similar to that in an inductive proof, would lead to a contradiction, thereby showing that the proposition P is indeed true. If the form of the contradiction is that we can derive a further counterexample D, that is smaller than C in the sense of the working hypothesis of minimality, then this technique is traditionally called proof by infinite descent. In which case, there may be multiple and more complex ways to structure the argument of the proof. The assumption that if there is a counterexample, there is a minimal counterexample, is based on a well-ordering of some kind. The usual ordering on the natural numbers is clearly possible, by the most usual formulation of mathematical induction; but the scope of the method can include well-ordered induction of any kind. (en) |
| dbo:wikiPageID | 965376 (xsd:integer) |
| dbo:wikiPageLength | 4010 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1098094380 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Proof_by_infinite_descent dbr:Mathematical_induction dbr:Mathematics dbr:Fundamental_theorem_of_arithmetic dbr:Cyclic_group dbr:Feit–Thompson_theorem dbr:Proof_by_contradiction dbc:Mathematical_proofs dbr:Counterexample dbc:Mathematical_terminology dbr:Classification_of_finite_simple_groups dbr:Natural_number dbr:Solvable_group dbr:Proof_By_Induction dbr:Well-ordered_induction dbr:Well-ordering |
| dbp:date | December 2021 (en) |
| dbp:reason | Is the tense correct here? (en) |
| dbp:wikiPageUsesTemplate | dbt:Redirect dbt:Reflist dbt:Short_description dbt:When? |
| dcterms:subject | dbc:Mathematical_proofs dbc:Mathematical_terminology |
| rdf:type | yago:WikicatMathematicalProofs yago:Abstraction100002137 yago:Argument106648724 yago:Communication100033020 yago:Evidence106643408 yago:Indication106797169 yago:MathematicalProof106647864 yago:Proof106647614 |
| rdfs:comment | In mathematics, a minimal counterexample is the smallest example which falsifies a claim, and a proof by minimal counterexample is a method of proof which combines the use of a minimal counterexample with the ideas of proof by induction and proof by contradiction. More specifically, in trying to prove a proposition P, one first assumes by contradiction that it is false, and that therefore there must be at least one counterexample. With respect to some idea of size (which may need to be chosen carefully), one then concludes that there is such a counterexample C that is minimal. In regard to the argument, C is generally something quite hypothetical (since the truth of P excludes the possibility of C), but it may be possible to argue that if C existed, then it would have some definite propert (en) |
| rdfs:label | Minimal counterexample (en) |
| owl:sameAs | freebase:Minimal counterexample yago-res:Minimal counterexample wikidata:Minimal counterexample https://global.dbpedia.org/id/4rw6t |
| prov:wasDerivedFrom | wikipedia-en:Minimal_counterexample?oldid=1098094380&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Minimal_counterexample |
| is dbo:wikiPageRedirects of | dbr:Minimal_criminal |
| is dbo:wikiPageWikiLink of | dbr:Proof_by_infinite_descent dbr:Feit–Thompson_theorem dbr:Counterexample dbr:Minimal_criminal |
| is foaf:primaryTopic of | wikipedia-en:Minimal_counterexample |