op75_subset
def
A real target belongs to the subset sums of a list when it can be obtained recursively by either omitting or including the first weight.
Statement
def op75_subset : List ℝ → ℝ → Prop
- Source
- OP-75, arXiv:2610.06092, one-pass subset-sum construction; a helper toward interval verification.
- Verified
- 15 Nov 2026
- Axioms
- none listed
- Used by 5
- op75_compact_network_subset_sumFor any finite list of nonnegative integer weights and nonnegative integer target, the explicitly constructed width-three ReLU network has…
- op75_invalid_input_fallback_nonmemberThe encoding of the empty-weight target-one network is a no-instance of the width-three unit-interval zero language.
- op75_compact_subset_equivalenceFor any list of real weights and real target, the compact-map orbit ends at zero with accumulated digit-weighted sum equal to the target…
- op75_subset_compiler_semanticsAny total binary function that maps canonical subset-sum instances to their specified networks and maps malformed inputs outside the zero…
- op75_subset_languageThe language of canonical binary words encoding a finite list of nonnegative integer weights and a target that is a subset sum of the list.
Lean source view module on GitHub
def op75_subset : List ℝ → ℝ → Prop | [], t => t = 0 | a :: as, t => op75_subset as t ∨ op75_subset as (t-a)