`complexityClassCount`

proved

show as: view math explainer →

module: IndisputableMonolith.Mathematics.P_vs_NP_From_RS
domain: Mathematics
line: 39 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Mathematics.P_vs_NP_From_RS on GitHub at line 39.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

  36  | P | NP | coNP | PSPACE | EXPTIME
  37  deriving DecidableEq, Repr, BEq, Fintype
  38
  39theorem complexityClassCount : Fintype.card ComplexityClass = 5 := by decide
  40
  41/-- P ⊆ NP (structural). -/
  42-- Note: proving P ≠ NP requires Clay-level work, not doable here.
  43-- We just formalise the structural 5-class taxonomy.
  44
  45structure PvsNPStructuralCert where
  46  five_classes : Fintype.card ComplexityClass = 5
  47  budget : recognitionBudget = 360
  48  factored : recognitionBudget = 8 * 45
  49
  50def pvsNPStructuralCert : PvsNPStructuralCert where
  51  five_classes := complexityClassCount
  52  budget := budget_eq_360
  53  factored := rfl
  54
  55end IndisputableMonolith.Mathematics.P_vs_NP_From_RS

papers checked against this theorem

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