math / data /lean /OAI /Combinatorics /MatchingPSD /IncidenceKernels.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
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