Skip to content

Trilemma

Prime #
1246
Origin domain
Relational
Subdomain
constrained choice → Relational

Core Idea

A trilemma is the structural pattern in which three nominally desirable properties cannot be jointly guaranteed under a stated condition, so the achievable design space collapses to a pick any two; the third must yield shape. The pattern is sharper than a generic binary trade-off because it specifies not merely that objectives compete, but that a particular cardinality — three — combines with a particular kind of constraint — a demonstrated impossibility — to produce a small, discrete taxonomy of admissible configurations. Every trilemma specifies (1) three properties, each individually desirable and operationalised precisely enough to be jointly evaluated; (2) a constraint or proof — formal theorem, model-theoretic result, or robust empirical regularity — establishing that simultaneous satisfaction of all three is infeasible; (3) a forced-choice triangle, in which each pairwise subset of two properties corresponds to a distinct achievable design with a characteristic degradation profile for the surrendered third; and (4) a characteristic intervention catalogue that differs in kind from the binary case.

The fourth commitment is what makes the trilemma a prime rather than a slogan. A binary trade-off invites only "move along the frontier." A trilemma additionally admits dissolution moves with no binary analogue: introducing a fourth property that splits the constraint into smaller, separately-soluble problems, and scoping the constraint condition so that the impossibility does not always bind. These moves change the structure of the problem rather than merely re-pricing it. The trilemma is therefore the n = 3 specialisation of competing objectives carrying its own cargo — a discrete corner-and-dissolution geometry that the parent trade-off pattern does not by itself supply.

How would you explain it like I'm…

Pick Two Of Three

Imagine you want your snack to be cheap, tasty, and healthy — but you can only ever get two of those at once. Cheap and tasty will not be healthy. Healthy and tasty will not be cheap. There are three things you wish for, but you always have to give one up.

The Pick-Two Triangle

Suppose three good things — fast, cheap, and good quality — and a rule that says you can never have all three together. You're forced into a 'pick any two' triangle: fast and cheap means lower quality; cheap and good means slow; fast and good means pricey. This is sharper than a normal trade-off between just two things, because the magic number is exactly three, and there's an actual proof or strong reason it's impossible to get all three. Each pair you pick is its own distinct plan with its own weak spot — the thing you gave up. Sometimes you can even escape the triangle by changing the problem: add a fourth ingredient that splits it up, or shrink when the rule applies so it doesn't always bite.

Pick-Any-Two Triangle

A Trilemma is the pattern where three individually desirable properties cannot be jointly guaranteed under a stated condition, so the design space collapses to 'pick any two; the third must yield.' It is sharper than a generic two-way trade-off because a specific number — three — combines with a specific kind of constraint — a demonstrated impossibility — to produce a small, discrete set of allowed configurations. Every trilemma specifies three precisely defined properties, a constraint or proof (a theorem, a model result, or a robust empirical regularity) showing all three at once is infeasible, and a forced-choice triangle where each pair of properties is a distinct achievable design with its own way of degrading the third. What makes it more than a slogan is a fourth feature: a distinctive set of moves with no two-way analogue, including dissolution — adding a fourth property that splits the constraint into smaller solvable problems, or scoping the condition so the impossibility no longer always binds.

 

A Trilemma is the structural pattern in which three nominally desirable properties cannot be jointly guaranteed under a stated condition, so the achievable design space collapses to a 'pick any two; the third must yield' shape. The pattern is sharper than a generic binary trade-off because it specifies not merely that objectives compete, but that a particular cardinality — three — combines with a particular kind of constraint — a demonstrated impossibility — to produce a small, discrete taxonomy of admissible configurations. Every trilemma specifies (1) three properties, each individually desirable and operationalized precisely enough to be jointly evaluated; (2) a constraint or proof — formal theorem, model-theoretic result, or robust empirical regularity — establishing that simultaneous satisfaction of all three is infeasible; (3) a forced-choice triangle, in which each pairwise subset of two properties corresponds to a distinct achievable design with a characteristic degradation profile for the surrendered third; and (4) a characteristic intervention catalogue that differs in kind from the binary case. The fourth commitment is what makes the trilemma a prime rather than a slogan: a binary trade-off invites only 'move along the frontier,' whereas a trilemma additionally admits dissolution moves with no binary analogue — introducing a fourth property that splits the constraint into smaller, separately-soluble problems, and scoping the constraint condition so the impossibility does not always bind. These moves change the structure of the problem rather than merely re-pricing it; the trilemma is the n = 3 specialization of competing objectives carrying its own discrete corner-and-dissolution geometry.

Structural Signature

the three named desirables — the impossibility constraint — the three pairwise-achievable corners — each corner's surrendered-property degradation profile — the dissolution moves (scope and split) — the cardinality-three invariant

A trilemma is present when these roles and relations hold:

  • Three desirable properties. Each individually wanted and operationalised precisely enough to be jointly evaluated. The cardinality of exactly three is load-bearing — it is what yields a small, discrete admissible-configuration taxonomy rather than a continuous frontier.
  • An impossibility constraint. A proof or robust regularity establishing that all three cannot be simultaneously satisfied under a stated condition — a forced, not negotiable, trade-off.
  • Three corners. Each pairwise subset of two properties corresponds to a distinct achievable design.
  • Per-corner degradation profiles. Each corner has a characteristic signature for how the surrendered third property fails, so "pick a corner" carries a budgeted cost.
  • Dissolution moves. Two manoeuvres with no binary analogue: scoping the binding condition so the impossibility does not always apply, and splitting the constraint by introducing a fourth property. These change the problem's structure rather than re-pricing it.
  • The undeclared-corner failure. Refusing to choose silently degrades one property; claiming to have "solved" a trilemma usually means an undeclared corner choice masquerading as dissolution.

These compose into a corner-and-dissolution geometry: locate the system among three corners, an interior compromise, and two dissolution moves, and name the corner actually occupied.

What It Is Not

  • Not a generic trade_offs pair. A binary trade-off admits continuous substitution along a frontier and only "move along the curve." A trilemma adds a specific cardinality (three) plus a proven or robust impossibility, yielding a discrete pick-two taxonomy and the dissolution moves (scope, split) the binary case lacks.
  • Not multiobjective_optimization in general. Multiobjective optimization seeks Pareto-efficient points over many objectives via a continuous frontier. A trilemma is the special case where exactly three desirables face a hard infeasibility, collapsing the frontier to discrete corners rather than a smooth Pareto surface.
  • Not degrees_of_freedom. Degrees of freedom count independent dimensions of variation. A trilemma is a constraint that removes a degree of freedom — you cannot independently set all three — not a count of how many free axes a system has.
  • Not hierarchical_decomposability. Decomposability concerns whether a system splits into near-independent modules. The trilemma's split dissolution borrows that flavor, but the prime itself is an impossibility geometry over three desirables, not a claim about modular structure.
  • Not constraint as such. A constraint is any feasibility limit. The trilemma is the specific three-desirable, pick-two impossibility shape with its corner-degradation profiles and dissolution catalogue — a particular constraint geometry, not the general notion.
  • Common misclassification. Claiming to have "solved" a trilemma. Almost always this is an undeclared corner choice masquerading as dissolution — a managed float not named, a CAP-evasion that quietly picked CP. Catch it by demanding the practitioner name the corner actually occupied and the degradation profile of the surrendered third.

Broad Use

The pattern recurs wherever an impossibility result over three named desirables has been proven or observed. In distributed systems, the CAP theorem holds that consistency, availability, and partition tolerance cannot all be guaranteed under partition, and designs cluster into CP, AP, and (in non-partitioned modes) CA-like configurations. In open-economy macroeconomics, the Mundell-Fleming "impossible trinity" of a fixed exchange rate, free capital flows, and independent monetary policy admits any two but not all three; observed currency regimes sort into the three corners. Rodrik's globalisation trilemma names deep economic integration, national sovereignty, and democratic politics as jointly unmaximisable. In project management the iron triangle of scope, schedule, and budget gives the colloquial "good, fast, cheap — pick two." The World Energy Council's energy trilemma (low-carbon, reliable, affordable) frames national electricity-system design; the triple bottom line treats economic, social, and environmental objectives as a forced-choice geometry; and the FLP impossibility (fault-tolerant consensus, full asynchrony, deterministic termination) is the trilemma of distributed agreement. Constitutional and workplace-governance debates supply further instances (liberty-security-prosperity; efficiency-equity-voice).

Clarity

