“…⊕ X ⊗m k , with m i ≤ m. With respect to this filtration, we show that Z(Rep S t ) ≤k,m is equivalent to the ultraproduct of the categories Z(Rep Fp i S n i ) ≤k,m with partially defined monoidal and additive structures, see Proposition 3.1. In particular, this enables us to solve the question of semisimplicity of Z(Rep S t ) raised in [FL21,Question 3.31 for every n ≥ 0 and t ∈ C. This functor Ind is a separable Frobenius monoidal functor compatible with the braidings, see Proposition 3.7. It enables us to classify the indecomposable objects in Z(Rep S t ).…”