Count Law at D=3

1. Setting

Count Law at D=3 is anchored in Patterns.TwoToTheDMinusOne. The page is not a loose explainer: it is a public map from the Recognition Science forcing chain into one Lean-checked declaration bundle. The primary anchor determines what is proved, and the surrounding declarations show how the result is used.

2. Equations

(E1)

$$ J(xy)+J(x/y)=2J(x)J(y)+2J(x)+2J(y) $$

Recognition Composition Law.

3. Prediction or structural target

• Structural target: Patterns.TwoToTheDMinusOne must keep resolving in the Lean canon, and all downstream pages that cite this anchor must continue to type-check.

This page is currently a structural derivation. Where the claim has direct empirical content, the prediction table gives the measurable target; otherwise the claim is a formal bridge inside the Lean canon.

4. Formal anchor

The primary anchor is Patterns.TwoToTheDMinusOne..countLaw_implies_card.

    cardinality exactly `2 ^ D - 1`. -/
theorem countLaw_implies_card {D : ℕ} {Family : Type} [Fintype Family]
    {encoding : Family → F2Power D} (hL : CountLaw D Family encoding) :
    Fintype.card Family = 2 ^ D - 1 := by
  have himage : Finset.univ.image encoding =
      Finset.univ.filter (fun v : F2Power D => v ≠ 0) := by
    apply Finset.Subset.antisymm
    · intro v hv
      rcases Finset.mem_image.mp hv with ⟨x, _, hx⟩
      rw [Finset.mem_filter, ← hx]

5. What is inside the Lean module

Key theorems:

• countLaw_implies_card
• countLaw_implies_no_extra
• bookerCountLaw
• booker_count_via_law

Key definitions:

• CountLaw
• OpponentColorCountLaw
• MassiveBosonCountLaw
• CountLawCert
• countLawCert

6. Derivation chain

• countLaw_implies_card - Count law implies card
• bookerCountLaw - Booker count law
• countLawCert - Count law cert

7. Falsifier

A Lean-checkable counterexample to the named theorem or to the upstream functional equation refutes this derivation.

8. Where this derivation stops

Below this page the chain reduces to the RS forcing sequence: J-cost uniqueness, phi forcing, the eight-tick cycle, and the D=3 recognition substrate. If any upstream theorem changes, this page must be versioned rather than patched silently. The published URL is stable, but the version field is the contract.

9. Reading note

The minimal way to audit this page is to open the first Lean anchor and then walk the supporting declarations listed above. If the primary theorem is a module-level anchor, the key theorems section names the internal declarations that carry the mathematical load. This keeps the public derivation readable without severing it from the proof object.

10. Audit path

To audit count-law-d3, start with the primary Lean anchor Patterns.TwoToTheDMinusOne.countLaw_implies_card. Then inspect the theorem names listed in the module-content section. The page is intentionally built so the public explanation is not a substitute for the proof object; it is a map into it. The mathematical dependency is the same in every case: reciprocal cost fixes J, J fixes the phi-ladder, the eight-tick cycle fixes the recognition clock, and the domain theorem listed above supplies the last step. If that last step is empirical, the falsifier section names what observation would break it. If that last step is formal, a Lean-checkable counterexample is the relevant failure mode.