1. The question
Solving algebraic relations often proceeds in stages: describe generators, then relations among them, then relations among those relations, and so on. A projective resolution records this process. Some modules require infinitely many stages; others eventually terminate.
The little finitistic-dimension conjecture asks a subtle uniformity question. For one fixed finite-dimensional algebra, is there a common upper bound on the lengths of all the resolutions that do terminate?
Family 198 claims a negative answer over the complex numbers. It constructs a single finite-dimensional algebra with finite-dimensional modules whose projective dimensions are finite but arbitrarily large. Changing the module does not change the algebra. That fixed-algebra requirement is the central distinction between the claimed counterexample and familiar families of increasingly complicated algebras.
2. Background and essential definitions
Resolutions and projective dimension
A finite-dimensional complex algebra is a finite-dimensional vector space with associative multiplication and an identity. It need not be commutative. A left -module is a vector space on which algebra elements act linearly and compatibly with multiplication.
A free module is a direct sum of copies of . A projective module is a direct summand of a free module. Projective modules are the building blocks used in resolutions because maps from them lift through surjections.
A finite projective resolution of a module has the form
where each is projective and the sequence is exact. Exactness says that each stage records precisely the relations left by the previous one. The least possible is the projective dimension . If no finite resolution exists, the dimension is infinite.
For a finite-dimensional algebra, a finitely generated module is also finite-dimensional over the coefficient field. Its successive kernels in a projective resolution are called syzygies.
Three suprema with different meanings
The global dimension takes a supremum over projective dimensions without discarding infinite values. The little finitistic dimension instead keeps only finite projective dimensions of finitely generated modules:
The big finitistic dimension, written , permits all modules, including infinitely generated ones, while still retaining only those of finite projective dimension. Therefore the little dimension is at most the big one.
An algebra can have modules of infinite projective dimension and nevertheless have finite finitistic dimension. Such modules are excluded from the defining supremum. The counterexample must supply increasingly long finite resolutions, not simply one infinite resolution.
For a noncommutative algebra, left and right modules need not behave alike. Right -modules are left modules over the opposite algebra , whose multiplication reverses the order of factors.
3. Development history and previous partial results
Bass publicized finitistic-dimension questions in 1960. Two questions must be distinguished: whether little and big finitistic dimensions are equal, and whether they are finite.
Huisgen-Zimmermann disproved equality by constructing, for each , a finite-dimensional monomial algebra with little dimension and big dimension . Those examples vary with , and both dimensions remain finite for each algebra. They therefore do not refute the universal finiteness conjecture.
Several large classes satisfy little finitistic finiteness. Green, Kirkman, and Kuzmanovich proved it for finite-dimensional monomial algebras, whose defining relations are paths rather than linear combinations of paths. Green and Huisgen-Zimmermann proved it for Artin algebras with radical cube zero. The radical is the ideal carrying the algebra’s nonsemisimple behavior; requiring its cube to vanish restricts how long products of such elements can persist.
Igusa and Todorov introduced syzygy invariants giving another proof of the radical-cube-zero case and finiteness for representation dimension at most three. These results show that homological complexity is bounded under important structural restrictions, without settling arbitrary finite-dimensional algebras.
Cummings later proved an equivalence between universal little finitistic finiteness and a universal left–right symmetry assertion for finiteness. This provides a way to convert a counterexample into pronounced asymmetry, but is not itself a construction of infinite finitistic dimension.
Rickard established another connection: if injective modules generate the unbounded derived category in the appropriate sense, then big finitistic dimension is finite. Derived categories organize complexes while identifying maps that preserve homology; allowing arbitrary coproducts permits infinite direct sums. The new counterexample therefore has a consequence for injective generation as well.
The construction draws on universal localization and on formulas for trivial extension algebras developed by Minamoto and Yamaura. A separate characteristic-two construction in family 199 also claims infinite finitistic dimension. The present manuscript emphasizes that its complex example is distinct and constructed independently.
4. What the new manuscripts claim
The manuscript, dated 23 September 2026, claims a finite-dimensional unital complex algebra such that for every integer , there is a finite-dimensional left module with
The same works for all . Hence
The second equality follows because the big supremum includes all the modules already witnessing the first. This also refutes the corresponding universal finiteness statement for Artin algebras, since finite-dimensional complex algebras belong to that class.
By Rickard’s theorem, injective left -modules do not generate the unbounded derived category of all left modules.
An auxiliary algebra with opposite extremes
Combining the example with Cummings’ triangular-algebra construction, the manuscript claims another finite-dimensional complex algebra satisfying
while
All displayed dimensions use left modules. Thus has infinite finitistic dimensions on the left and zero on the right. Its injective left modules do not generate, whereas its injective right modules do.
This is a statement about the auxiliary . The manuscript makes no corresponding right-side assertion about the original algebra . Keeping the two algebras separate prevents an unjustified strengthening of the main construction.
5. Why the advance matters
Provisional importance: 5/5. If correct, the example disproves a central conjecture in the representation theory and homological algebra of finite-dimensional algebras.
Its force comes from the difference between finite description and uniformly bounded homological behavior. A fixed algebra has finitely many basis elements and a finite multiplication table, yet the claimed modules can encode terminating processes of arbitrarily large depth.
The consequences also challenge expectations of symmetry. The auxiliary algebra would support arbitrarily long finite resolutions on one side while every module of finite projective dimension on the other side is already projective. This does not make left and right global behavior identical to those finite suprema; it identifies an extreme asymmetry in the specific finitistic invariants.
6. The main idea
Start with a process that eventually dies, but at no fixed time
The first stage constructs a finitely presented auxiliary complex algebra , a central idempotent , and an automorphism . A central idempotent satisfies and commutes with the algebra, so is a direct summand of every module .
Define a selection operation by taking and changing its action through . The manuscript constructs finite-dimensional modules satisfying
The auxiliary algebra is a group algebra whose group contains an indexed family of central involutions. The automorphism shifts that family. Finite matrix quotients detect arbitrarily long independent segments, and prescribed characters make selection survive for exactly the desired number of rounds.
At this stage, is finitely presented but need not be finite-dimensional. The remaining work is to encode its selection behavior inside one finite-dimensional algebra without changing the encoding when changes.
Simulate selection with a fixed derived tensor operation
A quadratic presentation of is encoded in a directed algebra with three vertices and global dimension at most two. A module places the vector space at each vertex, with arrows recording the generator actions.
The manuscript constructs one bounded complex of -bimodules such that
A bimodule has compatible left and right actions. The derived tensor product uses resolutions so that it retains higher homological information. The symbol shifts a complex’s degree by three. Thus the formula simulates selection twice in different degrees, rather than demanding that one selected summand lift by itself.
Uniformity is the key issue. Denominators are cleared for a single finite diagram before any test module is chosen. Relations initially hold only up to chain homotopy; extra terms in a three-column differential turn those homotopies into an actual bimodule complex. The separation between the two surviving degrees exceeds ‘s global dimension, giving the displayed splitting. The argument does not need a splitting chosen naturally for every module simultaneously.
Turn survival time into resolution length
A further finite-dimensional construction replaces the bounded complex by an ordinary bimodule over an algebra of finite global dimension. Let
Two iterations of simulate one selection step, up to fixed shifts and direct sums. The final algebra is the trivial extension
whose underlying vector space is , with multiplication
In particular, the ideal has square zero. This does not say that the radical of the whole algebra has cube zero; the earlier positive theorem for that class is not being contradicted.
For an inflated -module , the bar construction decomposes the relevant derived tensor expression according to the number of occurrences of :
The manuscript treats derived powers explicitly, including when is not flat. Eventual disappearance of the iterates implies finite projective dimension, while a nonzero -th iterate forces projective dimension at least .
For , it obtains but . These give the finite upper status and the lower bound . All algebras, complexes, and bimodules were fixed beforehand; only the test module varies.
7. Scope, limitations, and open questions
The lower bound is not an assertion that equals exactly . The theorem needs finiteness and unboundedness, which are established by different parts of the transfer.
The coefficient field is . The manuscript does not claim the identical construction over every field; its characteristic-two comparison comes from a separate companion.
The result does not imply that all modules have finite projective dimension. Nor does it alter the positive theorems for monomial algebras, radical-cube-zero algebras, or the other restricted classes described earlier.
The extreme right-side conclusions belong to , not automatically to . More explicit small examples, quantitative upper bounds for the particular test modules, and classifications of the remaining positive classes are separate questions from the universal counterexample.
8. Sources and further reading
Bass’s Finitistic dimension and a homological generalization of semi-primary rings (1960) is the historical starting point. Huisgen-Zimmermann’s survey distinguishes the equality and finiteness questions and describes earlier positive results.
Igusa and Todorov’s On the finitistic global dimension conjecture for Artin algebras (2005) develops syzygy invariants. Cummings’ Left–right symmetry of finite finitistic dimension (2024) supplies the auxiliary asymmetry construction.
Neeman, Ranicki, and Schofield’s universal-localization work and Minamoto–Yamaura’s trivial-extension formulas explain the encoding and transfer background. Rickard’s injective-generation theorem supplies the derived-category consequence.
Source manuscripts
- M1. OpenAI, An algebra of infinite little finitistic dimension (September 23, 2026).
Sources consulted on 21 October 2026 at repository revision 1581d4c. Download the manuscript citations.