Documentation

Expdb.ExponentialSums.ExponentSumGrowth

Exponential sum growth exponents #

This module formalizes Definition 4.2 of the ANTEDB blueprint. It defines admissible model-phase bounds at a fixed scale and defines β(α) as the least such exponent.

Definition 4.2 at a glance #

For α : ℝ≥0, an exponent β is admissible if every model-phase exponential sum at scale N = T ^ (α + o(1)) is bounded by T ^ (β + o(1)). We show that the admissible exponents form [β(α), ∞) and then specialize the bound to the logarithmic model phase.

Definition 4.2 #

N = T ^ (α + o(1)), expressed using a variable exponent that is equal to α up to an infinitesimal.

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

    X ≪ T ^ (β + o(1)), expressed using a variable exponent that is equal to β up to an infinitesimal.

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

      The variable exponential sum ∑ n ∈ [a, b], e(T F(n / N)).

      Equations
      Instances For

        The assertion that β is an admissible exponential-sum growth exponent at scale α.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          noncomputable def Expdb.exponentSumGrowthExponent (α : NNReal) :

          The exponential sum growth exponent β(α) from Definition 4.2 of the blueprint.

          Equations
          Instances For

            Power asymptotics #

            theorem Expdb.IsPowerAsymptotic.eventually_between {N T : VariableObject } {α ε : } (hNT : IsPowerAsymptotic N T α) (hT : ∀ᶠ (i : ) in Filter.atTop, 1 T i) ( : 0 < ε) :
            ∀ᶠ (i : ) in Filter.atTop, T i ^ (α - ε) N i N i T i ^ (α + ε)

            If N = T ^ (α + o(1)), then N eventually lies between the powers with exponents α - ε and α + ε.

            Power bounds #

            theorem Expdb.isPowerBounded_iff_forall_pos {E : Type u_1} [SeminormedAddCommGroup E] (X : VariableObject E) (T : VariableObject ) (β : ) (hT : ∀ (i : ), 1 T i) (hTunbounded : T.IsUnbounded) :
            IsPowerBounded X T β ∀ (ε : ), 0 < εX =O[Filter.atTop] fun (i : ) => T i ^ (β + ε)

            If T is at least one and unbounded, then X ≪ T ^ (β + o(1)) iff X = O(T ^ (β + ε)) for every fixed ε > 0.

            Admissible exponents #

            The candidate set is upward closed, nonempty, and bounded below.

            Monotonicity #

            theorem Expdb.IsExponentSumBound.mono {α : NNReal} {β γ : } ( : IsExponentSumBound α β) (hβγ : β γ) :

            Admissible exponential-sum bounds are monotone in the exponent.

            Nonemptiness and lower bound #

            The triangle inequality gives the admissible exponent α.

            theorem Expdb.IsExponentSumBound.nonneg {α : NNReal} {β : } ( : IsExponentSumBound α β) :
            0 β

            Every admissible exponent at a nonnegative scale is nonnegative.

            The least admissible exponent #

            By underspill, the infimum of the admissible exponents is itself admissible.

            The defining universal property of the exponential sum growth exponent.

            The exponent sum growth exponent is the least admissible exponent.

            At scale α, the admissible exponents form the interval [β(α), ∞).

            The set of admissible exponential-sum exponents at scale α is closed.

            Logarithmic model phase #

            theorem Expdb.isPowerBounded_logPhase (α : NNReal) {N T : VariableObject } {a b : VariableObject } (hN : ∀ (i : ), 1 N i) (hT : ∀ (i : ), 1 T i) (hTunbounded : T.IsUnbounded) (hNT : IsPowerAsymptotic N T α) (hab : ∀ (i : ), N i (a i) (b i) 2 * N i) :

            The least admissible exponent bounds the logarithmic model-phase sum.