The trilemma frame clarifies by distinguishing forced from negotiable trade-offs. A binary trade-off is often negotiable through continuous substitution along a frontier; a trilemma marks a region of structural impossibility where no cleverness within the stated constraint admits all three properties at once, because the impossibility is proven rather than contingent. The frame then makes the failure mode of pretending otherwise legible: a practitioner who refuses to choose — insisting on all three — gets one silently degraded. CAP-naive systems exhibit unexplained inconsistency under partition; Mundell-naive monetary regimes meet currency crises that look like surprises but were forced by an unannounced violation. By converting "we want all three" into "which corner are we on, and what is the degradation profile of the property we surrendered?", the frame turns a wish into a checkable design commitment with a budgeted cost.

Manages Complexity

The pattern collapses a high-dimensional design space into a small discrete taxonomy that doubles as a practitioner's worklist. The first axis is the three corners: the three pairwise combinations, each with a well-defined surrendered property and a characteristic degradation profile. The second is interior compromises: weaker forms of all three properties — eventual consistency plus bounded availability plus partition tolerance, say — that sit inside the impossibility surface. The third is constraint-relaxation dissolution: scope conditions under which the impossibility does not apply, as when CAP binds only during partition and PACELC names the no-partition mode separately. The fourth is reframing dissolution: introducing a fourth property that splits the impossibility, as separating read-consistency from write-consistency, or short-term from long-term capital flows. Because the taxonomy is finite and named, the work of analysing any trilemma-structured problem reduces to locating the system among these positions, identifying which property is currently being degraded, and asking whether the binding condition can be scoped away or the framing decomposed.

Abstract Reasoning

The trilemma supports a precise class of counterfactual reasoning: holding the impossibility result fixed, what changes if we surrender a different property? This forces designers to trace the consequences of each corner explicitly. CP systems handle partition by refusing writes, so plan for client-side queuing; AP systems accept divergence, so plan for conflict resolution; CA-leaning systems assume partition does not happen, so plan for catastrophic failure when it does. The reasoning also licenses transfer between substrates that share the structure even when their domains differ. A reasoner who has internalised one trilemma can recognise the shape on first encounter in a new field and immediately ask the right diagnostic questions — which property is being silently degraded? what would each corner design look like? is the constraint condition always active, or can it be scoped? — without re-deriving the geometry from scratch. The discreteness of the taxonomy is what makes this recognition fast: there are only three corners, an interior, and two dissolution moves to consider.

Knowledge Transfer

A reasoner who has worked through one trilemma navigates a second one faster than a reasoner who has only worked through binary trade-offs, because the corner-and-dissolution geometry transfers directly and the roles name themselves across substrates. The three desirables, the impossibility result, the three corners with their degradation profiles, and the two dissolution moves appear in CAP, in the impossible trinity, in the iron triangle, and in the energy trilemma alike; once the abstract shape is held, each new instance is a labelling exercise rather than a fresh analysis. The intervention archetypes are the most portable cargo: pick a corner explicitly and budget its degradation; scope away the binding condition; introduce a fourth property to split the constraint; accept an interior compromise but specify its degradation profile. A distributed-systems engineer who has internalised PACELC's scoping move can recognise the same manoeuvre when an economist separates short-term from long-term capital flows; a project manager who knows the iron triangle can read Rodrik's globalisation triangle on sight. The transfer also flags a recurring rhetorical failure that is itself portable: practitioners in many domains claim to have "solved" a trilemma they have in fact silently moved along — the architect who claims CAP-evasion has usually picked a corner without noticing, and the economist who claims Mundell-evasion has usually chosen a managed float without naming it. Recognising this move in one field inoculates the reasoner against it in every other, because the self-deception has the same structural signature wherever the trilemma appears: an undeclared corner choice masquerading as a dissolution. The diagnostic that travels with the pattern — "name the corner you are actually on" — is the single most useful import a newcomer to any trilemma-structured field can carry across the boundary.

Examples

Formal/abstract

The CAP theorem is the trilemma in its cleanest proven form. The three named desirables are consistency (every read returns the most recent write), availability (every request receives a non-error response), and partition tolerance (the system continues operating despite dropped messages between nodes). The impossibility constraint is a proof, not a regularity: when a network partition occurs, two nodes on opposite sides of the cut cannot both answer requests and stay consistent, because neither can see the other's writes — so all three cannot hold simultaneously during a partition. The three corners are correspondingly discrete. A CP design refuses service on the minority side of a partition to preserve consistency: its surrendered-property degradation profile is unavailability — clients see errors or timeouts until the partition heals. An AP design answers on both sides and reconciles later: its degradation profile is divergence — clients may read stale data and writes must be merged afterward. The third "corner," CA, is only coherent when partitions are assumed never to occur, which is the scope condition. This exposes the dissolution moves precisely. The scoping move is PACELC: it scopes the impossibility to the partition case and names the no-partition mode separately (latency versus consistency), so the system is described by two regimes rather than one false trinity. The splitting move introduces a fourth property — separating read-consistency from write-consistency, or offering tunable per-operation consistency levels — which decomposes the single constraint into smaller, separately-soluble ones.

