Case-Split Elimination Table¶
Tabular method — instantiates Contradiction-Closure Proof
Lays the supposition's exhaustive, mutually exclusive cases in a table and drives each row to contradiction, so the negation survives in no case and the claim closes.
Case-Split Elimination Table handles indirect proofs where the supposition does not collapse in one line but instead branches into a finite set of situations that must each be knocked down. You assume the negation, partition it into an exhaustive and mutually exclusive set of cases, and give each a row in a table; the row's job is to carry that case to its own contradiction. The claim closes only when the last row is eliminated — because if even one case survived, the negation would still be tenable. Its defining move, and the source of both its power and its risk, is the exhaustiveness bookkeeping: the table's authority rests entirely on the cases being collectively exhaustive, so the discharge is not "I found a contradiction" but "no case escaped." That is a different discipline from a single derivation — the tabular layout exists to make the coverage visible and the closure conditional on completeness.
Example¶
A classic combinatorial claim: a chessboard with two opposite corners removed cannot be tiled by 1×2 dominoes. Direct attempts to tile fail endlessly, so the proof goes indirect — suppose such a tiling exists — and splits on a colouring. Colour the board like a checkerboard; each domino, wherever placed, covers exactly one dark and one light square. The two removed corners are the same colour, say both light, leaving 32 dark and 30 light squares. Case table: any complete tiling uses 31 dominoes; row by row, whatever arrangement, the 31 dominoes cover 31 dark and 31 light squares — but the board has 32 and 30. Every possible tiling falls in the single covered case "uses 31 dominoes," and that case contradicts the square counts. No case survives.
The table made the closure honest: the proof does not tile anything, it shows the parity accounting rules out every arrangement at once. The elimination is complete because the cases (by domino count and colour balance) exhaust the possibilities, and that exhaustiveness is what licenses concluding no tiling exists.
How it works¶
- Partition the supposition. Split the assumed negation into cases that are mutually exclusive and, crucially, collectively exhaustive — the coverage is the load-bearing part.
- One row, one derivation. Each case gets its own line of inference to a contradiction; rows are independent mini-derivations sharing the accepted premises.
- Track completeness. Maintain an explicit account that every possibility maps to some row — a leftover case is a hole in the proof.
- Close on the last elimination. When every row ends in contradiction, discharge the supposition: the negation holds in no case, so the claim holds.
Tuning parameters¶
- Split dimension — what variable the cases partition on (parity, sign, ordering, a finite type). A well-chosen dimension collapses many situations into few rows; a poor one explodes them.
- Case count — granularity of the partition. Fewer, broader cases are readable; more, finer cases are easier to contradict individually.
- Exhaustiveness rigor — an informal "these are all the possibilities" versus a proof that the partition covers the space. More rigor closes the classic gap where a case is silently missed.
- Row sharing — whether cases reuse a common sub-argument or each stands alone. Sharing shortens the table but couples the rows.
When it helps, and when it misleads¶
Its strength is that it makes finite, branching impossibilities tractable and their closure explicit — a disciplined proof by exhaustion[1] where the reader can audit both each row and the claim that the rows are all of them. It suits problems where no single blow fells the supposition but a complete sweep does.
Its failure mode is the missed case: the entire proof is worthless if the partition is not actually exhaustive, and a plausible-looking table invites exactly that error by making the filled rows feel like the whole story. Over-splitting is the milder cousin — a table so large no one verifies every row, so an un-eliminated case hides in the bulk. The guarding discipline is to prove the partition covers the space before trusting the eliminations, and to keep the case count small enough that completeness is checkable by eye.
How it implements the components¶
Case-Split Elimination Table realizes the branching-derivation-and-closure side of the archetype:
derivation_path— each row is a derivation from its case to a contradiction; the table is a fan of parallel paths rather than one chain.discharge_and_closure_rule— closure fires only when the last case is eliminated, so the discharge is explicitly conditional on exhaustive coverage.
The table drives each case to a contradiction but does not itself catalog or type what counts as one, nor bound the logic (contradiction_criterion, scope_and_logic_boundary) — that framing is Natural Deduction Proof Tree; the table organizes many of its derivations side by side.
Related¶
- Instantiates: Contradiction-Closure Proof — supplies the exhaustive case-elimination structure the archetype's "empty case set" contradiction form requires.
- Consumes: Reductio Proof Template frames the single supposition the table then partitions.
- Sibling mechanisms: Reductio Proof Template · Natural Deduction Proof Tree · Assumption Ledger · Contradiction Search Checklist · Minimal Unsat Core Analysis · Peer Proof Review · Proof Assistant Script · Unsatisfiability Certificate
Editorial Notes¶
Form Classification¶
Form family: Analysis, Modeling & Optimization
Rationale: Lays the supposition's exhaustive, mutually exclusive cases in a table and drives each row to contradiction, so the negation survives in no case and the claim closes, making its operative form a computation, comparison, model, or analytic representation used to infer, estimate, or choose.
Independent corroboration: The frozen evidence defines Case-Split Elimination Table as 'Lays the supposition's exhaustive, mutually exclusive cases in a table and drives each row to contradiction, so the negation survives in no case and the claim closes', so its operative form is Analysis, Modeling & Optimization.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Mathematics
Origin pattern: Single lineage
Present-day reach: Multi-domain
Rationale: Mathematical proof by cases or exhaustion partitions all possibilities and settles every mutually exclusive row to close the argument.
Related originating lineages:
- Computer Science & Software Engineering — Machine-checked proofs and exhaustive verification operationalize large finite case sets.
- Philosophy — Formal logic supplies contradiction and exhaustive-disjunction rules underlying elimination.
Review resolution: Mathematics is primary because proof by cases and exhaustive partitioning require branches to be mutually exclusive and jointly exhaustive. Philosophy and computer science supply logical and algorithmic forms, while the underlying method remains a single formal lineage with broad reach.
Review outcome: Reconciled after independent review; high confidence.
References¶
[1] Proof by exhaustion (proof by cases) establishes a claim by partitioning the possibilities into finitely many cases and settling each. Its most famous large-scale use is the Appel–Haken proof of the four-colour theorem (1976), which reduced the problem to a finite set of configurations checked by computer — and drew scrutiny precisely over whether the case set was truly exhaustive. withdrawn registry ↩