math / data /lean /OAI /LinearAlgebra /MatrixMultiplication /JointExtraction /ProjectedGroupEntropy.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.26 kB
import OAI.LinearAlgebra.MatrixMultiplication.JointExtraction.CompatibilityRateLimit
import OAI.LinearAlgebra.MatrixMultiplication.JointExtraction.CompatibilityControls
import OAI.LinearAlgebra.MatrixMultiplication.JointExtraction.GroupedEntropyPartition
namespace OAI
/-! Joint tensor extraction, compatibility and entropy estimates. -/
noncomputable section
namespace MatrixMultiplication.JointProjectedGroupEntropy
open MatrixMultiplication.Foundation JointCompatibilityIncidence
open JointCompatibilityScaling JointCompatibilityControls JointCompatibilityRateLimit
open JointGroupedEntropyPartition
open scoped BigOperators
attribute [local instance] Classical.propDecidable Classical.decEq
section FiniteGroups
variable {U K A : Type*} [Fintype U] [Fintype K] [Fintype A]
theorem groupMass_designated_some (p : U β†’ ℝ) (d : U β†’ Prop) (u : U) :
groupMass p (designatedGroup d) (some u) = if d u then p u else 0 := by
simp only [groupMass, designatedGroup_eq_some]
by_cases hd : d u <;> simp [hd]
theorem weighted_groupLaw_designated_some (p : U β†’ ℝ) (d : U β†’ Prop)
(law : U β†’ A β†’ ℝ) (u : U) :
groupMass p (designatedGroup d) (some u) *
finiteEntropy (groupLaw p (designatedGroup d) law (some u)) =
(if d u then p u else 0) * finiteEntropy (law u) := by
by_cases hd : d u
Β· rw [groupMass_designated_some, ite_eq_left hd]
by_cases hp : p u = 0
Β· simp [hp]
Β· have hl : groupLaw p (designatedGroup d) law (some u) = law u := by
funext a
simp [groupLaw, groupMass_designated_some, designatedGroup_eq_some, hd, hp]
rw [hl]
Β· rw [groupMass_designated_some, ite_eq_right hd]
simp
theorem groupedEntropy_counts_eq_total_mul (n : U β†’ β„•) (group : U β†’ K)
(law : U β†’ A β†’ ℝ) :
groupedEntropy (fun u => (n u : ℝ)) group law =
(βˆ‘ u, n u : β„•) *
groupedEntropy (fun u => (n u : ℝ) / (βˆ‘ v, n v : β„•)) group law := by
by_cases hz : (βˆ‘ u, n u) = 0
Β· have hn (u : U) : n u = 0 := by
have hle : n u ≀ βˆ‘ v, n v :=
Finset.single_le_sum (fun _ _ => Nat.zero_le _) (Finset.mem_univ u)
rw [hz] at hle
exact Nat.eq_zero_of_le_zero hle
simp [hn, groupedEntropy, groupMass]
Β· have hN : ((βˆ‘ u, n u : β„•) : ℝ) β‰  0 := Nat.cast_ne_zero.mpr hz
have hf : (fun u => (n u : ℝ)) =
fun u => ((βˆ‘ v, n v : β„•) : ℝ) * ((n u : ℝ) / (βˆ‘ v, n v : β„•)) := by
funext u
exact (mul_div_cancelβ‚€ _ hN).symm
calc
_ = groupedEntropy
(fun u => ((βˆ‘ v, n v : β„•) : ℝ) * ((n u : ℝ) / (βˆ‘ v, n v : β„•)))
group law := congrArg (fun p => groupedEntropy p group law) hf
_ = _ := groupedEntropy_mul _ _ _ _
end FiniteGroups
variable {C : Type*} [Fintype C] [DecidableEq C]
{Shape A : C β†’ Type*}
[βˆ€ c, Fintype (Shape c)] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)]
omit [Fintype C] [DecidableEq C] in
theorem baseGroupSize_eq_groupMass (base : βˆ€ c, Shape c β†’ β„•)
(d : βˆ€ c, Shape c β†’ Prop) (g : Ξ£ c, Option (Shape c)) :
(baseGroupSize base d g : ℝ) =
groupMass (fun u => (base g.1 u : ℝ)) (designatedGroup (d g.1)) g.2 := by
calc
(baseGroupSize base d g : ℝ) =
βˆ‘ u ∈ Finset.univ.filter (fun u => designatedGroup (d g.1) u = g.2),
(base g.1 u : ℝ) := by
rw [baseGroupSize, Nat.cast_sum]
exact (Finset.sum_subtype
(Finset.univ.filter (fun u => designatedGroup (d g.1) u = g.2))
(by simp) (fun u => (base g.1 u : ℝ))).symm
_ = βˆ‘ u, if designatedGroup (d g.1) u = g.2 then (base g.1 u : ℝ) else 0 := by
rw [Finset.sum_filter]
_ = _ := by
unfold groupMass
apply Finset.sum_congr rfl
intro u _
by_cases hu : designatedGroup (d g.1) u = g.2 <;> simp only [hu, ite_true, ite_false]
omit [Fintype C] [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)] in
theorem residualCenter_eq_groupLaw (base : βˆ€ c, Shape c β†’ β„•)
(d : βˆ€ c, Shape c β†’ Prop) (law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (c : C) :
residualCenter base d law c =
groupLaw (fun u => (base c u : ℝ)) (designatedGroup (d c)) (law c) none := by
funext a
simp only [residualCenter, residualBase, Nat.cast_sum, groupLaw, groupMass,
designatedGroup_eq_none]
congr 1
Β· rw [← Finset.sum_filter]
exact (Finset.sum_subtype (Finset.univ.filter (fun u => Β¬ d c u))
(by simp) (fun u => (base c u : ℝ) * law c u a)).symm
Β· rw [← Finset.sum_filter]
exact (Finset.sum_subtype (Finset.univ.filter (fun u => Β¬ d c u))
(by simp) (fun u => (base c u : ℝ))).symm
omit [DecidableEq C] [βˆ€ c, DecidableEq (A c)] in
theorem projectedReferenceEntropy_eq_sum_counts_groupedEntropy
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) :
projectedReferenceEntropy base d (groupCap base d law 0) =
βˆ‘ c, groupedEntropy (fun u => (base c u : ℝ))
(designatedGroup (d c)) (law c) := by
simp only [projectedReferenceEntropy, Fintype.sum_sigma, groupCap, add_zero,
groupedEntropy]
apply Finset.sum_congr rfl
intro c _
apply Finset.sum_congr rfl
intro k _
rw [baseGroupSize_eq_groupMass]
cases k with
| none =>
change _ * finiteEntropy (residualCenter base d law c) = _
rw [residualCenter_eq_groupLaw]
| some u =>
change _ * finiteEntropy (law c u) = _
rw [weighted_groupLaw_designated_some, groupMass_designated_some]
omit [DecidableEq C] [βˆ€ c, DecidableEq (A c)] in
theorem projectedReferenceEntropy_eq_sum_weighted_groupedEntropy
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) :
projectedReferenceEntropy base d (groupCap base d law 0) =
βˆ‘ c, (baseSize base c : ℝ) *
groupedEntropy (fun u => (base c u : ℝ) / (baseSize base c : ℝ))
(designatedGroup (d c)) (law c) := by
rw [projectedReferenceEntropy_eq_sum_counts_groupedEntropy]
apply Finset.sum_congr rfl
intro c _
exact groupedEntropy_counts_eq_total_mul (base c) _ _
end MatrixMultiplication.JointProjectedGroupEntropy
end
end OAI