Joint distributions for the entropy-decrease argument
Lax263307.ConditioningDistribution · concepts/Lax263307/ConditioningDistribution.lean · lax-263307
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For , , , and , set
The vector is a probability distribution. The entries of are nonnegative and symmetric, with both marginals equal to , and whenever is an edge. For , the distribution after conditioning on is given by .
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax263307.ConditionedCosts |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Joint distributions for the entropy-decrease argument |
| 6 | type: theorem |
| 7 | --- |
| 8 | For , , , and , set |
| 9 | |
| 10 | |
| 11 | The vector is a probability distribution. The entries of are |
| 12 | nonnegative and symmetric, with both marginals equal to , and |
| 13 | whenever is an edge. For , the distribution after conditioning |
| 14 | on is given by . |
| 15 | |
| 16 | # Attribution |
| 17 | |
| 18 | Bonnet–Chang, proof of Lemma 12, equations (15) and (16). |
| 19 | -/ |
| 20 | |
| 21 | namespace Lax263307.ConditioningDistribution |
| 22 | |
| 23 | open LinearRelaxation |
| 24 | |
| 25 | /-- Normalize conditioned vertex costs to a probability vector. -/ |
| 26 | noncomputable def marginal {n r : ℕ} (y : MomentVector n r) |
| 27 | (A : Finset (Fin n)) (k : ℕ) (v : Fin n) : ℝ := |
| 28 | conditioned y A v / k |
| 29 | |
| 30 | /-- The joint distribution obtained from moments containing two extra vertices. -/ |
| 31 | noncomputable def joint {n r : ℕ} (y : MomentVector n r) |
| 32 | (A : Finset (Fin n)) (k : ℕ) (u v : Fin n) : ℝ := |
| 33 | value y (insert u (insert v A)) / ((k : ℝ) ^ 2 * value y A) |
| 34 | |
| 35 | /-- The probability and conditional-probability identities for the moment relaxation. -/ |
| 36 | axiom distribution_identities {n : ℕ} (G : SimpleGraph (Fin n)) (k r : ℕ) |
| 37 | (y : MomentVector n r) (feasible : IsFeasible G k r y) |
| 38 | (A : Finset (Fin n)) (size : A.card < r) (positive : 0 < value y A) |
| 39 | (target_positive : 0 < k) : |
| 40 | (∀ v, 0 ≤ marginal y A k v) ∧ |
| 41 | (∑ v : Fin n, marginal y A k v) = 1 ∧ |
| 42 | (∀ u v, 0 ≤ joint y A k u v) ∧ |
| 43 | (∀ u v, joint y A k u v = joint y A k v u) ∧ |
| 44 | (∀ v, (∑ u : Fin n, joint y A k u v) = marginal y A k v) ∧ |
| 45 | (∀ u v, G.Adj u v → joint y A k u v = 0) ∧ |
| 46 | (∀ u v, 0 < marginal y A k v → |
| 47 | marginal y (insert v A) k u = joint y A k u v / marginal y A k v) |
| 48 | |
| 49 | end Lax263307.ConditioningDistribution |
| 50 |
Attribution
Bonnet–Chang, proof of Lemma 12, equations (15) and (16).
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments