Download data/lean/OAI/Combinatorics/MatchingPSD/DiagonalCone.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.37 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/DiagonalCone.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/MatchingPSD/DiagonalCone.lean
-
curl -L -o DiagonalCone.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/DiagonalCone.lean
2.37 kB
| import Mathlib | |
| import OAI.Combinatorics.MatchingPSD.PSDCompression | |
| import OAI.Combinatorics.MatchingPSD.PSDTopology | |
| import OAI.Combinatorics.MatchingPSD.MatrixBounds | |
| namespace OAI | |
| namespace AffinePSD | |
| open Matrix Finset | |
| open scoped BigOperators | |
| variable {I R : Type*} [Fintype I] [Fintype R] [DecidableEq R] | |
| lemma evaluationCone_isClosed_of_diagonal (B : I β Matrix R R β) | |
| (hB : β i, (B i).PosSemidef) (d : R β β) | |
| (hs : β i, B i = diagonal d) : IsClosed (evaluationCone B) := by | |
| classical | |
| apply IsSeqClosed.isClosed | |
| intro u y hu hy | |
| choose A hA heA using hu | |
| have hc (k : β) := diagonal_compression B hB d hs (A k) (hA k) | |
| choose C hC heC hzC using hc | |
| have heval (k : β) : evaluation B (C k) = u k := (heC k).trans (heA k) | |
| have hsum : Filter.Tendsto (fun k => β i, u k i) Filter.atTop (nhds (β i, y i)) := | |
| tendsto_finsetSum _ (fun i _ => (tendsto_pi_nhds.mp hy) i) | |
| obtain β¨b, hbβ© := hsum.bddAbove_range | |
| have hbound (k : β) : β i, u k i β€ b := hb (Set.mem_range_self k) | |
| let a : β := β j, (d j)β»ΒΉ | |
| have ha : 0 β€ a := Finset.sum_nonneg (fun j _ => | |
| inv_nonneg.mpr (sum_diagonal_nonneg B hB d hs j)) | |
| have htr (k : β) : (C k).trace β€ a * b := by | |
| refine (diagonal_trace_bound B hB d hs (C k) (hC k) (hzC k)).trans ?_ | |
| rw [heval] | |
| exact mul_le_mul_of_nonneg_left (hbound k) ha | |
| let lo : R β R β β := fun _ _ => -(a * b) | |
| let hi : R β R β β := fun _ _ => a * b | |
| have hm (k : β) : C k β Set.Icc lo hi := by | |
| constructor <;> intro i j | |
| Β· exact (abs_le.mp ((PerfectMatchingPSD.posSemidef_entry_abs_le_trace (hC k) i j).trans | |
| (htr k))).1 | |
| Β· exact (abs_le.mp ((PerfectMatchingPSD.posSemidef_entry_abs_le_trace (hC k) i j).trans | |
| (htr k))).2 | |
| obtain β¨L, hL, Ο, hΟ, htβ© := IsCompact.tendsto_subseq (X := R β R β β) (isCompact_Icc : IsCompact (Set.Icc lo hi)) hm | |
| have hpsd : Matrix.PosSemidef L := psd_isClosed.mem_of_tendsto ht | |
| (Filter.Eventually.of_forall (fun k => hC (Ο k))) | |
| refine β¨L, hpsd, ?_β© | |
| have hlim := (evaluation_continuous B).continuousAt.tendsto.comp ht | |
| have hlim' := hy.comp hΟ.tendsto_atTop | |
| have hEq : evaluation B β (C β Ο) = u β Ο := by ext k i; exact congrFun (heval (Ο k)) i | |
| have hlim := hlim.congr (fun k => congrFun hEq k) | |
| exact tendsto_nhds_unique hlim hlim' | |
| end AffinePSD | |
| end OAI | |