math / data /lean /OAI /Combinatorics /Chromatic /Shuffle /CellTransferSeparation.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
7.48 kB
import Mathlib
import OAI.Combinatorics.Chromatic.Walls.CenterLineSpecialization
import OAI.Combinatorics.Chromatic.Shuffle.SymbolDetection
import OAI.Combinatorics.Chromatic.Shuffle.CellSeparation
namespace OAI
section
namespace ElementaryPositivity.RawShuffle
open MvPolynomial HahnSeries
open ElementaryPositivity.LaurentAtInfinity SeparationInfinity
open scoped TensorProduct
variable {I : Type*} [Fintype I] [DecidableEq I]
attribute [local instance] cancelTensorRing cancelTensorAlg cancelFourRing cancelFourAlg
attribute [local instance] cancelTensorSelf cancelTensorNonUnital cancelFourNonUnital cancelSeriesRing
attribute [local instance] cellSepTensorSemiring cellSepTensorNonAssoc cellSepFourSemiring cellSepFourNonAssoc cellSepFourModule
lemma mappedInverseKernel_ratio {R : Type*} [CommRing R] [Algebra β„š R]
(a b : I β†’ I β†’ β„•) (d e : I β†’ β„•) (f : S dβŠ—[β„š]S e →ₐ[β„š]R) :
mapRing f.toRingHom ((inverseKernelUnit a d e)*(inverseKernelUnit b d e)⁻¹).val=
(mappedInverseKernel a d e f).val * ((mappedInverseKernel b d e f)⁻¹).val := by
rw [Units.val_mul,map_mul]
rfl
lemma cellTransfer_normalized (a : I β†’ I β†’ β„•) (d₁ e₁ dβ‚‚ eβ‚‚ : I β†’ β„•)
(f : S (d₁+dβ‚‚)) (g : S (e₁+eβ‚‚)) :
((inverseKernelUnit a (d₁+e₁) (dβ‚‚+eβ‚‚))*
(inverseKernelUnit (fun _ _ : I=>0) (d₁+e₁) (dβ‚‚+eβ‚‚))⁻¹).val *
polynomial (relativeTaylor (d₁+e₁) (dβ‚‚+eβ‚‚)
(cellTransfer a d₁ e₁ dβ‚‚ eβ‚‚ (fourGridPolynomial a f g d₁ e₁ dβ‚‚ eβ‚‚)))=
((-1 : β„š)^eulerForm a dβ‚‚ e₁) β€’
mapLinear (twoTargetTransfer a d₁ e₁ dβ‚‚ eβ‚‚) (fourInputSeries a d₁ e₁ dβ‚‚ eβ‚‚ f g) := by
rw [cellTransfer,LinearMap.comp_apply,←twoTarget_polynomial_relativeTaylor,
←twoTarget_Laurent_projection a d₁ e₁ dβ‚‚ eβ‚‚ (firstCut d₁ e₁) (firstCut dβ‚‚ eβ‚‚),
mappedInverseKernel_ratio,fourGrid_normalized]
exact (mapLinear (twoTargetTransfer a d₁ e₁ dβ‚‚ eβ‚‚)).map_smul _ _
end ElementaryPositivity.RawShuffle
end
section
namespace ElementaryPositivity.RawShuffle
open scoped TensorProduct
open ElementaryPositivity.LaurentAtInfinity
open SplitTree
variable {I : Type*} [Fintype I] [DecidableEq I]
omit [DecidableEq I] in
lemma eulerForm_transpose (a : I β†’ I β†’ β„•) (d e : I β†’ β„•) :
eulerForm (fun i j=>a j i) d e=eulerForm a e d := by
unfold eulerForm
congr 1
Β· exact Finset.sum_congr rfl (fun i hi=>mul_comm _ _)
Β· rw [Finset.sum_comm]
apply Finset.sum_congr rfl
intro i hi
apply Finset.sum_congr rfl
intro j hj
ring
namespace SeparationInfinity
noncomputable def mixedInverseKernelUnit (a b : I β†’ I β†’ β„•)
(ΞΌ : (I β†’ β„•) β†’ ℝ) (d e : I β†’ β„•) :
(LaurentSeries (B a ΞΌ dβŠ—[β„š] B a ΞΌ e))Λ£ :=
Units.map (mapRing (R:=S dβŠ—[β„š]S e) (S:=B a ΞΌ dβŠ—[β„š]B a ΞΌ e)
(Algebra.TensorProduct.map (quotientAlg a ΞΌ d) (quotientAlg a ΞΌ e)).toRingHom).toMonoidHom
(inverseKernelUnit b d e)
lemma pointed_mixedInverseKernel (a b : I β†’ I β†’ β„•) (c Ξ· : I β†’ ℝ)
(hc : βˆ€ i,0<c i) (ΞΈ : ℝ) (L R : SplitTree I)
(hL : L.OnSlope c Ξ· ΞΈ) (hR : R.OnSlope c Ξ· ΞΈ)
(v : L.Centers β†’ β„š) (w : R.Centers β†’ β„š) :
mapRing (pointedTensorRestriction a c Ξ· hc ΞΈ L R hL hR v w).toRingHom
(mixedInverseKernelUnit a b (SlopeArithmetic.slope c Ξ·) L.dim R.dim).val =
mapRing (algebraMap β„š (tensor (quotientFamily a (SlopeArithmetic.slope c Ξ·)) (.node L R)))
(mapRing (crossPointEval L R v w) (rawInverseKernelUnit b L.dim R.dim).val) := by
apply HahnSeries.ext
funext k
change pointedTensorRestriction a c Ξ· hc ΞΈ L R hL hR v w
(Algebra.TensorProduct.map (quotientAlg a (SlopeArithmetic.slope c Ξ·) L.dim)
(quotientAlg a (SlopeArithmetic.slope c Ξ·) R.dim) ((inverseKernelUnit b L.dim R.dim).val.coeff k))=_
rw [pointedTensorRestriction_quotient]
have h:=congrArg (fun f : LaurentSeries (MvPolynomial (CellVars L.dim R.dim) β„š)=>f.coeff k)
(realize_inverseKernelUnit b L.dim R.dim)
exact congrArg (fun f=>algebraMap β„š _ (crossPointEval L R v w f)) h
lemma refined_mixedKernel_degreeZero (a b : I β†’ I β†’ β„•) (c Ξ· : I β†’ ℝ)
(hc : βˆ€ i,0<c i) (ΞΈ : ℝ) (L R : SplitTree I)
(hL : L.OnSlope c Ξ· ΞΈ) (hR : R.OnSlope c Ξ· ΞΈ)
(v : L.Centers β†’ β„š) (w : R.Centers β†’ β„š) :
mapRing (degreeZeroTensor a (SlopeArithmetic.slope c Ξ·) (.node L R)).toRingHom
(mapRing (refinedAtB a c Ξ· hc ΞΈ L R hL hR v w).toRingHom
(mixedInverseKernelUnit a b (SlopeArithmetic.slope c Ξ·) L.dim R.dim).val)=
mapRing (algebraMap β„š (tensor (quotientFamily a (SlopeArithmetic.slope c Ξ·)) (.node L R)))
(scalarCrossKernel b L R v w).val := by
trans mapRing (pointedTensorRestriction a c Ξ· hc ΞΈ L R hL hR v w).toRingHom
(mixedInverseKernelUnit a b (SlopeArithmetic.slope c Ξ·) L.dim R.dim).val
Β· apply HahnSeries.ext
funext k
exact degreeZero_refinedAtB a c Ξ· hc ΞΈ L R hL hR v w _
Β· rw [pointed_mixedInverseKernel]
congr 1
exact congrArg Units.val (crossPointEval_inverseKernel_scalar b L R v w)
noncomputable def braidingRatioUnit (a : I β†’ I β†’ β„•) (ΞΌ : (I β†’ β„•) β†’ ℝ)
(d e : I β†’ β„•) : (LaurentSeries (B a ΞΌ dβŠ—[β„š]B a ΞΌ e))Λ£ :=
mixedInverseKernelUnit a a ΞΌ d e *
(mixedInverseKernelUnit a (fun i j=>a j i) μ d e)⁻¹
end SeparationInfinity
namespace SplitTree
omit [DecidableEq I] in
lemma scalarCrossKernel_transpose (a : I β†’ I β†’ β„•) (c Ξ· : I β†’ ℝ)
(ΞΈ : ℝ) (hΟ‡ : SlopeEulerSymmetric a c Ξ· ΞΈ) (L R : SplitTree I)
(hL : L.OnSlope c Ξ· ΞΈ) (hR : R.OnSlope c Ξ· ΞΈ)
(v : L.Centers β†’ β„š) (w : R.Centers β†’ β„š) :
scalarCrossKernel (fun i j=>a j i) L R v w=scalarCrossKernel a L R v w := by
unfold scalarCrossKernel
apply Finset.prod_congr rfl
intro z hz
apply Finset.prod_congr rfl
intro t ht
rw [eulerForm_transpose]
congr 1
obtain ⟨hz,hzs⟩:=L.leafDimension_onSlope c η θ hL z
obtain ⟨ht,hts⟩:=R.leafDimension_onSlope c η θ hR t
exact (hχ _ _ hz ht hzs hts).symm
end SplitTree
namespace SeparationInfinity
lemma refined_braidingRatio_degreeZero (a : I β†’ I β†’ β„•) (c Ξ· : I β†’ ℝ)
(hc : βˆ€ i,0<c i) (ΞΈ : ℝ) (hΟ‡ : SlopeEulerSymmetric a c Ξ· ΞΈ)
(L R : SplitTree I) (hL : L.OnSlope c Ξ· ΞΈ) (hR : R.OnSlope c Ξ· ΞΈ)
(v : L.Centers β†’ β„š) (w : R.Centers β†’ β„š) :
mapRing (degreeZeroTensor a (SlopeArithmetic.slope c Ξ·) (.node L R)).toRingHom
(mapRing (refinedAtB a c Ξ· hc ΞΈ L R hL hR v w).toRingHom
(braidingRatioUnit a (SlopeArithmetic.slope c Ξ·) L.dim R.dim).val)=1 := by
let H := (mapRing (degreeZeroTensor a (SlopeArithmetic.slope c Ξ·) (.node L R)).toRingHom).comp
(mapRing (refinedAtB a c Ξ· hc ΞΈ L R hL hR v w).toRingHom)
let Ξ¦ := Units.map H.toMonoidHom
have he : Ξ¦ (mixedInverseKernelUnit a a (SlopeArithmetic.slope c Ξ·) L.dim R.dim)=
Ξ¦ (mixedInverseKernelUnit a (fun i j=>a j i) (SlopeArithmetic.slope c Ξ·) L.dim R.dim) := by
apply Units.ext
change H _=H _
dsimp only [H,RingHom.comp_apply]
rw [refined_mixedKernel_degreeZero,refined_mixedKernel_degreeZero,
scalarCrossKernel_transpose a c η θ hχ L R hL hR]
have hh : Ξ¦ (braidingRatioUnit a (SlopeArithmetic.slope c Ξ·) L.dim R.dim)=1 := by
rw [braidingRatioUnit,map_mul,map_inv,he,mul_inv_cancel]
exact congrArg Units.val hh
end SeparationInfinity
end ElementaryPositivity.RawShuffle
end
end OAI