Download data/lean/OAI/Combinatorics/MatchingPSD/IncidenceKernels.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 7.26 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/IncidenceKernels.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/MatchingPSD/IncidenceKernels.lean
-
curl -L -o IncidenceKernels.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/MatchingPSD/IncidenceKernels.lean
7.26 kB
| import OAI.Combinatorics.MatchingPSD.TableMoments | |
| namespace OAI | |
| universe u_1 u_2 u_3 u_4 u_5 u_6 | |
| namespace MatchingSmoothing | |
| open Matrix | |
| section FiniteSums | |
| variable {G : Type u_1} {X : Type u_2} [Fintype G] [Group G] [Fintype X] [MulAction G X] | |
| omit [Fintype G] in | |
| lemma sum_smul_eq (g : G) (f : X β β) : β x, f (g β’ x) = β x, f x := | |
| Equiv.sum_comp (MulAction.toPerm g) f | |
| omit [Fintype X] in | |
| lemma sum_group_smul_eq (xβ : X) (ht : β x, β g : G, g β’ xβ = x) | |
| (f : X β β) (x : X) : β g : G, f (g β’ x) = β g : G, f (g β’ xβ) := by | |
| obtain β¨h, rflβ© := ht x | |
| simp_rw [β mul_smul] | |
| exact Equiv.sum_comp (Equiv.mulRight h) (fun g => f (g β’ xβ)) | |
| lemma group_smul_sum_card (xβ : X) (ht : β x, β g : G, g β’ xβ = x) | |
| (f : X β β) : | |
| (Fintype.card G : β) * β x, f x = | |
| (Fintype.card X : β) * β g : G, f (g β’ xβ) := by | |
| calc | |
| _ = β g : G, β x, f (g β’ x) := by simp only [sum_smul_eq, Finset.sum_const, | |
| Finset.card_univ, nsmul_eq_mul] | |
| _ = β x, β g : G, f (g β’ x) := Finset.sum_comm | |
| _ = _ := by simp_rw [sum_group_smul_eq xβ ht, Finset.sum_const, | |
| Finset.card_univ, nsmul_eq_mul] | |
| omit [Fintype G] in | |
| lemma invariant_kernel_sum (xβ : X) (ht : β x, β g : G, g β’ xβ = x) | |
| (K : X β X β β) (hK : β (g : G) x y, K (g β’ x) (g β’ y) = K x y) : | |
| (β x, β y, K x y) = (Fintype.card X : β) * β y, K xβ y := by | |
| have he (x : X) : β y, K x y = β y, K xβ y := by | |
| obtain β¨g, rflβ© := ht x | |
| rw [β sum_smul_eq g (fun y => K (g β’ xβ) y)] | |
| simp_rw [hK] | |
| simp_rw [he, Finset.sum_const, Finset.card_univ, nsmul_eq_mul] | |
| lemma invariant_kernel_double_sum_group (xβ : X) | |
| (ht : β x, β g : G, g β’ xβ = x) | |
| (K : X β X β β) (hK : β (g : G) x y, K (g β’ x) (g β’ y) = K x y) : | |
| (Fintype.card G : β) * (β x, β y, K x y) = | |
| (Fintype.card X : β) ^ 2 * β g : G, K xβ (g β’ xβ) := by | |
| rw [invariant_kernel_sum xβ ht K hK] | |
| have h := group_smul_sum_card xβ ht (K xβ) | |
| nlinarith [h] | |
| end FiniteSums | |
| section KernelTrace | |
| variable {G : Type u_3} {X : Type u_4} [Fintype G] [Group G] [Fintype X] [DecidableEq X] | |
| [MulAction G X] | |
| omit [DecidableEq X] in | |
| lemma trace_normalized_kernel_sq (K : Matrix X X β) (hs : β x y, K x y = K y x) : | |
| Matrix.trace ((Matrix.of fun x y => K x y / Fintype.card X) * | |
| (Matrix.of fun x y => K x y / Fintype.card X)) = | |
| (β x, β y, K x y ^ 2) / (Fintype.card X : β) ^ 2 := by | |
| simp only [Matrix.trace, Matrix.diag, Matrix.mul_apply, Matrix.of_apply, Finset.sum_div] | |
| apply Finset.sum_congr rfl | |
| intro x _ | |
| apply Finset.sum_congr rfl | |
| intro y _ | |
| rw [hs y x] | |
| ring | |
| omit [DecidableEq X] in | |
| lemma trace_normalized_invariant_kernel_sq (xβ : X) | |
| (ht : β x, β g : G, g β’ xβ = x) | |
| (K : Matrix X X β) (hs : β x y, K x y = K y x) | |
| (hi : β (g : G) x y, K (g β’ x) (g β’ y) = K x y) : | |
| Matrix.trace ((Matrix.of fun x y => K x y / Fintype.card X) * | |
| (Matrix.of fun x y => K x y / Fintype.card X)) = | |
| (β g : G, K xβ (g β’ xβ) ^ 2) / (Fintype.card G : β) := by | |
| have : Nonempty X := β¨xββ© | |
| rw [trace_normalized_kernel_sq K hs] | |
| have h := invariant_kernel_double_sum_group xβ ht | |
| (fun x y => K x y ^ 2) (fun g x y => congrArg (fun a : β => a ^ 2) (hi g x y)) | |
| have hx : (Fintype.card X : β) β 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero | |
| have hg : (Fintype.card G : β) β 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero | |
| apply (div_eq_div_iff (pow_ne_zero _ hx) hg).mpr | |
| nlinarith [h] | |
| end KernelTrace | |
| section Incidence | |
| variable {X : Type u_5} {Z : Type u_6} [Fintype X] [Fintype Z] [DecidableEq X] [DecidableEq Z] | |
| noncomputable def incidence (P : X β Z β Prop) : Matrix Z X β := | |
| by classical exact fun z x => if P x z then 1 else 0 | |
| noncomputable def commonIncidence (P : X β Z β Prop) (x y : X) : β := | |
| by classical exact (Fintype.card {z // P x z β§ P y z} : β) | |
| omit [Fintype X] [DecidableEq X] [DecidableEq Z] in | |
| lemma commonIncidence_eq (P : X β Z β Prop) (x y : X) : | |
| commonIncidence P x y = β z, incidence P z x * incidence P z y := by | |
| classical | |
| simp only [commonIncidence, Fintype.card_subtype, Finset.card_filter, Nat.cast_sum] | |
| apply Finset.sum_congr rfl | |
| intro z _ | |
| by_cases hx : P x z <;> by_cases hy : P y z <;> simp [incidence, hx, hy] | |
| omit [Fintype X] [DecidableEq X] [DecidableEq Z] in | |
| lemma commonIncidence_symm (P : X β Z β Prop) (x y : X) : | |
| commonIncidence P x y = commonIncidence P y x := by | |
| simp only [commonIncidence_eq, mul_comm] | |
| noncomputable def incidenceKernel (P : X β Z β Prop) (D : β) : Matrix X X β := | |
| fun x y => (Fintype.card Z : β) / D ^ 2 * commonIncidence P x y | |
| noncomputable def incidenceOperator (P : X β Z β Prop) (D : β) : Matrix X X β := | |
| fun x y => incidenceKernel P D x y / Fintype.card X | |
| omit [Fintype X] [DecidableEq X] [DecidableEq Z] in | |
| lemma incidenceKernel_symm (P : X β Z β Prop) (D : β) (x y : X) : | |
| incidenceKernel P D x y = incidenceKernel P D y x := by | |
| unfold incidenceKernel | |
| rw [commonIncidence_symm P x y] | |
| omit [DecidableEq X] [DecidableEq Z] in | |
| lemma incidenceOperator_eq (P : X β Z β Prop) (D : β) : | |
| incidenceOperator P D = | |
| ((Fintype.card Z : β) / (D ^ 2 * Fintype.card X)) β’ | |
| ((incidence P).transpose * incidence P) := by | |
| ext x y | |
| simp only [incidenceOperator, incidenceKernel, commonIncidence_eq, Matrix.smul_apply, | |
| smul_eq_mul, Matrix.mul_apply, Matrix.transpose_apply] | |
| ring | |
| omit [DecidableEq X] [DecidableEq Z] in | |
| lemma incidenceOperator_posSemidef (P : X β Z β Prop) (D : β) : | |
| (incidenceOperator P D).PosSemidef := by | |
| rw [incidenceOperator_eq] | |
| apply Matrix.PosSemidef.smul | |
| Β· simpa only [Matrix.conjTranspose_eq_transpose_of_trivial] using | |
| Matrix.posSemidef_conjTranspose_mul_self (incidence P) | |
| Β· positivity | |
| noncomputable def conditionalAverage (P : X β Z β Prop) (E : β) (f : X β β) (z : Z) : β := | |
| (β x, incidence P z x * f x) / E | |
| omit [DecidableEq X] [DecidableEq Z] in | |
| lemma conditionalAverage_energy [Nonempty X] [Nonempty Z] | |
| (P : X β Z β Prop) (D : β) (hD : D β 0) (f : X β β) : | |
| (β z, conditionalAverage P ((Fintype.card X : β) * D / Fintype.card Z) f z ^ 2) / | |
| Fintype.card Z = | |
| (β x, f x * (incidenceOperator P D *α΅₯ f) x) / Fintype.card X := by | |
| have hx : (Fintype.card X : β) β 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero | |
| have hz : (Fintype.card Z : β) β 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero | |
| change _ = (f β¬α΅₯ (incidenceOperator P D *α΅₯ f)) / Fintype.card X | |
| rw [incidenceOperator_eq, Matrix.smul_mulVec, dotProduct_smul, | |
| β Matrix.mulVec_mulVec, Matrix.dotProduct_mulVec, Matrix.vecMul_transpose] | |
| simp only [conditionalAverage, div_pow, β Finset.sum_div, smul_eq_mul] | |
| change (β z, ((incidence P *α΅₯ f) z) ^ 2) / | |
| (((Fintype.card X : β) * D) ^ 2 / (Fintype.card Z : β) ^ 2) / Fintype.card Z = | |
| ((Fintype.card Z : β) / (D ^ 2 * Fintype.card X)) * | |
| (β z, (incidence P *α΅₯ f) z * (incidence P *α΅₯ f) z) / Fintype.card X | |
| simp only [β pow_two] | |
| field_simp | |
| end Incidence | |
| end MatchingSmoothing | |
| end OAI | |