`posting_gives_unit_recurrence`

proved

show as: view math explainer →

module: IndisputableMonolith.Foundation.PostingExtensivity
domain: Foundation
line: 188 · github
papers citing: none yet

open explainer

Read the cached plain-language explainer.

open lean source

IndisputableMonolith.Foundation.PostingExtensivity on GitHub at line 188.

browse module

All declarations in this module, on Recognition.

explainer page

A cached Ask Recognition explainer exists for this declaration.

open explainer

depends on

formal source

 185we provide the recurrence data directly from posting extensivity. -/
 186
 187/-- The additive closure gives recurrence coefficients (1, 1). -/
 188theorem posting_gives_unit_recurrence
 189    (L : UniformScaleLadder)
 190    (closure : L.levels 2 = L.levels 1 + L.levels 0) :
 191    L.levels 2 = (1 : ℝ) * L.levels 1 + (1 : ℝ) * L.levels 0 := by
 192  simp only [one_mul]; exact closure
 193
 194/-- The unit pair (1, 1) is minimal: max(1, 1) = 1. -/
 195theorem posting_coefficients_minimal : max 1 1 = 1 := by simp
 196
 197end PostingExtensivity
 198end Foundation
 199end IndisputableMonolith

papers checked against this theorem

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