The Authorized Realization Boundary

Abstract When a demanded verdict cannot be derived from an evaluator’s licensed distinctions, the informational obstruction and canonical minimum repair can be identified. A further question remains: can the permitted world actually supply that repair? This paper develops the supply-side dual of informational repair for finite declared systems. Given a current channel, a demanded verdict, a restricted language of candidate acquisition channels, and a declared family of authorized portfolios, it characterizes the resolutions the evaluator can attain. Authorized realizability is equivalent to factorization through some permitted enrichment and, dually, to covering every target-obstructing pair. The resulting calculus distinguishes exact realization from realization with excess revelation, separates attained resolution from an unattained ideal envelope, and computes portfolio-relative least coarsenings of demands that authorized supply cannot satisfy. Across incomparable portfolios, these coarsenings form a relaxation frontier rather than a uniquely preferred replacement demand. The formalism consumes authorization as an input; it never derives authority from informational sufficiency. Accordingly, a canonical informational repair need not determine a canonical realization: authorized sufficient portfolios can remain incomparable, leaving selection to a separately declared owner or objective. The resulting outputs are typed as exact acquisition, acquisition with excess revelation, supported demand narrowing, or refusal. All results are proved at finite set level, accompanied by explicit counterexamples and a deterministic 27-check machine battery. Infinite, stochastic, continuous, adaptive, and complexity-theoretic extensions remain outside the paper’s declared scope.