We provide an elementary proof of the fixpoint alternation hierarchyin arithmetic, which in turn allows us to simplify the proof of themodal mu-calculus alternation hierarchy. We further show that thealternation hierarchy on the binary tree is strict, resolving aproblem of Niwiński.