IndisputableMonolith.Complexity.NonNaturalness
The NonNaturalness module defines the false-point fraction for Boolean functions as an analog to landscape depth in the J-cost setting, along with properties classifying naturalness and depth. It equips the Recognition Science treatment of complexity to separate natural from non-natural behaviors without CNF mediation. Researchers resolving P vs NP via topological obstructions would cite these objects. The module consists of definitions and elementary fraction bounds with no deep proofs.
claimFor a Boolean function $f : (Fin n) → Bool$, the false-point fraction is $|f^{-1}(false)| / 2^n$. This quantity equals the landscape depth of the canonical full-width CNF encoding of $f$. Related predicates include IsNatural, IsConstructive, IsUseful, IsLarge, and HighDepthProp on such functions.
background
The module operates inside the Recognition Science complexity framework. It imports the J-cost Laplacian on the Boolean hypercube, whose edges carry weights |satJCost(φ, a) − satJCost(φ, a′)| for Hamming-distance-1 assignments. It further relies on J-frustration, which quantifies the topological depth of the J-cost barrier around a formula’s satisfying region, and on the R̂ SAT encoding that supplies a non-natural polytime certifier for satisfiable k-CNF instances. Constants are taken from the RS-native time quantum τ₀ = 1 tick.
proof idea
This is a definition module, no proofs.
why it matters in Recognition Science
The module supplies the non-naturalness vocabulary that feeds the P vs NP Assembly. In particular it supports the step that J-frustration is non-natural (Phase 2 of the conditional P ≠ NP path), allowing the RR barrier to be bypassed and linking to the topological obstruction results in RSatEncoding. It also populates the Core.Complexity interface.
scope and limits
- Does not prove any P vs NP statement outright.
- Does not compute J-cost or frustration for concrete formulas.
- Does not treat quantum or circuit-size measures directly.
- Limits attention to classical Boolean functions on finite domains.
used by (2)
depends on (4)
declarations in this module (16)
-
def
FalsePointFraction -
theorem
falsePointFraction_nonneg -
theorem
falsePointFraction_le_one -
theorem
const_true_zero_fraction -
theorem
const_false_full_fraction -
def
ComplexityProperty -
structure
IsLarge -
structure
IsConstructive -
structure
IsUseful -
structure
IsNatural -
def
HighDepthProp -
theorem
high_depth_empty -
theorem
high_depth_not_large -
theorem
jfrust_not_natural -
structure
NonNaturalnessCert -
def
nonNaturalnessCert