`Configuration`

definition

show as: view math explainer →

module: IndisputableMonolith.Foundation.RecognitionForcing
domain: Foundation
line: 111 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Foundation.RecognitionForcing on GitHub at line 111.

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

 108
 109/-! ## Part 2: Cost Minima = Recognition -/
 110
 111structure Configuration where
 112  value : ℝ
 113  pos : 0 < value
 114
 115def config_to_recognition (c : Configuration) : LedgerForcing.RecognitionEvent :=
 116  { source := 0, target := 0, ratio := c.value, ratio_pos := c.pos }
 117
 118theorem cost_minima_are_recognition (c : Configuration) :
 119    ∃ (e : LedgerForcing.RecognitionEvent), e.ratio = c.value :=
 120  ⟨config_to_recognition c, rfl⟩
 121
 122theorem global_minimum_is_self_recognition :
 123    ∃ (e : LedgerForcing.RecognitionEvent), e.ratio = 1 ∧ recognition_cost e = 0 := by
 124  use { source := 0, target := 0, ratio := 1, ratio_pos := one_pos }
 125  simp only [recognition_cost, LedgerForcing.J]
 126  norm_num
 127
 128/-! ## Part 3: Stability = Recognition -/
 129
 130structure JStableStructure where
 131  carrier : Type
 132  cost : carrier → ℝ
 133  cost_bounded : ∃ m : ℝ, ∀ x, m ≤ cost x
 134
 135structure RecognitionLikeStructure where
 136  carrier : Type
 137  rel : carrier → carrier → Prop
 138  refl : ∀ x, rel x x
 139  symm : ∀ x y, rel x y → rel y x
 140
 141def stable_to_recognition (S : JStableStructure) : RecognitionLikeStructure := {

papers checked against this theorem

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