Download data/lean/OAI/Combinatorics/CompleteCrossing/AlgebraDefs.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.82 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/CompleteCrossing/AlgebraDefs.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/CompleteCrossing/AlgebraDefs.lean
-
curl -L -o AlgebraDefs.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/CompleteCrossing/AlgebraDefs.lean
6.82 kB
| import OAI.Combinatorics.Crossing.NodeMoments | |
| import Mathlib.Algebra.MvPolynomial.Degrees | |
| import Mathlib.Algebra.MvPolynomial.Rename | |
| import Mathlib.Algebra.Polynomial.Derivative | |
| import Mathlib.Data.Fin.VecNotation | |
| import Mathlib.Basic.Real.Basic | |
| import Mathlib.LinearAlgebra.Matrix.BilinearForm | |
| namespace OAI | |
| /-! Polynomial spaces, interpolation weights, crossing tensors, and support evaluation. -/ | |
| section | |
| /-! Polynomial spaces and crossing tensors for complete graphs. | |
| These definitions contain no mathematical theorem assumptions. -/ | |
| open scoped BigOperators Classical | |
| noncomputable section | |
| namespace Paper170 | |
| abbrev Poly2 := MvPolynomial (Fin 2) β | |
| abbrev Poly4 := MvPolynomial (Fin 4) β | |
| def nodeWeight {ΞΉ : Type*} [Fintype ΞΉ] (node : ΞΉ β β) (i : ΞΉ) : β := | |
| (Zarankiewicz.derivativeAtNode node i)β»ΒΉ | |
| def omittedNodePolynomial {ΞΉ : Type*} [Fintype ΞΉ] [DecidableEq ΞΉ] | |
| (node : ΞΉ β β) (i : ΞΉ) : Polynomial β := | |
| β j β Finset.univ.erase i, (Polynomial.X - Polynomial.C (node j)) | |
| def rectangle (a b : β) : Submodule β Poly2 := | |
| MvPolynomial.degreesLE β (Fin 2) | |
| (Multiset.replicate a 0 + Multiset.replicate b 1) | |
| def box4 (d : β) : Submodule β Poly4 := | |
| MvPolynomial.degreesLE β (Fin 4) (d β’ (Finset.univ : Finset (Fin 4)).val) | |
| def swapFirstPair : Poly4 ββ[β] Poly4 := | |
| (MvPolynomial.rename (Equiv.swap (0 : Fin 4) 1)).toLinearMap | |
| def swapSecondPair : Poly4 ββ[β] Poly4 := | |
| (MvPolynomial.rename (Equiv.swap (2 : Fin 4) 3)).toLinearMap | |
| def endpointSymmetricSpace (s : β) : Submodule β Poly4 := | |
| box4 (s - 2) β LinearMap.ker (swapFirstPair - LinearMap.id) β | |
| LinearMap.ker (swapSecondPair - LinearMap.id) | |
| def evalTwo (u v : β) : Poly2 ββ[β] β := | |
| (MvPolynomial.aeval ![u, v]).toLinearMap | |
| def evalFour (x u y v : β) : Poly4 ββ[β] β := | |
| (MvPolynomial.aeval ![x, u, y, v]).toLinearMap | |
| /-- The manuscript's one-based L_s, translated to zero-based Fin indices. -/ | |
| def evenTriangle (s : β) : Finset (Fin (2 * s) Γ Fin (2 * s)) := | |
| Finset.univ.filter fun pq => | |
| (pq.1.val < s β§ pq.2 < pq.1) β¨ (s β€ pq.1.val β§ pq.1 < pq.2) | |
| abbrev EvenTriangleCoord (s : β) := β₯(evenTriangle s) | |
| def triangleEvaluation (s a b : β) (node : Fin (2 * s) β β) : | |
| rectangle a b ββ[β] (EvenTriangleCoord s β β) := | |
| LinearMap.pi fun pq => | |
| (evalTwo (node pq.val.1) (node pq.val.2)).comp (rectangle a b).subtype | |
| def halfOrder {ΞΉ : Type*} (order : LinearOrder ΞΉ) (p q : ΞΉ) : β := | |
| letI := order | |
| if p < q then 1 / 2 else if q < p then -(1 / 2) else 0 | |
| def weightedPairing {ΞΉ : Type*} [Fintype ΞΉ] | |
| (node : ΞΉ β β) (K : ΞΉ β ΞΉ β β) (A B : Poly2) : β := | |
| β p, β q, K p q * (node p - node q) / | |
| (Zarankiewicz.derivativeAtNode node p * Zarankiewicz.derivativeAtNode node q) * | |
| evalTwo (node p) (node q) A * evalTwo (node p) (node q) B | |
| def orderPairing {ΞΉ : Type*} [Fintype ΞΉ] | |
| (node : ΞΉ β β) (order : LinearOrder ΞΉ) (A B : Poly2) : β := | |
| weightedPairing node (halfOrder order) A B | |
| abbrev CrossingTensor (n : β) := Fin n β Fin n β Fin n β Fin n β β | |
| def chainBoundary {n : β} (z : Fin n β Fin n β β) (v : Fin n) : β := | |
| (β i, z i v) - β p, z v p | |
| def chainPairing {n : β} (J : CrossingTensor n) | |
| (z z' : Fin n β Fin n β β) : β := | |
| β i, β p, β k, β q, J i p k q * z i p * z' k q | |
| def polynomialTest {n : β} (node : Fin n β β) (J : CrossingTensor n) | |
| (H : Poly4) : β := | |
| β i, β p, β k, β q, J i p k q * nodeWeight node i * nodeWeight node p * | |
| nodeWeight node k * nodeWeight node q * evalFour (node i) (node p) (node k) (node q) H | |
| /-- Canonical orientation within each edge; the two edges remain ordered. -/ | |
| def supportedPairs {n : β} (J : CrossingTensor n) : | |
| Finset ((Fin n Γ Fin n) Γ (Fin n Γ Fin n)) := | |
| Finset.univ.filter fun a => | |
| a.1.1 < a.1.2 β§ a.2.1 < a.2.2 β§ | |
| a.1.1 β a.2.1 β§ a.1.1 β a.2.2 β§ | |
| a.1.2 β a.2.1 β§ a.1.2 β a.2.2 β§ | |
| J a.1.1 a.1.2 a.2.1 a.2.2 β 0 | |
| abbrev SupportCoord {n : β} (J : CrossingTensor n) := β₯(supportedPairs J) | |
| def supportEvaluation {n : β} (s : β) (node : Fin n β β) (J : CrossingTensor n) : | |
| endpointSymmetricSpace s ββ[β] (SupportCoord J β β) := | |
| LinearMap.pi fun a => (evalFour (node a.val.1.1) (node a.val.1.2) | |
| (node a.val.2.1) (node a.val.2.2)).comp (endpointSymmetricSpace s).subtype | |
| /-- C=(x-y)(x-v)(u-y)(u-v), with coordinates x,u,y,v. -/ | |
| def collisionFactor : Poly4 := | |
| (MvPolynomial.X 0 - MvPolynomial.X 2) * | |
| (MvPolynomial.X 0 - MvPolynomial.X 3) * | |
| (MvPolynomial.X 1 - MvPolynomial.X 2) * | |
| (MvPolynomial.X 1 - MvPolynomial.X 3) | |
| /-- The complete six-difference product in the source's stated order. -/ | |
| def fullDifference : Poly4 := | |
| (MvPolynomial.X 0 - MvPolynomial.X 1) * | |
| (MvPolynomial.X 2 - MvPolynomial.X 3) * collisionFactor | |
| /-- Substitute x=y=t, leaving u,v as the two variables. -/ | |
| def vertexSpecialization (t : β) : Poly4 ββ[β] Poly2 := | |
| MvPolynomial.aeval ![MvPolynomial.C t, MvPolynomial.X 0, | |
| MvPolynomial.C t, MvPolynomial.X 1] | |
| /-- Substitute y=x, leaving x,u,v as three variables. -/ | |
| def diagonalSpecialization : Poly4 ββ[β] MvPolynomial (Fin 3) β := | |
| MvPolynomial.aeval ![MvPolynomial.X 0, MvPolynomial.X 1, | |
| MvPolynomial.X 0, MvPolynomial.X 2] | |
| def supportDiagonal {n : β} (node : Fin n β β) (J : CrossingTensor n) | |
| (a : SupportCoord J) : β := | |
| J a.val.1.1 a.val.1.2 a.val.2.1 a.val.2.2 * | |
| nodeWeight node a.val.1.1 * nodeWeight node a.val.1.2 * | |
| nodeWeight node a.val.2.1 * nodeWeight node a.val.2.2 * | |
| evalFour (node a.val.1.1) (node a.val.1.2) (node a.val.2.1) (node a.val.2.2) | |
| fullDifference | |
| def supportBilinear {n : β} (node : Fin n β β) (J : CrossingTensor n) : | |
| LinearMap.BilinForm β (SupportCoord J β β) := | |
| Matrix.toBilin' (Matrix.diagonal (supportDiagonal node J)) | |
| def weightedChain {n : β} (node : Fin n β β) (a b : β) (i p : Fin n) : β := | |
| nodeWeight node i * nodeWeight node p * node i ^ a * node p ^ b | |
| def collisionFactors : Fin 4 β Poly4 := | |
| ![MvPolynomial.X 0 - MvPolynomial.X 2, | |
| MvPolynomial.X 0 - MvPolynomial.X 3, | |
| MvPolynomial.X 1 - MvPolynomial.X 2, | |
| MvPolynomial.X 1 - MvPolynomial.X 3] | |
| def liftUnivariate (i : Fin 4) (U : Polynomial β) : Poly4 := | |
| Polynomial.aeval (MvPolynomial.X i) U | |
| def liftBivariate (i j : Fin 4) (B : Poly2) : Poly4 := | |
| MvPolynomial.aeval ![MvPolynomial.X i, MvPolynomial.X j] B | |
| def localTestPolynomial (P : Poly4) (U V : Polynomial β) (B : Poly2) : Poly4 := | |
| P * (MvPolynomial.X 1 - MvPolynomial.X 3) * | |
| (MvPolynomial.X 1 - MvPolynomial.X 2) * (MvPolynomial.X 3 - MvPolynomial.X 0) * | |
| liftUnivariate 0 U * liftUnivariate 2 V * liftBivariate 1 3 B | |
| end Paper170 | |
| end | |
| end | |
| end OAI | |