For a vector space F n over a field F , an ( ) -dimension expander of degree d is a collection of d linear maps j : F n F n such that for every subspace U of F n of dimension at most n , the image of U under all the maps, d j =1 j ( U ) , has dimension at least dim ( U ) . Over a finite field, a random collection of d = O (1) maps j offers excellent "lossless'' expansion whp: d for (1 d ) . When it comes to a family of explicit constructions (for growing n ), however, achieving even modest expansion factor = 1 + with constant degree is a non-trivial goal.

We present an explicit construction of dimension expanders over finite fields based on linearized polynomials and subspace designs, drawing inspiration from recent progress on list decoding in the rank-metric. Our approach yields the following:

* Lossless expansion over large fields; more precisely ( 1 − ) d and d 1 − with d = O (1) , when F ( n ) .

* Optimal up to constant factors expansion over fields of arbitrarily small polynomial size; more precisely ( d ) and (1 ( d )) with d = O (1) , when F n .

Previously, an approach reducing to monotone expanders (a form of vertex expansion that is highly non-trivial to establish) gave ( (1) 1 + (1)) -dimension expanders of constant degree over all fields. An approach based on "rank condensing via subspace designs'' led to dimension expanders with ( d ) over large finite fields. Ours is the first construction to achieve lossless dimension expansion, or even expansion proportional to the degree.