Documentation

Complexitylib.Algebraic.LinearAlgebra.Tensor.Explicit.Defs

The paired-cluster Koszul bound #

The explicit border-rank lower bounds for the weighted Landsberg–Michałek tensors Tensor3.weightedLMTensor k (Complexitylib.Algebraic.LinearAlgebra.Tensor.Explicit) and for the periodic ones Tensor3.periodicLMTensor k A M (Complexitylib.Algebraic.LinearAlgebra.Tensor.Periodic) combine border substitution, the deletion game, and a greedy choice of clusters with one local input: a Koszul-flattening bound for a pair of clusters of 2p + 1 slices, one with positive and one with negative offsets. This file states that input as the property Tensor3.PairedKoszulBoundOn T p L E of a tensor T with 2k + 1 slices, the interface between the paired-cluster certificate and the assembly, and Tensor3.PairedKoszulBound k p L E for T = weightedLMTensor k. The certificate (Tensor3.div_mul_phi_sub_le_borderRank_restrictSlices_lmTensor, in Complexitylib.Algebraic.LinearAlgebra.Tensor.Diagonal.Paired) proves it with E = 8 (p + 1) L for every T_k(γ) whose coefficients γ a j = 2^{2^{e a j}} have labels separating a window of L slices and p L columns: for all k, p, and L when T = weightedLMTensor k (Tensor3.pairedKoszulBound), and for L < A, p L < M when T = periodicLMTensor k A M (Tensor3.pairedKoszulBoundOn_periodicLMTensor).

PairedKoszulBoundOn T p L E says: for every set S of slices of T and every two strictly increasing clusters c⁺, c⁻ : Fin (2p+1) → Fin (2k+1) such that

the slice restriction of T to S has border rank at least (2p + 1) / (p + 1) * (Φ_{2k+1}(r, s) - E), where r = c⁺ p - k and -s = c⁻ p - k are the median offsets and Φ is DeletionGame.phi.

def Algebraic.Tensor3.PairedKoszulBoundOn {k : ℕ} {β : Type u_1} {γ : Type u_2} (T : Tensor3 (Fin (2 * k + 1)) β γ) (p L : ℕ) (E : ℝ) :

The paired-cluster Koszul bound for a tensor T with 2k + 1 slices, clusters of 2p + 1 slices, cluster diameter L, and error E. For every set S of slices and every two strictly increasing clusters cp (offsets cp t - k in [1, k]) and cn (offsets in [-k, -1]) inside S, each with pairwise distinct p-subset sums of offsets and with diameter at most L, the restriction of T to S has border rank at least (2p + 1) / (p + 1) * (Φ_{2k+1}(r, s) - E), where r = cp p - k and s = -(cn p - k).

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The paired-cluster Koszul bound for weightedLMTensor k: the property PairedKoszulBoundOn (weightedLMTensor k) p L E. For every set S of slices and every two strictly increasing clusters cp (positive offsets in [1, k]) and cn (negative offsets in [-k, -1]) inside S, each with pairwise distinct p-subset sums of offsets and with diameter at most L, the restriction of weightedLMTensor k to S has border rank at least (2p + 1) / (p + 1) * (Φ_{2k+1}(r, s) - E), where r = cp p - k and s = -(cn p - k).

    Equations
    Instances For