Presentation demand field

Context

The definition separates the quantifiers 'one bounded presentation fits every finite horizon' and 'one bounded presentation is exact'. It is set-valued so incomparable resources are not collapsed into a single artificial score.

Definitions

• $S_r=\{\llbracket P\rrbracket:\kappa(P)\le r\}$ is the semantic stratum at resource r.
• $K_{x,r,N}=\{y\in S_r:q_N(y)=q_N(x)\}$ is the horizon-N feasible fiber.
• $F_x(N)=\{r:K_{x,r,N}\ne\varnothing\}$ and $F_x(\infty)=\{r:x\in S_r\}$.
• For compact cores $S_{r,t}\uparrow S_r$, $e_x(r,t)$ is the first horizon excluding that core.

Hypotheses and scope

• The observation tower separates target behaviors and its cylinder sets form a neighborhood basis.
• The resource map is independent of the target and observation horizon.

Verification notes

The definition was reconciled with the M33 specification, proof notes, closure audit, and governed dependency ledger.

Limitations

• This is a framework, not a theorem that compact sewing holds for every presentation class.
• Cover width and run ambiguity are different resource doctrines.

Notes

Feasibility is defined on semantic images so renaming, unreachable padding, and equivalent gauges do not fake escape. The resource order may be non-total. Finite cover width and run ambiguity are distinct doctrines.