`patternsCovered`

definition

show as: view math explainer →

module: IndisputableMonolith.CrossDomain.MetaTheoremCount
domain: CrossDomain
line: 62 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.CrossDomain.MetaTheoremCount on GitHub at line 62.

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

used by

formal source

  59  refine ⟨?_, ?_⟩ <;> decide
  60
  61/-- Five "universality" patterns covered: D=5, 2³=8, J=0, φ-ladder, gap45. -/
  62def patternsCovered : ℕ := 5
  63
  64theorem patterns_match_D : patternsCovered = 5 := rfl
  65
  66/-- Each pattern produces multiple cross-domain modules. Average: 27/5 = 5.4. -/
  67theorem average_per_pattern :
  68    crossDomainModuleCount * 10 = 270 := by decide  -- 27 = 27 = 5.4 × 5
  69
  70structure MetaTheoremCountCert where
  71  count : crossDomainModuleCount = 27
  72  count_is_cube : crossDomainModuleCount = 3^3
  73  patterns_covered : patternsCovered = 5
  74  count_in_spectrum_range :
  75    25 ≤ crossDomainModuleCount ∧ crossDomainModuleCount ≤ 45
  76
  77def metaTheoremCountCert : MetaTheoremCountCert where
  78  count := count_eq
  79  count_is_cube := count_is_D_cubed
  80  patterns_covered := patterns_match_D
  81  count_in_spectrum_range := count_in_spectrum
  82
  83end IndisputableMonolith.CrossDomain.MetaTheoremCount

papers checked against this theorem

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