Koszul flattenings #
Let A = ℂ^α with basis a_i, where α is a finite linearly ordered type. The exterior
power Λ^p A has the basis e_I = a_{i₁} ∧ ⋯ ∧ a_{i_p} indexed by the p-element subsets
I = {i₁ < ⋯ < i_p} of α. Moving a_i past the factors of e_I below i gives the sign
convention used here:
a_i ∧ e_I = (-1)^#{x ∈ I | x < i} e_{I ∪ {i}} if i ∉ I, and a_i ∧ e_I = 0 if i ∈ I.
Tensor3.wedgeCoeff J I iis the coefficient ofe_Jina_i ∧ e_I.Tensor3.wedgeMatrix p uis the matrix ofX ↦ u ∧ X : Λ^p A → Λ^{p+1} Aforu ∈ A; its rows are indexed by(p + 1)-subsets and its columns byp-subsets ofα.Tensor3.koszulFlattening p Tis the Koszul flatteningT_A^{∧p} : Λ^p A ⊗ B^* → Λ^{p+1} A ⊗ CofT = ∑ T i j k a_i ⊗ b_j ⊗ c_k(Landsberg and Michałek, Towards finding hay in a haystack, Theory of Computing 2025, §4.1), which sendse_I ⊗ b_j^*to∑_{i,k} T i j k (a_i ∧ e_I) ⊗ c_k. Its rows are indexed by pairs(J, k)of a(p + 1)-subsetJofαandk : γ, its columns by pairs(I, j)of ap-subsetIofαandj : β, and its((J, k), (I, j))entry is the(J, I)entry ofwedgeMatrix p (T · j k).
The border-rank lower bound rank T_A^{∧p} ≤ borderRank T * (card α - 1).choose p is in
Complexitylib.Algebraic.LinearAlgebra.Tensor.Koszul.
The coefficient of e_J in a_i ∧ e_I: (-1)^#{x ∈ I | x < i} if i ∉ I and
J = I ∪ {i}, and 0 otherwise.
Equations
Instances For
The matrix of X ↦ u ∧ X : Λ^p ℂ^α → Λ^{p+1} ℂ^α in the bases e_I: its (J, I) entry is
∑ i, wedgeCoeff J I i * u i.
Equations
Instances For
The Koszul flattening T_A^{∧p} : Λ^p A ⊗ B^* → Λ^{p+1} A ⊗ C,
e_I ⊗ b_j^* ↦ ∑_{i,k} T i j k (a_i ∧ e_I) ⊗ c_k. Its ((J, k), (I, j)) entry is
∑ i, wedgeCoeff J I i * T i j k.
Equations
- One or more equations did not get rendered due to their size.