This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Proof_by_infinite_descent
dbo:wikiPageWikiLink
dbr:Minimal_counterexample
Subject Item
dbr:Minimal_counterexample
rdf:type
yago:Indication106797169 yago:Evidence106643408 yago:Proof106647614 yago:Argument106648724 yago:Abstraction100002137 yago:MathematicalProof106647864 yago:Communication100033020 yago:WikicatMathematicalProofs
rdfs:label
Minimal counterexample
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
dcterms:subject
dbc:Mathematical_proofs dbc:Mathematical_terminology
dbo:wikiPageID
965376
dbo:wikiPageRevisionID
1098094380
dbo:wikiPageWikiLink
dbr:Proof_by_contradiction dbc:Mathematical_proofs dbr:Classification_of_finite_simple_groups dbr:Proof_By_Induction dbr:Mathematics dbc:Mathematical_terminology dbr:Solvable_group dbr:Proof_by_infinite_descent dbr:Well-ordered_induction dbr:Well-ordering dbr:Feit–Thompson_theorem dbr:Natural_number dbr:Fundamental_theorem_of_arithmetic dbr:Cyclic_group dbr:Mathematical_induction dbr:Counterexample
owl:sameAs
yago-res:Minimal_counterexample n15:4rw6t freebase:m.03t_mm wikidata:Q6865307
dbp:wikiPageUsesTemplate
dbt:Redirect dbt:Short_description dbt:Reflist dbt:When%3F
dbp:date
December 2021
dbp:reason
Is the tense correct here?
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.
prov:wasDerivedFrom
wikipedia-en:Minimal_counterexample?oldid=1098094380&ns=0
dbo:wikiPageLength
4010
foaf:isPrimaryTopicOf
wikipedia-en:Minimal_counterexample
Subject Item
dbr:Feit–Thompson_theorem
dbo:wikiPageWikiLink
dbr:Minimal_counterexample
Subject Item
dbr:Counterexample
dbo:wikiPageWikiLink
dbr:Minimal_counterexample
Subject Item
dbr:Minimal_criminal
dbo:wikiPageWikiLink
dbr:Minimal_counterexample
dbo:wikiPageRedirects
dbr:Minimal_counterexample
Subject Item
wikipedia-en:Minimal_counterexample
foaf:primaryTopic
dbr:Minimal_counterexample