Mapped back: Consistency, availability, and partition tolerance are the three desirables, the partition proof the impossibility constraint, CP and AP the corners with their unavailability and divergence degradation profiles, and PACELC and tunable consistency the scope-and-split dissolution moves — the prime instantiated end-to-end.

Applied/industry

National electricity-system planning runs the prime as the World Energy Council's energy trilemma. The three desirables are a low-carbon supply (decarbonization), a reliable supply (security: the lights stay on under demand peaks and supply shocks), and an affordable supply (low cost to consumers). The constraint is a robust empirical regularity rather than a theorem: pushing hard on any two reliably degrades the third under current technology and grid structure. The corners are real national strategies with named degradation profiles. A low-carbon-plus-reliable corner — heavy renewables backed by firm dispatchable capacity and storage — surrenders affordability, showing up as high consumer tariffs and capacity-market payments. A reliable-plus-affordable corner — cheap fossil baseload — surrenders decarbonization, showing up as emissions overshoot. A low-carbon-plus-affordable corner — maximal cheap renewables without firming — surrenders reliability, showing up as blackout risk during low-wind, low-sun peaks. The prime's value is making the silent corner declared: a government claiming to deliver all three is usually on an undeclared corner whose degradation is deferred (deferred grid investment surfacing later as either price spikes or outages). The dissolution moves apply: scoping the constraint by time horizon (the trilemma binds tightly near-term but slackens as storage costs fall) and splitting it by introducing interconnection or demand-response as a fourth lever. The identical structure governs the project-management iron triangle (scope, schedule, budget — "good, fast, cheap, pick two") and the open-economy impossible trinity (fixed exchange rate, free capital flow, independent monetary policy).

Mapped back: Decarbonization, security, and affordability are the three desirables, the empirical infeasibility the constraint, the three national strategies the corners with emissions/blackout/tariff degradation profiles, and the undeclared-corner failure the trap the prime exposes — the same geometry shared with the iron triangle and the impossible trinity.

Structural Tensions

T1 — Measurement: Proven Impossibility Versus Empirical Regularity. The prime treats the impossibility constraint as a single role, but its instances range from a hard theorem (CAP, FLP) to a soft empirical regularity (the energy trilemma) that better technology can slacken. Conflating the two is the central tension: a proven trilemma cannot be engineered away within its scope, but an empirical one invites exactly the cleverness the prime tells you to abandon. The failure mode is treating a contingent trade-off as an iron law and forgoing innovation that would have relaxed it, or treating a theorem as soft and chasing an impossible fourth corner. Diagnostic: ask whether the constraint is a proof or an observation; only the former licenses "no cleverness admits all three."

T2 — Scopal: The Binding Condition May Rarely Bind. Each trilemma's impossibility holds only under a stated condition (CAP binds only during partition), and the prime's scoping dissolution exploits this. The tension is that practitioners argue about the corner as if the constraint were always active, when the binding condition may occupy a tiny fraction of operating time. The failure mode is over-engineering for the constrained regime — sacrificing availability always to honor a consistency requirement that only conflicts during rare partitions — paying the trilemma's cost continuously for a constraint that seldom bites. Diagnostic: estimate how often the binding condition actually holds; design the common case separately (PACELC's move) rather than letting the rare worst case dictate the whole architecture.

T3 — Sign/Direction: Splitting a Property Can Be Real Dissolution or Disguised Corner-Picking. The prime offers splitting (introduce a fourth property) as a structural dissolution, but warns that claimed dissolutions are often undeclared corner choices. These two live in tension on the same move: separating read- from write-consistency genuinely decomposes the constraint in some systems and merely renames a corner choice in others. The failure mode is celebrating a "fourth property" that has quietly surrendered part of one original desirable, so the trilemma is satisfied only by redefining a term. Diagnostic: check whether the split preserves the full strength of all three original properties or weakens one under a new label; genuine dissolution changes the constraint's structure, fake dissolution changes the vocabulary.

