recognition / Patterns / Patterns.TwoToTheDMinusOne / countLawCert

def

`countLawCert`

definition

show as: view math explainer →

module: IndisputableMonolith.Patterns.TwoToTheDMinusOne
domain: Patterns
line: 193 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.Patterns.TwoToTheDMinusOne on GitHub at line 193.

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

Count Law at D=3 · foundational / THEOREM
Counting laws on the 3-cube reproduce the standard combinatorial bounds

depends on

formal source

 190    Fintype.card BookerPlotFamily = 7
 191
 192/-- The master certificate is inhabited. -/
 193def countLawCert : CountLawCert where
 194  card_law := countLaw_implies_card
 195  no_extra := countLaw_implies_no_extra
 196  booker_instance := bookerCountLaw
 197  booker_card_via_law := booker_count_via_law
 198
 199end
 200
 201end TwoToTheDMinusOne
 202end Patterns
 203end IndisputableMonolith

papers checked against this theorem

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