File size: 20,533 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 | import Mathlib
import OAI.Combinatorics.Chromatic.Shuffle.ShuffleProjection
import OAI.Combinatorics.Chromatic.Shuffle.FourColumns
import OAI.Combinatorics.Chromatic.Shuffle.FourKernelCancellation
namespace OAI
section
namespace ElementaryPositivity.RawShuffle
open MvPolynomial HahnSeries
open ElementaryPositivity.LaurentAtInfinity ElementaryPositivity.RectangularKernel
open scoped TensorProduct
variable {I : Type*} [Fintype I] [DecidableEq I]
noncomputable local instance kernelTensorRing (d e : I β β) : CommRing (S dβ[β]S e) := inferInstance
noncomputable local instance kernelTensorDistrib (d e : I β β) :
DistribSMul (S dβ[β]S e) (S dβ[β]S e) where
smul_add := mul_add
noncomputable local instance kernelTensorAlg (d e : I β β) : Algebra β (S dβ[β]S e) := inferInstance
noncomputable local instance kernelFourRing (dβ eβ dβ eβ : I β β) :
CommRing ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) := inferInstance
noncomputable local instance kernelFourAlg (dβ eβ dβ eβ : I β β) :
Algebra β ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) := inferInstance
noncomputable local instance kernelTensorSelf (d e : I β β) :
Module (S dβ[β]S e) (S dβ[β]S e) := Semiring.toModule
noncomputable local instance kernelTensorNonUnital (d e : I β β) :
NonUnitalNonAssocSemiring (S dβ[β]S e) := (kernelTensorRing d e).toNonUnitalNonAssocSemiring
noncomputable local instance kernelFourNonUnital (dβ eβ dβ eβ : I β β) :
NonUnitalNonAssocSemiring ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) :=
(kernelFourRing dβ eβ dβ eβ).toNonUnitalNonAssocSemiring
lemma realize_inverseKernelUnit_unit (a : I β I β β) (d e : I β β) :
Units.map (mapRing (tensorValueAlg d e).toRingHom).toMonoidHom
(SeparationInfinity.inverseKernelUnit a d e)=SeparationInfinity.rawInverseKernelUnit a d e := by
apply Units.ext
exact SeparationInfinity.realize_inverseKernelUnit a d e
lemma fourKernel_lift_naturality (a : I β I β β) (d e dβ eβ dβ eβ : I β β)
(F : S dβ[β]S e ββ[β] (S dββ[β]S eβ)β[β](S dββ[β]S eβ))
(r : CellVars d e β CellVars dβ eββCellVars dβ eβ)
(h : β x,fourValueAlg dβ eβ dβ eβ (F x)=rename r (tensorValue d e x)) :
Units.map (mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(Units.map (mapRing (R:=S dβ[β]S e) (S:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) F.toRingHom).toMonoidHom (SeparationInfinity.inverseKernelUnit a d e))=
Units.map (mapRing (rename r).toRingHom).toMonoidHom (SeparationInfinity.rawInverseKernelUnit a d e) := by
apply Units.ext
apply HahnSeries.ext
funext k
change fourValueAlg dβ eβ dβ eβ (F ((SeparationInfinity.inverseKernelUnit a d e).val.coeff k))=
rename r ((SeparationInfinity.rawInverseKernelUnit a d e).val.coeff k)
rw [h]
have hr := congrArg (fun x : LaurentSeries (MvPolynomial (CellVars d e) β)=>x.coeff k)
(SeparationInfinity.realize_inverseKernelUnit a d e)
exact congrArg (rename r) hr
lemma fourKernel_restrictRows (a : I β I β β) {dβ eβ dβ eβ : I β β}
(A : Cut dβ eβ) (B : Cut dβ eβ) :
Units.map (mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(Units.map (mapRing (R:=S (dβ+eβ)β[β]S (dβ+eβ)) (S:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (restrictRows dβ eβ dβ eβ A B).toRingHom).toMonoidHom
(SeparationInfinity.inverseKernelUnit a (dβ+eβ) (dβ+eβ)))=
fourTotalInverseUnit a dβ eβ dβ eβ := by
rw [fourKernel_lift_naturality a _ _ _ _ _ _ _ _ (fourValue_restrictRows A B)]
exact rowSplit_inverseKernel a A B
lemma fourKernel_firstColumn (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(Units.map (mapRing (R:=S dββ[β]S dβ) (S:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (firstColumnAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(SeparationInfinity.inverseKernelUnit a dβ dβ))=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inl x) (.inl y)) := by
refine Eq.trans (fourKernel_lift_naturality a dβ dβ dβ eβ dβ eβ
( firstColumnAlg dβ eβ dβ eβ ) _ (fourValue_firstColumn dβ eβ dβ eβ)) ?_
have he : firstColumnVars dβ eβ dβ eβ =
Sum.elim (Sum.inl β Sum.inl) (Sum.inr β Sum.inl) := by
funext x; cases x <;> rfl
rw [he]
have h := rawKernel_rename (Ο:=CellVars dβ eββCellVars dβ eβ) a dβ dβ
(Sum.inl β Sum.inl) (Sum.inr β Sum.inl)
simpa only [fourAffine,fourForwardDifference,Function.comp_apply,
Equiv.sigmaSumDistrib_apply,Sum.map_inl,Sum.map_inr,firstColumnVars,secondColumnVars,crossingColumnVars] using h
lemma fourKernel_secondColumn (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(Units.map (mapRing (R:=S eββ[β]S eβ) (S:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (secondColumnAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(SeparationInfinity.inverseKernelUnit a eβ eβ))=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inr x) (.inr y)) := by
refine Eq.trans (fourKernel_lift_naturality a eβ eβ dβ eβ dβ eβ
( secondColumnAlg dβ eβ dβ eβ ) _ (fourValue_secondColumn dβ eβ dβ eβ)) ?_
have he : secondColumnVars dβ eβ dβ eβ =
Sum.elim (Sum.inl β Sum.inr) (Sum.inr β Sum.inr) := by
funext x; cases x <;> rfl
rw [he]
have h := rawKernel_rename (Ο:=CellVars dβ eββCellVars dβ eβ) a eβ eβ
(Sum.inl β Sum.inr) (Sum.inr β Sum.inr)
simpa only [fourAffine,fourForwardDifference,Function.comp_apply,
Equiv.sigmaSumDistrib_apply,Sum.map_inl,Sum.map_inr,firstColumnVars,secondColumnVars,crossingColumnVars] using h
lemma fourKernel_crossingColumn (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(Units.map (mapRing (R:=S eββ[β]S dβ) (S:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (crossingColumnAlg dβ eβ dβ eβ).toRingHom).toMonoidHom
(SeparationInfinity.inverseKernelUnit a eβ dβ))=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inr x) (.inl y)) := by
refine Eq.trans (fourKernel_lift_naturality a eβ dβ dβ eβ dβ eβ
( crossingColumnAlg dβ eβ dβ eβ ) _ (fourValue_crossingColumn dβ eβ dβ eβ)) ?_
have h := rawKernel_rename (Ο:=CellVars dβ eββCellVars dβ eβ) a eβ dβ
(Sum.inl β Sum.inr) (Sum.inr β Sum.inl)
simpa only [fourAffine,fourForwardDifference,Function.comp_apply,
Equiv.sigmaSumDistrib_apply,Sum.map_inl,Sum.map_inr,firstColumnVars,secondColumnVars,crossingColumnVars] using h
lemma fourTensor_cross_realize (a : I β I β β) (dβ eβ dβ eβ : I β β) :
mapRing (R:= (S dββ[β]S eβ)β[β](S dββ[β]S eβ)) (S:=MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) (fourValueAlg dβ eβ dβ eβ).toRingHom
(polynomial (fourRelativeTaylor dβ eβ dβ eβ (fourCrossTensor a dβ eβ dβ eβ)))=
(fourCrossAffineUnit a dβ eβ dβ eβ).val := by
rw [polynomial_map,map_fourRelativeTaylor,fourValue_fourCrossTensor,polynomial_fourRelative_cross]
end ElementaryPositivity.RawShuffle
end
section
namespace ElementaryPositivity.RawShuffle
open MvPolynomial HahnSeries
open ElementaryPositivity.LaurentAtInfinity ElementaryPositivity.RectangularKernel
open scoped TensorProduct
variable {I : Type*} [Fintype I] [DecidableEq I]
noncomputable local instance cancelTensorRing (d e : I β β) : CommRing (S dβ[β]S e) := inferInstance
noncomputable local instance cancelTensorDistrib (d e : I β β) :
DistribSMul (S dβ[β]S e) (S dβ[β]S e) where
smul_add := mul_add
noncomputable local instance cancelTensorAlg (d e : I β β) : Algebra β (S dβ[β]S e) := inferInstance
noncomputable local instance cancelFourRing (dβ eβ dβ eβ : I β β) :
CommRing ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) := inferInstance
noncomputable local instance cancelFourAlg (dβ eβ dβ eβ : I β β) :
Algebra β ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) := inferInstance
noncomputable def mappedInverseKernel {R : Type*} [CommRing R] [Algebra β R]
(a : I β I β β) (d e : I β β) (f : S dβ[β]S e ββ[β] R) : (LaurentSeries R)Λ£ :=
Units.map (mapRing f.toRingHom).toMonoidHom (SeparationInfinity.inverseKernelUnit a d e)
noncomputable local instance cancelTensorSelf (d e : I β β) :
Module (S dβ[β]S e) (S dβ[β]S e) := Semiring.toModule
noncomputable local instance cancelTensorNonUnital (d e : I β β) :
NonUnitalNonAssocSemiring (S dβ[β]S e) := (cancelTensorRing d e).toNonUnitalNonAssocSemiring
noncomputable local instance cancelFourNonUnital (dβ eβ dβ eβ : I β β) :
NonUnitalNonAssocSemiring ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) :=
(cancelFourRing dβ eβ dβ eβ).toNonUnitalNonAssocSemiring
noncomputable local instance cancelSeriesRing (dβ eβ dβ eβ : I β β) :
CommRing (LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ))) := inferInstance
noncomputable def fourRowsInverseUnit (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) : (LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£ :=
mappedInverseKernel a (dβ+eβ) (dβ+eβ) (restrictRows dβ eβ dβ eβ A B)
noncomputable def fourFirstInverseUnit (a : I β I β β) (dβ eβ dβ eβ : I β β) :
(LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£ :=
mappedInverseKernel a dβ dβ (firstColumnAlg dβ eβ dβ eβ)
noncomputable def fourSecondInverseUnit (a : I β I β β) (dβ eβ dβ eβ : I β β) :
(LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£ :=
mappedInverseKernel a eβ eβ (secondColumnAlg dβ eβ dβ eβ)
noncomputable def fourCrossingInverseUnit (a : I β I β β) (dβ eβ dβ eβ : I β β) :
(LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£ :=
mappedInverseKernel a eβ dβ (crossingColumnAlg dβ eβ dβ eβ)
lemma fourTotalInverseUnit_zero (dβ eβ dβ eβ : I β β) :
fourTotalInverseUnit (fun _ _ : I=>0) dβ eβ dβ eβ=fourClearingUnit dβ eβ dβ eβ := by
unfold fourTotalInverseUnit fourClearingUnit
congr 1
funext i j
simp only [SeparationInfinity.inverseExponent,Nat.cast_zero,sub_zero]
noncomputable def fourSeriesValue (dβ eβ dβ eβ : I β β) :
LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)) β+*
LaurentSeries (MvPolynomial (CellVars dβ eββCellVars dβ eβ) β) :=
mapRing (fourValueAlg dβ eβ dβ eβ).toRingHom
lemma fourSeriesValue_injective (dβ eβ dβ eβ : I β β) :
Function.Injective (fourSeriesValue dβ eβ dβ eβ) :=
mapRing_injective (fourValueAlg dβ eβ dβ eβ).toRingHom (fourValue_injective dβ eβ dβ eβ)
lemma fourSeriesValue_rows (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) :
Units.map (fourSeriesValue dβ eβ dβ eβ).toMonoidHom (fourRowsInverseUnit a dβ eβ dβ eβ A B)=
fourTotalInverseUnit a dβ eβ dβ eβ := fourKernel_restrictRows a A B
lemma fourSeriesValue_first (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (fourSeriesValue dβ eβ dβ eβ).toMonoidHom (fourFirstInverseUnit a dβ eβ dβ eβ)=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inl x) (.inl y)) :=
fourKernel_firstColumn a dβ eβ dβ eβ
lemma fourSeriesValue_second (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (fourSeriesValue dβ eβ dβ eβ).toMonoidHom (fourSecondInverseUnit a dβ eβ dβ eβ)=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inr x) (.inr y)) :=
fourKernel_secondColumn a dβ eβ dβ eβ
lemma fourSeriesValue_crossing (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (fourSeriesValue dβ eβ dβ eβ).toMonoidHom (fourCrossingInverseUnit a dβ eβ dβ eβ)=
rectangular (SeparationInfinity.inverseExponent a)
(fun i j x y=>fourAffine dβ eβ dβ eβ i j (.inr x) (.inl y)) :=
fourKernel_crossingColumn a dβ eβ dβ eβ
lemma fourSeriesValue_cross (a : I β I β β) (dβ eβ dβ eβ : I β β) :
fourSeriesValue dβ eβ dβ eβ
(polynomial (fourRelativeTaylor dβ eβ dβ eβ (fourCrossTensor a dβ eβ dβ eβ)))=
(fourCrossAffineUnit a dβ eβ dβ eβ).val := fourTensor_cross_realize a dβ eβ dβ eβ
lemma units_map_neg_one {R S : Type*} [Ring R] [Ring S] (f : R β+* S) :
Units.map f.toMonoidHom (-1 : RΛ£)=(-1 : SΛ£) := by
apply Units.ext
change f (-1) = -1
rw [map_neg,map_one]
lemma ring_map_unit_val {R S : Type*} [Ring R] [Ring S] (f : R β+* S) (u : RΛ£) :
f u.val = (Units.map f.toMonoidHom u).val := rfl
lemma ring_map_inv_unit_val {R S : Type*} [Ring R] [Ring S] (f : R β+* S) (u : RΛ£) :
f (uβ»ΒΉ).val = ((Units.map f.toMonoidHom u)β»ΒΉ).val := rfl
lemma ring_map_signedUnits {R S : Type*} [CommRing R] [CommRing S]
(f : R β+* S) (A B C D : RΛ£) (w : β€) :
f (((-1)^w*(A*B*(C*Dβ»ΒΉ))).val)=
((-1)^w*(Units.map f.toMonoidHom A*Units.map f.toMonoidHom B*
(Units.map f.toMonoidHom C*(Units.map f.toMonoidHom D)β»ΒΉ))).val := by
rw [ring_map_unit_val]
simp only [map_mul,map_inv,map_zpow,units_map_neg_one]
lemma unitKernelCancellation_lift {R S : Type*} [CommRing R] [CommRing S]
(f : R β+* S) (hf : Function.Injective f)
(K L A B C D : RΛ£) (P : R) (k l a b c d p : SΛ£)
(hK : Units.map f.toMonoidHom K=k) (hL : Units.map f.toMonoidHom L=l)
(hA : Units.map f.toMonoidHom A=a) (hB : Units.map f.toMonoidHom B=b)
(hC : Units.map f.toMonoidHom C=c) (hD : Units.map f.toMonoidHom D=d)
(hP : f P=p.val) (w : β€)
(h : k*lβ»ΒΉ*p=(-1)^w*(a*b*(c*dβ»ΒΉ))) :
K.val*(Lβ»ΒΉ).val*P=((-1)^w*(A*B*(C*Dβ»ΒΉ))).val := by
apply hf
rw [map_mul,map_mul,hP]
simp only [ring_map_unit_val,map_mul,map_inv,map_zpow,units_map_neg_one,hK,hL,hA,hB,hC,hD]
exact congrArg Units.val h
lemma unitKernelCancellation_lift2 {R S : Type*} [CommRing R] [CommRing S]
(f : R β+* S) (hf : Function.Injective f)
(K L A B C D : RΛ£) (P : R) (p : SΛ£) (hP : f P=p.val) (w : β€)
(h : Units.map f.toMonoidHom K*(Units.map f.toMonoidHom L)β»ΒΉ*p=
(-1)^w*(Units.map f.toMonoidHom A*Units.map f.toMonoidHom B*
(Units.map f.toMonoidHom C*(Units.map f.toMonoidHom D)β»ΒΉ))) :
K.val*(Lβ»ΒΉ).val*P=((-1)^w*(A*B*(C*Dβ»ΒΉ))).val :=
unitKernelCancellation_lift f hf K L A B C D P _ _ _ _ _ _ p rfl rfl rfl rfl rfl rfl hP w h
lemma fourSeriesValue_rows_val (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) :
fourSeriesValue dβ eβ dβ eβ (fourRowsInverseUnit a dβ eβ dβ eβ A B).val=
(fourTotalInverseUnit a dβ eβ dβ eβ).val :=
congrArg Units.val (fourSeriesValue_rows a dβ eβ dβ eβ A B)
lemma fourSeriesValue_rows_inv_val (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) :
fourSeriesValue dβ eβ dβ eβ ((fourRowsInverseUnit a dβ eβ dβ eβ A B)β»ΒΉ).val=
((fourTotalInverseUnit a dβ eβ dβ eβ)β»ΒΉ).val :=
congrArg (fun u=> (uβ»ΒΉ).val) (fourSeriesValue_rows a dβ eβ dβ eβ A B)
noncomputable def fourTensorKernelRHS (a : I β I β β) (dβ eβ dβ eβ : I β β) :
(LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£ :=
(-1)^eulerForm a dβ eβ *
(fourFirstInverseUnit a dβ eβ dβ eβ * fourSecondInverseUnit a dβ eβ dβ eβ *
(fourCrossingInverseUnit a dβ eβ dβ eβ *
(fourCrossingInverseUnit (fun i j=>a j i) dβ eβ dβ eβ)β»ΒΉ))
lemma fourSeriesValue_kernelRHS (a : I β I β β) (dβ eβ dβ eβ : I β β) :
Units.map (fourSeriesValue dβ eβ dβ eβ).toMonoidHom
(fourTensorKernelRHS a dβ eβ dβ eβ)=
fourTotalInverseUnit a dβ eβ dβ eβ * (fourClearingUnit dβ eβ dβ eβ)β»ΒΉ *
fourCrossAffineUnit a dβ eβ dβ eβ := by
apply Units.ext
change fourSeriesValue dβ eβ dβ eβ (fourTensorKernelRHS a dβ eβ dβ eβ).val = _
unfold fourTensorKernelRHS
rw [ring_map_signedUnits]
apply congrArg Units.val
refine Eq.trans ?_ (fourKernel_cancellation a dβ eβ dβ eβ).symm
apply congrArg ((-1)^eulerForm a dβ eβ * Β·)
exact congrArgβ (Β· * Β·)
(congrArgβ (Β· * Β·) (fourSeriesValue_first a dβ eβ dβ eβ)
(fourSeriesValue_second a dβ eβ dβ eβ))
(congrArgβ (Β· * Β·) (fourSeriesValue_crossing a dβ eβ dβ eβ)
(congrArg Inv.inv (fourSeriesValue_crossing (fun i j=>a j i) dβ eβ dβ eβ)))
lemma fourSeriesValue_kernelRHS_val (a : I β I β β) (dβ eβ dβ eβ : I β β) :
fourSeriesValue dβ eβ dβ eβ (fourTensorKernelRHS a dβ eβ dβ eβ).val=
(fourTotalInverseUnit a dβ eβ dβ eβ * (fourClearingUnit dβ eβ dβ eβ)β»ΒΉ *
fourCrossAffineUnit a dβ eβ dβ eβ).val :=
congrArg Units.val (fourSeriesValue_kernelRHS a dβ eβ dβ eβ)
lemma fourSeriesValue_kernelLHS (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) :
fourSeriesValue dβ eβ dβ eβ
((fourRowsInverseUnit a dβ eβ dβ eβ A B).val *
((fourRowsInverseUnit (fun _ _ : I=>0) dβ eβ dβ eβ A B)β»ΒΉ).val *
polynomial (fourRelativeTaylor dβ eβ dβ eβ (fourCrossTensor a dβ eβ dβ eβ)))=
(fourTotalInverseUnit a dβ eβ dβ eβ * (fourClearingUnit dβ eβ dβ eβ)β»ΒΉ *
fourCrossAffineUnit a dβ eβ dβ eβ).val := by
rw [(fourSeriesValue dβ eβ dβ eβ).map_mul,(fourSeriesValue dβ eβ dβ eβ).map_mul,
fourSeriesValue_rows_val,fourSeriesValue_rows_inv_val,fourTotalInverseUnit_zero,fourSeriesValue_cross]
rfl
lemma fourTensorKernel_cancellation (a : I β I β β) (dβ eβ dβ eβ : I β β)
(A : Cut dβ eβ) (B : Cut dβ eβ) :
(fourRowsInverseUnit a dβ eβ dβ eβ A B).val *
((fourRowsInverseUnit (fun _ _ : I=>0) dβ eβ dβ eβ A B)β»ΒΉ).val *
polynomial (fourRelativeTaylor dβ eβ dβ eβ (fourCrossTensor a dβ eβ dβ eβ))=
(((-1 : (LaurentSeries ((S dββ[β]S eβ)β[β](S dββ[β]S eβ)))Λ£)^eulerForm a dβ eβ) *
(fourFirstInverseUnit a dβ eβ dβ eβ *
fourSecondInverseUnit a dβ eβ dβ eβ *
(fourCrossingInverseUnit a dβ eβ dβ eβ *
(fourCrossingInverseUnit (fun i j=>a j i) dβ eβ dβ eβ)β»ΒΉ))).val := by
apply fourSeriesValue_injective dβ eβ dβ eβ
exact (fourSeriesValue_kernelLHS a dβ eβ dβ eβ A B).trans
(fourSeriesValue_kernelRHS_val a dβ eβ dβ eβ).symm
end ElementaryPositivity.RawShuffle
end
end OAI
|