Documentation

Complexity.Foundations.Combinatorics.Expander.AffineFamily

Arithmetic expanders on every vertex count #

The affine-plane base, recursive tower numbering, and bounded-fiber contraction give a computable rotation on exactly Fin n for every n. An explicit numbering of a field of size q ≥ 256 gives degree 2*q^12 and spectral expansion at most 1 - 9/(400*q^16).

arithmeticExpander instantiates the construction at ZMod 257, using its arithmetic equivalence with Fin 257. It performs no finite graph search or nonconstructive enumeration. The constants are enormous: executing one rotation and enumerating all edges are very different workloads. The uniform polynomial-time realization is certified in Computability/Machines/Turing/MultiTape/Complexity/PolyTime/RotationMap/Family; it constructs complete tables in time polynomial in the vertex count, rather than in its bit length.

Main definitions #

Main results #

References #

Number eight field coordinates by pairing their explicit indices, without enumeration.

Instances For
    @[reducible, inline]

    The fixed label type of the contracted lazy arithmetic tower over a field with q elements.

    Instances For
      def Cslib.RotationMap.affinePlaneFamily {K : Type u_1} {q : ℕ} [Field K] (numbering : K ≃ Fin q) (hq : 1 < q) (n : ℕ) :

      Use a numbered field as an arithmetic base, then contract the tower to the requested size.

      Instances For
        theorem Cslib.RotationMap.card_affinePlaneFamilyLabel {K : Type u_1} {q : ℕ} [Fintype K] (numbering : K ≃ Fin q) :

        The arithmetic family has degree 2*q^12, independently of the requested vertex count.

        theorem Cslib.RotationMap.spectralExpansion_affinePlaneFamily_le {K : Type u_1} {q : ℕ} [Field K] [Fintype K] (numbering : K ≃ Fin q) (hq : 256 ≤ q) (n : ℕ) :
        (affinePlaneFamily numbering ⋯ n).spectralExpansion ≤ 1 - 9 / (400 * ↑q ^ 16)

        A numbered field with at least 256 elements yields a positive uniform spectral gap.

        A concrete arithmetic expander on exactly n vertices, with a fixed degree.

        Instances For

          The concrete family has a positive spectral gap independent of n.

          Every member of the concrete family has positive spectral gap.

          The arithmetic construction interpreted as an expander family on arbitrary finite types. The numbering chosen by this wrapper is noncomputable; arithmeticExpander itself is executable on Fin n, and an explicit equivalence allows executable transport to other representations.

          Instances For