`grayCycle3`

definition

show as: view math explainer →

module: IndisputableMonolith.Patterns.GrayCycle
domain: Patterns
line: 203 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Patterns.GrayCycle on GitHub at line 203.

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

 200      fin_cases k <;> simp [grayCycle3Path, gray8At, pattern3] at hk ⊢
 201
 202/-- A rigorous Gray cycle for 3-bit patterns (the “8-tick” cycle). -/
 203def grayCycle3 : GrayCycle 3 :=
 204{ path := grayCycle3Path
 205, inj := grayCycle3_injective
 206, oneBit_step := grayCycle3_oneBit_step
 207}
 208
 209theorem grayCycle3_period : (2 ^ 3) = 8 := by decide
 210
 211/-- The 3-bit Gray cycle can be viewed as a GrayCover of period 8. -/
 212def grayCover3 : GrayCover 3 8 :=
 213{ path := grayCycle3Path
 214, complete := grayCycle3_surjective
 215, oneBit_step := grayCycle3_oneBit_step
 216}
 217
 218end Patterns
 219end IndisputableMonolith

papers checked against this theorem

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