Generation-time composition and Rouquier dimension #
This file applies the generic envelope-composition law to the repository's ℕ∞-valued
generation time and Rouquier dimension.
Main definitions #
This file introduces no definitions; it reuses CategoryTheory.ObjectProperty.generationTime,
CategoryTheory.Triangulated.rouquierDim, and Mathlib's
CategoryTheory.ObjectProperty.triangEnvelopeIter tower.
Main results #
CategoryTheory.ObjectProperty.generationTime_add_one_submultiplicative: generation time plus one is submultiplicative.CategoryTheory.Triangulated.isStrongTriangulatedGenerator_of_classical_of_rouquierDim_ne_top: finite Rouquier dimension makes classical generators strong.CategoryTheory.Triangulated.generationTime_ne_top_of_classical_of_rouquierDim_ne_top: finite Rouquier dimension bounds the generation time of every classical generator.
Implementation notes #
The +1 records the shift between iterated-envelope indices and Rouquier's stage indices:
CategoryTheory.ObjectProperty.triangEnvelopeIter P n is stage n + 1. This form handles
infinite values without subtracting one from an ℕ∞ bound. The expanded expression
a * b + a + b is ⊤ if either input is ⊤;
0 * ⊤ = 0 is relevant only to a bare product.
References #
- Raphaël Rouquier, Dimensions of triangulated categories.
- The Stacks Project, Section 13.36, Lemma 13.36.6, tag 0FXA.
Mathlib.CategoryTheory.Triangulated.Generators
Tags #
generation time, Rouquier dimension, triangulated category, submultiplicativity
Generation time plus one is submultiplicative.
The additive law CategoryTheory.ObjectProperty.generationTime P R ≤ CategoryTheory.ObjectProperty.generationTime P Q + CategoryTheory.ObjectProperty.generationTime Q R is false.
For a counterexample, take the bounded derived category of finite-length modules over
A = k[t]/(t^6), let S = A/(t), T = A/(t^3), P = singleton S,
Q = singleton T, and R = singleton A. Then
CategoryTheory.ObjectProperty.generationTime P Q = 2 by the length-three composition
series, and CategoryTheory.ObjectProperty.generationTime Q R = 1 by the exact sequence
0 → t^3 A → A → T → 0, since t^3 A ≃ T. Objects in
CategoryTheory.ObjectProperty.triangEnvelopeIter P n have cohomology modules of Loewy length
at most n + 1: this holds
for shifts, finite sums, and retracts at stage zero, and each extension by a semisimple module
adds at most one Loewy layer. This bound makes the generation times exact: T has Loewy
length three, while A has Loewy length six, a length-six composition series, and a filtration
by two copies of T. Also, A is not in CategoryTheory.ObjectProperty.triangEnvelopeIter Q 0,
whose cohomology modules have Loewy length at most three, so
CategoryTheory.ObjectProperty.generationTime Q R = 1. Thus
CategoryTheory.ObjectProperty.generationTime P R = 5, while additivity would give
5 ≤ 2 + 1, which is false. In tower indices,
the iter 2 then iter 1 composition lands in iter 5; additivity predicts iter 3,
which is Rouquier's ⟨P⟩₄. The composition law gives the upper bound
⟨P⟩₃ ⋆ ⟨P⟩₃ ⊆ ⟨P⟩₆.
Finite Rouquier dimension supplies a strongly generating singleton; the bounded Stacks
comparison transfers its finite stage to P.
The strong-generation result and the generation-time characterization of strong generators give the finite generation-time bound.