T4 — Scalar: Cardinality Three Is Sometimes Imposed, Not Found. The load-bearing invariant is exactly three properties, but real constraint spaces have many desirables, and naming precisely three can be a rhetorical compression that hides a fourth competing property or merges two. The failure mode is forcing a genuinely four- or five-way tension into a tidy triangle, so the analysis omits a desirable that is actually in play (an "energy trilemma" that ignores land-use or geopolitical-dependence). Diagnostic: ask whether the three are exhaustive of the binding desirables or a curated subset; if a fourth property materially competes, the clean pick-two geometry is a simplification that may mislead the corner choice.

T5 — Coupling: The Three Properties Are Rarely Independent. The corner taxonomy assumes the three desirables are separable axes you trade among, but they often correlate — partial satisfaction of one shifts the achievable frontier of the others, so the "interior compromise" is not a simple weakening of all three. The failure mode is planning a balanced interior point as if each property degrades independently, when surrendering some consistency disproportionately collapses availability (or buys more than expected). Diagnostic: map the interactions among the three before settling an interior compromise; the trade surface is generally curved and coupled, not the flat triangle the pick-two picture suggests.

T6 — Temporal: The Achievable Corners Drift as the Substrate Evolves. The prime locates a system among fixed corners, but technology, regulation, and scale move the impossibility surface over time — falling storage cost slackens the energy trilemma, new consensus protocols reshape what FLP's scope permits. The failure mode is committing to a corner and its degradation budget against a frontier that has since moved, so the surrendered property is sacrificed needlessly or a now-reachable configuration is never attempted. Diagnostic: date the constraint and periodically re-test whether the binding condition or the corner geometry still holds; a trilemma analysis is valid only for the substrate generation it was derived on.

Structural–Framed Character

Trilemma sits at the structural pole of the structural–framed spectrum, matching its structural grade with a zero aggregate — every diagnostic points one way. The prime is pure constraint geometry: three named desirables, an impossibility constraint, three pairwise-achievable corners with degradation profiles, and two dissolution moves (scope and split), all stated in medium-neutral terms.

The vocabulary travels with no resistance and carries no domain's home lexicon — the identical three-corner-and-dissolve shape is told as CAP in distributed systems, the Mundell-Fleming impossible trinity in macroeconomics, Rodrik's globalization triangle in political economy, the iron triangle in project management, the energy trilemma in electricity planning, and FLP in consensus theory, each a labelling exercise over the same geometry. It carries no inherent evaluative weight: the three desirables are stipulated as wanted, but the prime itself passes no judgment on which corner is right — the corner choice and its degradation budget are the practitioner's, and the structure is neutral across them. Its origin is formal-relational — a cardinality-three impossibility over an admissible-configuration space, with the cleanest instances being outright theorems (CAP, FLP) — with no institutional or normative load. It runs indifferently across human, computational, economic, and engineering substrates: the corner-and-dissolution geometry is the same whether the three desirables are consistency/availability/partition-tolerance in silicon or liberty/security/prosperity in constitutional design, requiring no human practice to constitute the impossibility (the partition proof holds with no human in the loop). And invoking the prime merely recognizes a constraint geometry already present rather than importing an interpretive frame — the diagnostic ("name the corner you are actually on") reads a structural fact. On every diagnostic it reads structural, and the zero aggregate is faithful.

Substrate Independence

Trilemma is a maximally substrate-independent prime — composite 5 / 5 on the substrate-independence scale. Its domain breadth is at the ceiling: the three-property impossibility geometry recurs as the CAP theorem in distributed systems, the Mundell-Fleming impossible trinity in open-economy macroeconomics, Rodrik's globalisation trilemma, the iron triangle in project management, the World Energy Council's energy trilemma, the FLP impossibility in distributed consensus, and the triple bottom line — substrates spanning theoretical computer science, economics, and governance. Its structural abstraction is total: the signature is a content-free combinatorial geometry — three named desirables, a proven or robust impossibility of holding all three, a discrete three-corner taxonomy, and dissolution moves (scope the binding condition, split the constraint) — that carries no commitment to any subject matter. Transfer evidence is maximal: the same pick-two intervention catalogue and the same scoping-and-decomposition dissolution moves transfer identically across CAP, Mundell-Fleming, and the iron triangle, and several instances are formal theorems sharing the identical structure. Breadth, abstraction, and documented cross-domain transfer all at the top make this a canonical five.

  • Composite substrate independence — 5 / 5
  • Domain breadth — 5 / 5
  • Structural abstraction — 5 / 5
  • Transfer evidence — 5 / 5

