Uniformity norms, their weaker versions, and applications

Abstract

We show that, under some mild hypotheses, the Gowers uniformity norms (both in the additive and in the hypergraph setting) are essentially equivalent to certain weaker norms which are easier to understand. We present two applications of this equivalence: a variant of the Koopman--von Neumann decomposition, and a proof of the relative inverse theorem for the Gowers $U^s[N]$-norm using a norm-type pseudorandomness condition.