Window-Localized Probes and Observational Capacity of Finite Truth Spaces
Authors/Creators
- 1. Independent Researcher
- 2. Hankuk Academy of Foreign Studies
Description
We study finite Boolean truth spaces S ⊆ {0, 1}ⁿ through the two-sorted ordered structure
Mₙ(S) = (S, [n]; <, Bit),
where Bit(x, i) records the ith coordinate of x. The probes considered here are localized on the index sort: their parameters choose a subset P ⊆ [n] that is a union of at most k intervals, and length-ℓ local configurations are inspected only at positions where the full ℓ-block lies inside P. The relevant compressed parameter is the ℓ-block footprint
Eℓ(P) = {i ∈ [n − ℓ + 1] : {i, i + 1, . . . , i + ℓ − 1} ⊆ P}.
Our main result is a footprint-compression theorem. For every footprint-factorized k-window-localized length-ℓ probe family, the number of distinct traces on any truth space S is bounded by the ambient footprint count
Bₙ,ₖ,ℓ = ∑ᵏᵣ₌₀ (n − ℓ + 2 choose 2r).
Equivalently, the observational repertoire of such a probe family is controlled by an index-side interval-counting quantity, independently of |S| and of the internal combinatorics of S. We also identify the actual footprint image as the class of ℓ-separated interval unions on the footprint line. This gives immediate capacity and VC-dimension ceilings. We then compute exact splitting reductions for two canonical truth spaces: the even-parity space and prefix block-subcubes. For single-block run/alternation probes and gap-bounded two-run probes, splitting is reduced to explicit footprint events, with the block-subcube case adding the requirement that witnesses lie inside the free coordinate region. Finally, we define a normalized probe-relative diagnostic combining splitting frequency under a specified sampler with capacity utilization relative to a valid trace ceiling. This diagnostic is not an intrinsic invariant of a truth space; it is a reporting statistic for comparing truth spaces under a fixed localized probing regime.