recognition / Complexity / Complexity.NonNaturalness / nonNaturalnessCert

def

`nonNaturalnessCert`

definition

show as: view math explainer →

module: IndisputableMonolith.Complexity.NonNaturalness
domain: Complexity
line: 158 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Complexity.NonNaturalness on GitHub at line 158.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

depends on

used by

pvsNPMasterCert IndisputableMonolith.Complexity.PvsNPAssembly

formal source

 155    IsUseful (HighDepthProp tau) →
 156    IsNatural (HighDepthProp tau) → False
 157
 158def nonNaturalnessCert : NonNaturalnessCert where
 159  const_true_zero := const_true_zero_fraction
 160  fraction_le_one := fun n f => falsePointFraction_le_one f
 161  barrier_bypass := jfrust_not_natural
 162
 163end -- noncomputable section
 164
 165end NonNaturalness
 166end Complexity
 167end IndisputableMonolith

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.