Relationships to Other Primes

One-hop neighborhood: parents above, mutual partners to the right, children below.Trilemmasubsumption: Trade-offsTrade-offs

Parents (1) — more general patterns this builds on

  • Trilemma is a kind of Trade-offs

    The file states trilemma is 'the n=3 specialisation of competing objectives' / 'widely (and not wrongly) regarded as a special case of trade_offs' — three desirables + a proven impossibility yielding a discrete pick-two taxonomy plus dissolution moves the binary case lacks.

Path to root: Trilemma → Trade-offs → Constraint

Neighborhood in Abstraction Space

Trilemma sits in a moderately populated region (58th percentile for distinctiveness): it has near-neighbors but no dense thicket of synonyms.

Family — Formal Methods & Idealized Models (31 primes)

Nearest neighbors

Computed from structural-signature embeddings · 2026-06-14

Not to Be Confused With

The most fundamental confusion is with trade_offs, of which the trilemma is widely (and not wrongly) regarded as a special case. Both name situations where desirables compete and not all can be maximized. But the trilemma carries cargo the generic trade-off does not, and the difference is exactly what makes it worth treating as a distinct prime. A binary trade-off is typically continuous and negotiable: it defines a frontier along which one can substitute a little less of A for a little more of B, and the only move is to choose a point on the curve. The trilemma adds three load-bearing features. First, a cardinality of exactly three, which combines with the impossibility to yield a discrete taxonomy — three corners, not a smooth curve. Second, a proven or robust impossibility (a theorem like CAP or FLP, or a hard empirical regularity), which converts "you must compromise" into "no cleverness within the stated scope admits all three." Third, and most distinctively, the dissolution moves — scoping the binding condition and splitting the constraint with a fourth property — which have no binary analogue, because they change the structure of the problem rather than re-pricing a continuous trade. A practitioner who flattens a trilemma into "just a trade-off" loses access to exactly these structural moves and is left only with "move along the frontier," missing that the impossibility might be scoped away or decomposed entirely.

A second genuine confusion is with multiobjective_optimization. Both deal with several competing objectives, and a trilemma's "interior compromise" looks like a point on a Pareto frontier. But multiobjective optimization is the general continuous theory: it characterizes the Pareto surface over arbitrarily many objectives and seeks efficient points where no objective improves without another worsening. The trilemma is the special discrete case where exactly three desirables meet a hard infeasibility that collapses the relevant Pareto surface to a small set of named corners with characteristic degradation profiles. The distinction matters because the toolkits diverge: multiobjective optimization reaches for scalarization, weighting, and frontier exploration, treating the trade surface as smooth and fully traversable; the trilemma reaches for corner declaration, scope analysis, and constraint splitting, treating the surface as structured by a proven impossibility. A reasoner who applies continuous Pareto methods to a hard trilemma will search for a balanced interior point that the impossibility forbids in full strength, and will be unable to see the scope-and-split moves that the discrete impossibility makes available.

A third confusion worth drawing is with constraint in the bare sense. Every trilemma contains a constraint — the impossibility result — so it is tempting to file the trilemma under "a kind of constraint." But the prime is not the constraint alone; it is the whole geometry the constraint induces over three desirables: the three pairwise corners, each corner's degradation signature, the interior compromise, and the two dissolution manoeuvres. A constraint tells you what is infeasible; the trilemma tells you what the feasible region looks like and how to navigate it. Conflating them reduces the rich corner-and-dissolution analysis to a flat "this is impossible," discarding the actionable taxonomy that is the prime's reason for existing.

For a practitioner these distinctions determine which moves are on the table. Mistake a trilemma for a generic trade-off and you only slide along a frontier, never scoping or splitting; mistake it for multiobjective optimization and you chase a forbidden interior point with continuous methods; mistake it for a bare constraint and you stop at "impossible" instead of choosing a corner and budgeting its cost. The prime earns its keep by supplying the discrete corner-and-dissolution geometry — and the discipline to name the corner you are actually on.

Solution Archetypes

No catalogued solution archetypes reference this prime yet.