A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Existence Proofs

College Depth 71 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
341prerequisites beneath it
See this on the map →
Proof by Contradiction→→Uniqueness Proofs
existence proof quantifiers

Core Idea

An existence proof establishes that an object satisfying certain properties exists. This can be constructive (exhibiting the object explicitly) or non-constructive (showing non-existence leads to contradiction). Both are valid.

Explainer

In mathematics, an existence proof answers the question "does there exist an object satisfying property P?" with a definitive yes. What counts as a valid answer — and which kind of answer is philosophically satisfying — has been debated by mathematicians for over a century, making existence proofs one of the most intellectually interesting topics in the methods-of-proof toolkit.

The most direct approach is a constructive proof: you actually exhibit the object. To prove there exists a prime number greater than 100, you can simply observe that 101 is prime and 101 > 100. Done. The object is in hand. Constructive proofs are the gold standard when available, because they not only confirm existence but also give you something to work with. If you need an algorithm, a specific value, or a counterexample, a constructive proof delivers it directly.

The alternative is a non-constructive proof: you show that the object's non-existence leads to a contradiction, and therefore it must exist — without ever producing it. You're familiar with this pattern from proof by contradiction. A famous example is the proof that there exist irrational numbers a and b such that aᵇ is rational. Consider √2^√2. Either this is rational (done — take a = b = √2) or it is irrational. If irrational, then (√2^√2)^√2 = √2² = 2, which is rational. So in either case we have an example — but we never determined which case holds. The object exists; we just don't know which one.

This non-constructive style can feel philosophically unsatisfying: you've proven something exists without ever finding it. Some mathematicians (constructivists) reject non-constructive proofs on principle. In mainstream mathematics, however, both methods are fully accepted. What makes an existence proof valid is logical correctness, not the ability to compute the witness. When you write an existence proof, always ask: is this constructive or non-constructive? If non-constructive, be explicit that you're using contradiction, and make sure the argument is airtight — you're asserting something exists that you cannot touch.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Existence Proofs

Longest path: 72 steps · 341 total prerequisite topics

Prerequisites (1)

Leads To (1)