math / data /lean /OAI /LinearAlgebra /MatrixMultiplication /JointExtraction /CompatibilityControls.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
15 kB
import OAI.LinearAlgebra.MatrixMultiplication.JointExtraction.CompatibilityIncidence
import OAI.LinearAlgebra.MatrixMultiplication.Entropy.ComplexEntropyContinuity
import Mathlib.Tactic.Linarith
namespace OAI
/-! Joint tensor extraction, compatibility and entropy estimates. -/
noncomputable section
open scoped BigOperators
open MatrixMultiplication.Foundation
open MatrixMultiplication.JointTypeCounts MatrixMultiplication.JointCompatibilityIncidence
namespace MatrixMultiplication.JointCompatibilityControls
attribute [local instance] Classical.propDecidable
private theorem exists_pos_le_family {K : Type*} [Fintype K]
(Ξ΄ : K β†’ ℝ) (hΞ΄ : βˆ€ k, 0 < Ξ΄ k) :
βˆƒ Ξ΅ : ℝ, 0 < Ξ΅ ∧ βˆ€ k, Ξ΅ ≀ Ξ΄ k := by
classical
have aux : βˆ€ s : Finset K, βˆƒ Ξ΅ : ℝ, 0 < Ξ΅ ∧ βˆ€ k ∈ s, Ξ΅ ≀ Ξ΄ k := by
intro s
induction s using Finset.induction_on with
| empty => exact ⟨1, zero_lt_one, by simp⟩
| @insert k s hk ih =>
obtain ⟨Ρ, hΡ, hb⟩ := ih
refine ⟨min (δ k) Ρ, lt_min (hδ k) hΡ, ?_⟩
intro j hj
rcases Finset.mem_insert.mp hj with rfl | hj
Β· exact min_le_left _ _
Β· exact (min_le_right _ _).trans (hb j hj)
obtain ⟨Ρ, hΡ, hb⟩ := aux Finset.univ
exact ⟨Ρ, hΡ, fun k => hb k (Finset.mem_univ k)⟩
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)]
def residualBase (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop) (c : C) : β„• :=
βˆ‘ u : {u : Shape c // Β¬d c u}, base c u.val
def designatedBase (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop) (c : C) : β„• :=
βˆ‘ u : {u : Shape c // d c u}, base c u.val
def totalCenterCount (base : βˆ€ c, Shape c β†’ β„•)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (c : C) (a : A c) : ℝ :=
βˆ‘ u, (base c u : ℝ) * law c u a
def residualCenter (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (c : C) (a : A c) : ℝ :=
(βˆ‘ u : {u : Shape c // Β¬d c u}, (base c u.val : ℝ) * law c u.val a) /
residualBase base d c
omit [Fintype C] [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)] in
theorem residualBase_mul_center (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (c : C) (a : A c) :
(residualBase base d c : ℝ) * residualCenter base d law c a =
βˆ‘ u : {u : Shape c // Β¬d c u}, (base c u.val : ℝ) * law c u.val a := by
by_cases hr : residualBase base d c = 0
Β· have hb (u : {u : Shape c // Β¬d c u}) : base c u.val = 0 := by
have hle : base c u.val ≀ residualBase base d c :=
Finset.single_le_sum
(f := fun v : {u : Shape c // Β¬d c u} => base c v.val)
(fun _ _ => Nat.zero_le _) (Finset.mem_univ u)
rw [hr] at hle
exact Nat.eq_zero_of_le_zero hle
simp only [hr, Nat.cast_zero, zero_mul, hb, Finset.sum_const_zero]
Β· exact mul_div_cancelβ‚€ _ (Nat.cast_ne_zero.mpr hr)
omit [Fintype C] [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)] in
theorem residualCenter_nonneg (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (h0 : βˆ€ c u a, 0 ≀ law c u a)
(c : C) (a : A c) : 0 ≀ residualCenter base d law c a :=
div_nonneg (Finset.sum_nonneg fun shape _ =>
mul_nonneg (Nat.cast_nonneg _) (h0 c shape.val a))
(Nat.cast_nonneg _)
omit [Fintype C] [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)] in
theorem residualCenter_le_one (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (h1 : βˆ€ c u a, law c u a ≀ 1)
(c : C) (a : A c) : residualCenter base d law c a ≀ 1 := by
by_cases hr : residualBase base d c = 0
Β· simp only [residualCenter, hr, Nat.cast_zero, div_zero, zero_le_one]
Β· have hp : (0 : ℝ) < residualBase base d c := Nat.cast_pos.mpr (Nat.pos_of_ne_zero hr)
apply (div_le_iffβ‚€ hp).mpr
calc
(βˆ‘ u : {u : Shape c // Β¬d c u}, (base c u.val : ℝ) * law c u.val a) ≀
βˆ‘ u : {u : Shape c // Β¬d c u}, (base c u.val : ℝ) * 1 :=
Finset.sum_le_sum fun u _ => mul_le_mul_of_nonneg_left (h1 _ _ _) (Nat.cast_nonneg _)
_ = 1 * (residualBase base d c : ℝ) := by
simp only [mul_one, one_mul, residualBase, Nat.cast_sum]
def groupCenter (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (g : Ξ£ c, Option (Shape c)) : A g.1 β†’ ℝ :=
match g.2 with
| some u => law g.1 u
| none => residualCenter base d law g.1
def groupCap (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (Ξ΅ : ℝ) (g : Ξ£ c, Option (Shape c)) : ℝ :=
finiteEntropy (groupCenter base d law g) + Ξ΅
omit [Fintype C] [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)]
[βˆ€ c, DecidableEq (A c)] in
theorem groupCap_nonneg (base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ)
(h0 : βˆ€ c u a, 0 ≀ law c u a) (h1 : βˆ€ c u a, law c u a ≀ 1)
{Ξ΅ : ℝ} (hΞ΅ : 0 ≀ Ξ΅) (g : Ξ£ c, Option (Shape c)) :
0 ≀ groupCap base d law Ξ΅ g := by
apply add_nonneg _ hΞ΅
rcases g with ⟨c, k⟩
cases k with
| some u =>
exact finiteEntropy_nonneg (law c u) (h0 c u) (h1 c u)
| none =>
exact finiteEntropy_nonneg (residualCenter base d law c)
(residualCenter_nonneg base d law h0 c) (residualCenter_le_one base d law h1 c)
omit [DecidableEq C] [βˆ€ c, DecidableEq (Shape c)] [βˆ€ c, DecidableEq (A c)] in
private theorem exists_group_entropy_window (base : βˆ€ c, Shape c β†’ β„•)
(d : βˆ€ c, Shape c β†’ Prop) (law : βˆ€ c, Shape c β†’ A c β†’ ℝ)
{Ξ΅ : ℝ} (hΞ΅ : 0 < Ξ΅) :
βˆƒ Ξ΄ : ℝ, 0 < Ξ΄ ∧ βˆ€ (g : Ξ£ c, Option (Shape c)) (q : A g.1 β†’ ℝ),
(βˆ€ a, |q a - groupCenter base d law g a| ≀ Ξ΄) β†’
finiteEntropy q ≀ groupCap base d law Ξ΅ g := by
have hex : βˆ€ g : Ξ£ c, Option (Shape c), βˆƒ Ξ΄ : ℝ, 0 < Ξ΄ ∧
βˆ€ q : A g.1 β†’ ℝ, (βˆ€ a, |q a - groupCenter base d law g a| ≀ Ξ΄) β†’
|finiteEntropy q - finiteEntropy (groupCenter base d law g)| < Ξ΅ :=
fun g => exists_entropy_window (groupCenter base d law g) hΞ΅
choose Ξ΄ hΞ΄ hw using hex
obtain βŸ¨Ξ΄β‚€, hΞ΄β‚€, hsmall⟩ := exists_pos_le_family Ξ΄ hΞ΄
refine βŸ¨Ξ΄β‚€, hΞ΄β‚€, ?_⟩
intro g q hq
have hh := (abs_lt.mp (hw g q (fun a => (hq a).trans (hsmall g)))).2
change finiteEntropy q ≀ finiteEntropy (groupCenter base d law g) + Ξ΅
linarith
omit [Fintype C] [DecidableEq C] in
theorem residual_card_repeated
{Pos : C β†’ Type*} [βˆ€ c, Fintype (Pos c)] [βˆ€ c, DecidableEq (Pos c)]
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop) (t : β„•)
(w : FixedClassWords Pos Shape (fun c u => t * base c u)) (c : C) :
Fintype.card {i : Pos c // Β¬d c ((w c).val i)} = t * residualBase base d c := by
have he := (Fintype.card_congr (Equiv.sigmaSubtypeFiberEquivSubtype (w c).val
(p := fun i => Β¬d c ((w c).val i)) (q := fun u => Β¬d c u)
(fun _ => Iff.rfl))).symm
have hc : Fintype.card {i : Pos c // Β¬d c ((w c).val i)} =
βˆ‘ u : {u : Shape c // Β¬d c u}, wordPopulation (w c).val u.val := by
simpa only [Fintype.card_sigma, wordPopulation] using he
exact hc.trans (by simp only [(w c).property, residualBase, Finset.mul_sum])
omit [Fintype C] [DecidableEq C] [βˆ€ c, Fintype (A c)] [βˆ€ c, DecidableEq (A c)] in
theorem repeated_mixture_balance
{Pos : C β†’ Type*} [βˆ€ c, Fintype (Pos c)] [βˆ€ c, DecidableEq (Pos c)]
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (t : β„•)
(w : FixedClassWords Pos Shape (fun c u => t * base c u)) (c : C) (a : A c) :
(Fintype.card {i : Pos c // Β¬d c ((w c).val i)} : ℝ) * residualCenter base d law c a =
(t : ℝ) * totalCenterCount base law c a -
βˆ‘ u : {u : Shape c // d c u}, (t * base c u.val : β„•) * law c u.val a := by
have hsplit := Fintype.sum_subtype_add_sum_subtype (d c)
(fun u => (base c u : ℝ) * law c u a)
have hb : (βˆ‘ u : {u : Shape c // Β¬d c u}, (base c u.val : ℝ) * law c u.val a) =
totalCenterCount base law c a -
βˆ‘ u : {u : Shape c // d c u}, (base c u.val : ℝ) * law c u.val a := by
unfold totalCenterCount
linarith
rw [residual_card_repeated, Nat.cast_mul, mul_assoc, residualBase_mul_center, hb]
simp only [Nat.cast_mul, mul_sub, Finset.mul_sum, mul_assoc]
omit [Fintype C] [DecidableEq C] in
private theorem repeated_residual_width_le
{Pos : C β†’ Type*} [βˆ€ c, Fintype (Pos c)] [βˆ€ c, DecidableEq (Pos c)]
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(t : β„•) (w : FixedClassWords Pos Shape (fun c u => t * base c u))
(Ο‡ Ξ· Ξ΄ : ℝ) (hΞ΄ : 0 ≀ Ξ΄)
(hnum : βˆ€ c, Ξ· + (designatedBase base d c : ℝ) * Ο‡ ≀ Ξ΄) (c : C) :
((t : ℝ) * Ξ· + (βˆ‘ u : {u : Shape c // d c u}, ((t * base c u.val : β„•) : ℝ)) * Ο‡) /
Fintype.card {i : Pos c // Β¬d c ((w c).val i)} ≀ Ξ΄ := by
have hsum : (βˆ‘ u : {u : Shape c // d c u}, ((t * base c u.val : β„•) : ℝ)) =
(t : ℝ) * designatedBase base d c := by
simp only [Nat.cast_mul, designatedBase, Nat.cast_sum, Finset.mul_sum]
rw [residual_card_repeated, hsum, Nat.cast_mul]
by_cases ht : t = 0
Β· simpa only [ht, Nat.cast_zero, zero_mul, add_zero, zero_add, zero_div] using hΞ΄
by_cases hr : residualBase base d c = 0
Β· simpa only [hr, Nat.cast_zero, mul_zero, div_zero] using hΞ΄
have htpos : (0 : ℝ) < t := Nat.cast_pos.mpr (Nat.pos_of_ne_zero ht)
have hrpos : (0 : ℝ) < residualBase base d c := Nat.cast_pos.mpr (Nat.pos_of_ne_zero hr)
have hrone : (1 : ℝ) ≀ residualBase base d c := by exact_mod_cast Nat.one_le_iff_ne_zero.mpr hr
have hres : Ξ· + (designatedBase base d c : ℝ) * Ο‡ ≀ Ξ΄ * residualBase base d c :=
(hnum c).trans (by simpa only [mul_one] using mul_le_mul_of_nonneg_left hrone hΞ΄)
apply (div_le_iffβ‚€ (mul_pos htpos hrpos)).mpr
calc
(t : ℝ) * Ξ· + ((t : ℝ) * designatedBase base d c) * Ο‡ =
(t : ℝ) * (Ξ· + (designatedBase base d c : ℝ) * Ο‡) := by ring
_ ≀ (t : ℝ) * (Ξ΄ * residualBase base d c) :=
mul_le_mul_of_nonneg_left hres htpos.le
_ = Ξ΄ * ((t : ℝ) * residualBase base d c) := by ring
omit [DecidableEq C] in
theorem exists_uniform_sideEntropyControl
(Pos : β„• β†’ C β†’ Type*) [βˆ€ t c, Fintype (Pos t c)] [βˆ€ t c, DecidableEq (Pos t c)]
(Pair : C β†’ Type*) [βˆ€ c, Fintype (Pair c)] [βˆ€ c, DecidableEq (Pair c)]
(base : βˆ€ c, Shape c β†’ β„•) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) (part : βˆ€ c, Pair c β†’ A c)
(h0 : βˆ€ c u a, 0 ≀ law c u a) (h1 : βˆ€ c u a, law c u a ≀ 1)
{Ξ΅ Ο‡Max Ξ·Max : ℝ} (hΞ΅ : 0 < Ξ΅) (hΟ‡Max : 0 < Ο‡Max) (hΞ·Max : 0 < Ξ·Max) :
βˆƒ Ο‡ Ξ· : ℝ, 0 < Ο‡ ∧ Ο‡ ≀ Ο‡Max ∧ 0 < Ξ· ∧ Ξ· ≀ Ξ·Max ∧
βˆ€ (t : β„•) (pairCounts : βˆ€ c, Pair c β†’ β„•)
(w : FixedClassWords (Pos t) Shape (fun c u => t * base c u)),
(βˆ€ c a, |((βˆ‘ s : {s : Pair c // part c s = a}, pairCounts c s.val : β„•) : ℝ) -
(t : ℝ) * totalCenterCount base law c a| ≀ (t : ℝ) * Ξ·) β†’
Nonempty (SideEntropyControl (Pos t) Shape Pair A (fun c u => t * base c u)
pairCounts part d law Ο‡ (groupCap base d law Ξ΅) w) := by
obtain ⟨δ, hδ, hwindow⟩ := exists_group_entropy_window base d law hΡ
let D : β„• := βˆ‘ c, designatedBase base d c
have hD : (0 : ℝ) ≀ D := Nat.cast_nonneg _
have hden : 0 < 2 * ((D : ℝ) + 1) := by positivity
let Ο‡β‚€ : ℝ := Ξ΄ / (2 * ((D : ℝ) + 1))
have hχ₀ : 0 < χ₀ := div_pos hδ hden
have heq : (2 * ((D : ℝ) + 1)) * Ο‡β‚€ = Ξ΄ := mul_div_cancelβ‚€ _ hden.ne'
have hχδ : Ο‡β‚€ ≀ Ξ΄ := by nlinarith [mul_nonneg hD hΟ‡β‚€.le]
have hDΟ‡ : (D : ℝ) * Ο‡β‚€ ≀ Ξ΄ / 2 := by nlinarith
let Ο‡ := min Ο‡Max Ο‡β‚€
let Ξ· := min Ξ·Max (Ξ΄ / 2)
have hχ : 0 < χ := lt_min hχMax hχ₀
have hΞ· : 0 < Ξ· := lt_min hΞ·Max (half_pos hΞ΄)
have hχδ' : Ο‡ ≀ Ξ΄ := (min_le_right _ _).trans hχδ
have hnum (c : C) : Ξ· + (designatedBase base d c : ℝ) * Ο‡ ≀ Ξ΄ := by
have hc : (designatedBase base d c : ℝ) ≀ D := by
exact_mod_cast (Finset.single_le_sum (fun _ _ => Nat.zero_le _)
(Finset.mem_univ c) : designatedBase base d c ≀ βˆ‘ c, designatedBase base d c)
have hm : (designatedBase base d c : ℝ) * Ο‡ ≀ (D : ℝ) * Ο‡β‚€ :=
mul_le_mul hc (min_le_right _ _) hχ.le hD
have he : Ξ· ≀ Ξ΄ / 2 := min_le_right _ _
linarith
refine βŸ¨Ο‡, Ξ·, hΟ‡, min_le_left _ _, hΞ·, min_le_left _ _, ?_⟩
intro t pairCounts w haggr
refine ⟨{
residualLaw := residualCenter base d law
totalTarget := fun c a => (t : ℝ) * totalCenterCount base law c a
totalError := fun _ => (t : ℝ) * Ξ·
aggregate_window := haggr
mixture_balance := repeated_mixture_balance base d law t w
nonneg := groupCap_nonneg base d law h0 h1 hΞ΅.le
designated_entropy := ?_
residual_entropy := ?_ }⟩
Β· intro c u _ q hq
exact hwindow ⟨c, some u⟩ q (fun a => (hq a).trans hχδ')
Β· intro c q hq
exact hwindow ⟨c, none⟩ q (fun a => (hq a).trans
(repeated_residual_width_le base d t w Ο‡ Ξ· Ξ΄ hΞ΄.le hnum c))
def control_mono_width
{Pos Pair : C β†’ Type*}
[βˆ€ c, Fintype (Pos c)] [βˆ€ c, DecidableEq (Pos c)]
[βˆ€ c, Fintype (Pair c)] [βˆ€ c, DecidableEq (Pair c)]
(shapeCounts : βˆ€ c, Shape c β†’ β„•) (pairCounts : βˆ€ c, Pair c β†’ β„•)
(part : βˆ€ c, Pair c β†’ A c) (d : βˆ€ c, Shape c β†’ Prop)
(law : βˆ€ c, Shape c β†’ A c β†’ ℝ) {Ο‡ Ο‡' : ℝ}
(H : (Ξ£ c, Option (Shape c)) β†’ ℝ)
(w : FixedClassWords Pos Shape shapeCounts)
(control : SideEntropyControl Pos Shape Pair A shapeCounts pairCounts part d law Ο‡ H w)
(hΟ‡ : Ο‡' ≀ Ο‡) :
SideEntropyControl Pos Shape Pair A shapeCounts pairCounts part d law Ο‡' H w where
residualLaw := control.residualLaw
totalTarget := control.totalTarget
totalError := control.totalError
aggregate_window := control.aggregate_window
mixture_balance := control.mixture_balance
nonneg := control.nonneg
designated_entropy c u hu q hq :=
control.designated_entropy c u hu q (fun a => (hq a).trans hχ)
residual_entropy c q hq := by
apply control.residual_entropy c q
intro a
apply (hq a).trans
apply div_le_div_of_nonneg_right _ (Nat.cast_nonneg _)
apply add_le_add_right
exact mul_le_mul_of_nonneg_left hχ (Finset.sum_nonneg fun _ _ => Nat.cast_nonneg _)
end MatrixMultiplication.JointCompatibilityControls
end
end OAI