Under calibrated point observations of an L-Lipschitz field with adversarial error bounded by ε, the minimax uniform reconstruction error is L times the reference coverage radius plus ε. A specified interior grid has a smaller worst-case coverage radius than any boundary-only grid with the same number of references.
Read the complete supplied derivation
# H0199 — witness-patch layout: a complete minimax theorem
**Status:** the theorem below is proved under explicit assumptions. The original physical hypothesis is not proved. No mathematical originality or new physical discovery is claimed.
## Original claim and the bounded claim we can establish
The original claim says that interleaving inert reference patches estimates spatial deposition bias better than putting all references at the edge. That is not true for every field, noise model, or estimator.
Here is an exact replacement: for a field whose spatial variation is bounded by a known Lipschitz constant, the smallest achievable worst-case reconstruction error equals the coverage radius of the reference locations times that constant, plus the maximum measurement error. A particular nine-point interior layout has a strictly smaller worst-case error than any nine-point boundary-only layout on a square.
## Assumptions and definitions
Let Ω be a nonempty compact subset of Euclidean space, with distance d. Let S={s₁,…,sₙ} be fixed reference positions, n≥1. We observe
yᵢ = f(sᵢ) + ηᵢ, |ηᵢ| ≤ ε.
Assume f is L-Lipschitz: |f(x)−f(z)|≤L d(x,z), with L≥0. Noise is bounded adversarially; no independence or Gaussian assumption is made. Reference patches do not perturb f. Their readings have already been calibrated into the same units as f. We are reconstructing f, not yet separating chemical uptake from a physically altered deposition field.
Define distance to the reference set and its coverage radius:
d(x,S) = minᵢ d(x,sᵢ), h(S) = maxₓ∈Ω d(x,S).
For any reconstruction rule A mapping the vector y to a function on Ω, define
R(A,S) = sup over admissible f and η of maxₓ |A(y)(x)−f(x)|.
## Theorem 1
inf over all reconstruction rules A of R(A,S) = L h(S) + ε.
### Upper bound
At x, choose a nearest reference sⱼ and estimate f(x) by yⱼ. Then
|yⱼ−f(x)| ≤ |f(sⱼ)−f(x)|+|ηⱼ|
≤ L d(x,S)+ε ≤ Lh(S)+ε.
Thus an available estimator attains risk at most Lh(S)+ε.
### Matching lower bound
The distance function d(·,S) is 1-Lipschitz: the triangle inequality gives d(x,S)≤d(x,z)+d(z,S), and reversing x,z gives the absolute bound.
Choose any constant M and define
f₊(x)=M+ε+L d(x,S), f₋(x)=M−ε−L d(x,S).
Both functions are L-Lipschitz. At every reference they equal M+ε and M−ε respectively. With noise −ε for f₊ and +ε for f₋, both produce the identical observation vector y=(M,…,M).
Compactness provides x* attaining h(S). The two possible true values at x* differ by 2(ε+Lh(S)). Any estimate a based on the common observations must therefore satisfy
max(|a−f₊(x*)|, |a−f₋(x*)|) ≥ ε+Lh(S).
Otherwise the triangle inequality would make the separation smaller than 2(ε+Lh(S)), a contradiction. Consequently every reconstruction rule has worst-case error at least ε+Lh(S). Together with the upper bound this proves equality. If nonnegative deposition is required, choose M≥ε+Lh(S); both adversarial fields remain nonnegative. ∎
## Theorem 2: an explicit equal-count square comparison
Take Ω=[0,1]² and nine reference positions. For any boundary-only layout, the center (1/2,1/2) is at least 1/2 from every reference, so h(edge)≥1/2.
For a 3×3 interior grid with each coordinate in {1/6,1/2,5/6}, every coordinate is within 1/6 of a grid coordinate. Hence distance to the nearest grid point is at most √2/6. Square corners attain that distance, so h(grid)=√2/6 exactly.
Therefore
R*(grid)=L√2/6+ε,
R*(edge)≥L/2+ε.
For L>0, the grid has strictly smaller worst-case risk. For ε=0, its risk is at most √2/3≈0.4714 of the boundary-layout lower bound. This is a worst-case statement, not a 52.86% improvement on every physical deposition field. For L=0 the two minimax risks are both ε; strict superiority disappears. ∎
## What this does not prove
- It does not prove superiority on every individual field. For a constant noiseless field both layouts reconstruct exactly. A known affine field can be reconstructed from suitable boundary measurements as well.
- It does not compare all statistical estimators under independent random noise or an integrated mean-square objective.
- References have finite area in real devices. The proof treats calibrated point observations and ignores shadowing, adsorption, chemical perturbation, and footprint-dependent averaging.
- The supplied earlier polynomial simulation and this theorem use different estimators and function classes. One cannot use the theorem as a proof of that simulation's exact performance percentages.
## Physical result still needed
Establish the relevant field smoothness, verify nonperturbing references, measure their error, use equal reference count and area, and compare against independent full-field ground truth. See experiments/H0199.md. This is the bridge from the mathematical result to the original research claim.