Download data/lean/OAI/Combinatorics/MatchingPSD/PSDCompression.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.12 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/PSDCompression.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/MatchingPSD/PSDCompression.lean
-
curl -L -o PSDCompression.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/PSDCompression.lean
4.12 kB
| import Mathlib | |
| import OAI.Combinatorics.MatchingPSD.PSDEvaluation | |
| namespace OAI | |
| namespace AffinePSD | |
| open Matrix Finset | |
| open scoped BigOperators | |
| variable {I R : Type*} [Fintype I] [Fintype R] [DecidableEq R] | |
| lemma zero_col_of_diag_zero {A : Matrix R R β} (hA : A.PosSemidef) | |
| (i : R) (hi : A i i = 0) (j : R) : A j i = 0 := by | |
| have h := (hA.dotProduct_mulVec_zero_iff (x := Pi.single i 1)).mp (by simpa using hi) | |
| simpa using congrFun h j | |
| lemma zero_row_of_diag_zero {A : Matrix R R β} (hA : A.PosSemidef) | |
| (i : R) (hi : A i i = 0) (j : R) : A i j = 0 := by | |
| have hs : A i j = A j i := by | |
| simpa using congrArg (fun M : Matrix R R β => M j i) hA.isHermitian.eq | |
| rw [hs] | |
| exact zero_col_of_diag_zero hA i hi j | |
| lemma diagonal_compression (B : I β Matrix R R β) (hB : β i, (B i).PosSemidef) | |
| (d : R β β) (hs : β i, B i = diagonal d) (A : Matrix R R β) | |
| (hA : A.PosSemidef) : | |
| β A' : Matrix R R β, A'.PosSemidef β§ evaluation B A' = evaluation B A β§ | |
| (β j, d j = 0 β A' j j = 0) := by | |
| classical | |
| let p : R β β := fun j => if d j = 0 then 0 else 1 | |
| let P := diagonal p | |
| have hdiag (i : I) (j : R) (hj : d j = 0) : B i j j = 0 := by | |
| have hle : B i j j β€ β k, B k j j := | |
| Finset.single_le_sum (fun k _ => (hB k).diag_nonneg) (Finset.mem_univ i) | |
| have he : β k, B k j j = d j := by | |
| simpa only [Matrix.sum_apply, Matrix.diagonal_apply_eq] using | |
| congrArg (fun M : Matrix R R β => M j j) hs | |
| have hn := (hB i).diag_nonneg (i := j) | |
| rw [he, hj] at hle | |
| exact le_antisymm hle hn | |
| have hpB (i : I) : P * B i = B i := by | |
| ext j k | |
| simp only [P, Matrix.diagonal_mul, p] | |
| split_ifs with hj | |
| Β· simp [zero_row_of_diag_zero (hB i) j (hdiag i j hj) k] | |
| Β· simp | |
| have hBp (i : I) : B i * P = B i := by | |
| ext j k | |
| simp only [P, Matrix.mul_diagonal, p] | |
| split_ifs with hk | |
| Β· simp [zero_col_of_diag_zero (hB i) k (hdiag i k hk) j] | |
| Β· simp | |
| refine β¨P * A * P, ?_, ?_, ?_β© | |
| Β· simpa only [Matrix.conjTranspose_eq_transpose_of_trivial, P, Matrix.diagonal_transpose] | |
| using hA.conjTranspose_mul_mul_same P | |
| Β· ext i | |
| change (P * A * P * B i).trace = (A * B i).trace | |
| rw [Matrix.mul_assoc P A P, Matrix.mul_assoc P (A * P) (B i), | |
| Matrix.trace_mul_comm P, Matrix.mul_assoc A P (B i), hpB, | |
| Matrix.mul_assoc A (B i) P, hBp] | |
| Β· intro j hj | |
| simp [P, Matrix.mul_diagonal, Matrix.diagonal_mul, p, hj] | |
| omit [Fintype R] in | |
| lemma sum_diagonal_nonneg (B : I β Matrix R R β) (hB : β i, (B i).PosSemidef) | |
| (d : R β β) (hs : β i, B i = diagonal d) : β j, 0 β€ d j := by | |
| intro j | |
| have he : β i, B i j j = d j := by | |
| simpa only [Matrix.sum_apply, Matrix.diagonal_apply_eq] using | |
| congrArg (fun M : Matrix R R β => M j j) hs | |
| rw [β he] | |
| exact Finset.sum_nonneg (fun i _ => (hB i).diag_nonneg) | |
| lemma evaluation_sum_eq (B : I β Matrix R R β) (d : R β β) | |
| (hs : β i, B i = diagonal d) (A : Matrix R R β) : | |
| β i, evaluation B A i = β j, A j j * d j := by | |
| simp only [evaluation_apply] | |
| rw [β Matrix.trace_sum, β Matrix.mul_sum, hs] | |
| simp [Matrix.trace, Matrix.diag, Matrix.mul_diagonal] | |
| lemma diagonal_trace_bound (B : I β Matrix R R β) (hB : β i, (B i).PosSemidef) | |
| (d : R β β) (hs : β i, B i = diagonal d) (A : Matrix R R β) | |
| (hA : A.PosSemidef) (hz : β j, d j = 0 β A j j = 0) : | |
| A.trace β€ (β j, (d j)β»ΒΉ) * β i, evaluation B A i := by | |
| have hd := sum_diagonal_nonneg B hB d hs | |
| have he := evaluation_sum_eq B d hs A | |
| rw [he] | |
| change (β j, A j j) β€ _ | |
| rw [Finset.sum_mul] | |
| apply Finset.sum_le_sum | |
| intro j _ | |
| by_cases hj : d j = 0 | |
| Β· simp [hj, hz j hj] | |
| Β· have hp : 0 < d j := lt_of_le_of_ne (hd j) (Ne.symm hj) | |
| have hle : A j j * d j β€ β k, A k k * d k := | |
| Finset.single_le_sum (fun k _ => mul_nonneg (hA.diag_nonneg (i := k)) (hd k)) (Finset.mem_univ j) | |
| calc | |
| A j j = (d j)β»ΒΉ * (A j j * d j) := by field_simp | |
| _ β€ (d j)β»ΒΉ * β k, A k k * d k := mul_le_mul_of_nonneg_left hle (inv_nonneg.mpr hp.le) | |
| end AffinePSD | |
| end OAI | |