High edge cost forces a strict entropy decrease
Lax263307.EntropyDecrease · concepts/Lax263307/EntropyDecrease.lean · lax-263307
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Let , , , and . For a positive integer , if the conditioned costs satisfy
then some vertex has and conditioning on decreases entropy by more than :
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax263307.ConditioningDistribution |
| 2 | import Lax263307.EntropyGap |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: High edge cost forces a strict entropy decrease |
| 7 | type: theorem |
| 8 | --- |
| 9 | Let , , , and . |
| 10 | For a positive integer , if the conditioned costs satisfy |
| 11 | |
| 12 | then some vertex has and conditioning on decreases entropy |
| 13 | by more than : |
| 14 | |
| 15 | |
| 16 | # Attribution |
| 17 | |
| 18 | Bonnet–Chang, proof of Lemma 12, the consequence of equation (18). |
| 19 | -/ |
| 20 | |
| 21 | namespace Lax263307.EntropyDecrease |
| 22 | |
| 23 | open LinearRelaxation ConditioningDistribution Entropy |
| 24 | |
| 25 | /-- An expensive edge product forces a positive-cost conditioning step. -/ |
| 26 | axiom exists_entropy_decrease {n : ℕ} (G : SimpleGraph (Fin n)) [DecidableRel G.Adj] |
| 27 | (k r p : ℕ) (y : MomentVector n r) (feasible : IsFeasible G k r y) |
| 28 | (A : Finset (Fin n)) (size : A.card < r) (positive : 0 < value y A) |
| 29 | (target_positive : 0 < k) (threshold_positive : 0 < p) |
| 30 | (expensive : (k : ℝ) ^ 2 / p < edgeCost G (conditioned y A)) : |
| 31 | ∃ v : Fin n, 0 < marginal y A k v ∧ |
| 32 | entropy (marginal y (insert v A) k) < entropy (marginal y A k) - 2 / p |
| 33 | |
| 34 | end Lax263307.EntropyDecrease |
| 35 |
Attribution
Bonnet–Chang, proof of Lemma 12, the consequence of equation (18).
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments