recognition / Patterns / Patterns.GrayCycle / grayCycle3_period

theorem

`grayCycle3_period`

proved

show as: view math explainer →

module: IndisputableMonolith.Patterns.GrayCycle
domain: Patterns
line: 209 · 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 209.

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.

Derivations using this theorem

The Gray Cycle Realizes the 8-Tick Cycle · foundational / THEOREM
A 3-bit Gray code with single-bit transitions gives the minimal recognition cycle

depends on

formal source

 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.