Skip to content

The Defense Trilemma

Continuity, utility preservation, completeness — pick at most two.

The statement

::: theorem Let X be a connected Hausdorff space, f:XR continuous with Sτ,Uτ. No map D:XX can simultaneously be

  1. continuous — close prompts produce close rewrites,
  2. utility-preservingD(x)=x for every xSτ, and
  3. completef(D(x))<τ for every xX. :::

Any two can coexist — but all three simultaneously is impossible.

The triangle

Each dashed edge corresponds to the failure mode that arises if you insist on the two endpoints of that edge.

What each failure mode looks like

DropKeepFailure mode you get
ContinuityUtility + CompletenessA discontinuous filter: a hard rejecter at the boundary, equivalent to a blocklist — not a continuous wrapper.
Utility preservationContinuity + CompletenessA constant (or generally lossy) map D(x)=x0: every prompt produces the same reply. Utility is destroyed.
CompletenessContinuity + UtilityOur result: some boundary points z with f(z)=τ pass through unchanged.

Why the third edge is forced

A continuous utility-preserving complete D would be a retractionXSτ (because D|Sτ=id and D(X)Sτ). Continuous retracts of Hausdorff spaces are closed. But Sτ=f1((,τ)) is open, and in a connected space a non-empty proper subset cannot be clopen. Contradiction.

::: remark The theorem is tight: removing any single hypothesis gives a counter-example. See Limitations & counter-examples. :::

Where it is in the artifact

ComponentLean file
Continuous-case boundary fixationMoF_08_DefenseBarriers · defense_incompleteness
Discrete-case dilemmaMoF_12_Discrete · discrete_defense_boundary_fixed
Unified meta-theoremMoF_14_MetaTheorem · regularity_implies_spillover

Next

The Defense Trilemma · mechanically verified in Lean 4 (46 files, ≈360 theorems, 0 sorry).