Exhaustive Partition Audit¶
Audit procedure — instantiates Option-Space Reopening
Treats the offered choices as a formal partition and tests whether the named cells, along their dividing axis, actually cover the whole option space with no gap between them.
An Exhaustive Partition Audit takes the choices on the table and asks a single structural question: do these cells, taken together, cover the entire option space, or is there a region no cell claims? It treats "here are the options" as a partition claim — a set of cells cut along some dividing axis — and audits that claim for completeness. It does not go looking for a specific missing option, and it does not judge whether the constraints producing the partition are legitimate. It only checks whether the map has holes: whether the stated cells are collectively exhaustive, and whether the axis they are cut along is itself complete or has silently swallowed a second dimension. A partition that fails this audit is a false exhaustive — good reasoning can then proceed safely inside cells that do not contain the right answer.
Example¶
A criminal trial reaches the verdict form, and it offers the jury two boxes: guilty or not guilty. Before deliberating, the presiding judge runs what amounts to an Exhaustive Partition Audit on that form. First, state the partition exactly: the axis is "did the prosecution prove the charged offense beyond a reasonable doubt — yes or no." Then test the exhaustiveness claim. Along that single axis the two boxes do look complete — but the audit's second move is to ask whether the axis itself is the only one in play. It is not. There is a degree dimension (a lesser-included offense the evidence might support instead of the charged one) and a responsibility dimension (not guilty by reason of insanity). Neither is a shade of "guilty or not guilty"; each is a cell the two-box form quietly excluded by collapsing three dimensions into one.
The audit's output is not a verdict and not a new option — it is a finding: the offered partition is incomplete along the offense-degree and legal-responsibility axes. That finding is what sends the form back to be redrawn with the missing cells before any juror reasons inside it. Had the audit passed — had the case genuinely admitted only the charged offense with no responsibility question — it would have certified the binary as complete and let deliberation proceed.
How it works¶
The audit runs three passes over the stated choices:
- State the partition. Write the options down as cells and name the rule that assigns something to each. Vague framings ("we can go big or go home") resist this step, and the resistance is itself diagnostic — a partition you cannot state precisely is one whose exhaustiveness cannot be checked.
- Mark the exhaustiveness claim. Locate where closure is being asserted ("those are the only two," "everything else is off the table") and treat it as a claim to be proven, not a premise. A partition with no exhaustiveness claim is just a shortlist and needs no audit.
- Audit the dividing dimension. Ask whether the cells are cut along a single axis when the problem has several independent ones. The most common failure is a partition that is exhaustive on its own axis but collapses a second, orthogonal axis into invisibility — as the verdict form did.
The result is a pass/fail on completeness plus a list of the axes along which the partition leaks — never the missing options themselves.
Tuning parameters¶
- Axis granularity — how finely you decompose the dividing dimension. Finer decomposition catches collapsed sub-dimensions but can manufacture distinctions the decision does not care about.
- Closure standard — how strong a warrant the exhaustiveness claim must meet: logical exhaustiveness (the cells provably tile the space) versus practical exhaustiveness (no material region omitted). The stricter standard finds more holes and flags more false positives.
- Formality — a two-minute mental check versus a written partition table with a membership rule per cell. Match it to how load-bearing the closure claim is and how motivated the framer might be.
- Scope of the space — whether "the option space" means all logically conceivable options or only those within the decision's mandate. Drawing this line too narrow re-imports the very exclusion the audit is meant to expose.
When it helps, and when it misleads¶
Its strength is that it is a completeness check that needs no creativity: you can prove a partition leaky without yet naming what fills the gap, which makes it a fast, low-controversy first gate before anyone invests in generating alternatives. Framing it as a MECE test — are the cells mutually exclusive and collectively exhaustive? — gives it a shared vocabulary decision-makers already trust.[n1]
Its failure mode is false rigor: a partition can pass the audit — be airtight on its stated axis — while the whole axis is the wrong one to be cutting on, and a purely structural check will not notice, because it certifies the map, not the territory. The classic misuse is treating a clean MECE pass as proof that the options are good, when all it proves is that they are complete relative to one framing. The guarding discipline is to run the dimension audit before certifying: never sign off on exhaustiveness until you have asked whether a second independent axis has been folded into the first.
How it implements the components¶
This audit fills the partition-testing components only — the front of the archetype's pipeline, before any option is recovered:
asserted_partition_statement— its first pass writes the offered choices down as explicit cells with a membership rule, the artifact everything else audits.exhaustiveness_claim_marker— it locates and flags the closure claim, converting "those are the only options" from premise to proposition-under-test.partition_dimension_audit— its core move checks whether the cells are cut along one axis when the problem spans several, surfacing collapsed dimensions.
It does not judge whether the excluding constraints are real (constraint_legitimacy_check) or certify a surviving binary as genuine (binary_residual_justification, decision_reentry_gate) — that adjudication belongs to Binary Validity Test, which takes over exactly where a structurally complete-looking two-cell partition still needs its constraint tested.
Related¶
- Instantiates: Option-Space Reopening — the audit is the completeness gate that decides whether the partition even needs reopening.
- Sibling mechanisms: Binary Validity Test · Forced-Choice Reframe · Constraint Relaxation Probe · Boundary Question Ladder · Morphological Option Matrix · Trade-off Surface Sketch · Third-Option Prompt · Red-Team Missing-Alternatives Review · Stakeholder Alternative Elicitation
Editorial Notes¶
Form Classification¶
Form family: Assessment, Review & Assurance
Rationale: Exhaustive Partition Audit operates as a bounded evaluation of existing evidence or work that produces a finding or disposition because it treats the offered choices as a formal partition and tests whether the named cells, along their dividing axis, actually cover the whole option space with no gap between them.
Independent corroboration: The frozen evidence defines Exhaustive Partition Audit as 'Treats the offered choices as a formal partition and tests whether the named cells, along their dividing axis, actually cover the whole option space with no gap between them', so its operative form is Assessment, Review & Assurance.
Review outcome: Independent reviewer agreement; high confidence.
Origin Attribution¶
Primary origin: Mathematics
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Universal
Rationale: Testing mutual exclusivity and collective exhaustiveness of cells is formal set-theoretic partition analysis.
Related originating lineages:
- Philosophy — Logical dilemma analysis materially applies exhaustiveness tests to offered choices and option spaces. Dilemma analysis and logical criticism materially shaped using exhaustive partitions to expose false choices.
Review resolution: Both reviewers agree that mathematics is primary. I retain philosophy only as formative origin lineages; cross_disciplinary_synthesis is appropriate because the final form materially combines the agreed primary with the retained formative lineages. Reach is universal because the structure is portable across essentially any domain with the stated problem, an applicability judgment kept separate from provenance. Encyclopedia synthesis is true because the exact generalized artifact is an encyclopedia-authored combination or refinement. No unresolved historical ambiguity remains after reconciling the secondary fields.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
The audit deliberately stops at "the partition leaks here." Naming what fills the gap is a different skill (recovery and synthesis) with different failure modes, and fusing the two tempts the auditor to wave a partition through because they cannot immediately think of a missing option — precisely the reasoning the archetype exists to interrupt.
[n1] MECE — "mutually exclusive, collectively exhaustive," a partitioning discipline popularized in management consulting (associated with Barbara Minto's Pyramid Principle): categories should not overlap and should together cover the whole. This audit implements the "collectively exhaustive" half as a first-class test rather than an assumption. ↩