The finite uniform raw-vertex law
Lax342547.RawLaw · concepts/Lax342547/RawLaw.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
A raw vertex chooses one valid frame in every component. The reference law is uniform on this finite product. Counting all matrix quadruples gives , the bound behind (2.14).
Concept map
Evidence
Lean source view on GitHub
| 1 | import Lax342547.RawFrames |
| 2 | import Mathlib.Probability.Distributions.Uniform |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: The finite uniform raw-vertex law |
| 7 | type: lemma |
| 8 | --- |
| 9 | A raw vertex chooses one valid frame in every component. The reference |
| 10 | law is uniform on this finite product. Counting all matrix quadruples |
| 11 | gives , the bound behind (2.14). |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax342547.RawLaw |
| 15 | |
| 16 | open Lax342547.MomentSpace Lax342547.RawFrames |
| 17 | |
| 18 | variable {B H N Comp : Type} [Fintype B] [Fintype H] [Fintype N] [Fintype Comp] |
| 19 | variable [DecidableEq Comp] |
| 20 | |
| 21 | noncomputable def uniformLaw (E : Matrix B B Binary) [Nonempty (Frame B H N E)] : |
| 22 | PMF (Comp → Frame B H N E) := PMF.uniformOfFintype _ |
| 23 | |
| 24 | axiom raw_card_bound (E : Matrix B B Binary) : |
| 25 | Fintype.card (Comp → Frame B H N E) ≤ |
| 26 | 2 ^ (2 * Fintype.card Comp * Fintype.card N * (Fintype.card B + Fintype.card H)) |
| 27 | |
| 28 | axiom uniformLaw_product (E : Matrix B B Binary) [Nonempty (Frame B H N E)] |
| 29 | (o : Comp → Frame B H N E) : |
| 30 | uniformLaw E o = ∏ e, PMF.uniformOfFintype (Frame B H N E) (o e) |
| 31 | |
| 32 | end Lax342547.RawLaw |
| 33 |
Builds on
From Mathlib
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments