`forcedCriticalRecognitionLoading_certificate`

proved

show as: view math explainer →

module: IndisputableMonolith.Unification.CriticalRecognitionLoading
domain: Unification
line: 226 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Unification.CriticalRecognitionLoading on GitHub at line 226.

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

formal source

 223  · exact pulse_divides_supervisory
 224  · exact loadPenalty_zero_of_critical h.1
 225
 226theorem forcedCriticalRecognitionLoading_certificate
 227    {s : ControllerState}
 228    (h : IsForcedCriticalRecognitionLoading s) :
 229    IsSubcritical s.area s.demand ∧
 230      s.attention ≤ phi ^ (3 : ℕ) ∧
 231      phi ^ (45 : ℕ) ≤ s.z ∧
 232      pulseTicks ∣ supervisoryTicks ∧
 233      loadPenalty rhoCriticalMin s.area s.demand = 0 := by
 234  exact criticalRecognitionLoading_certificate h
 235
 236end
 237end CriticalRecognitionLoading
 238end Unification
 239end IndisputableMonolith

papers checked against this theorem

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