© Benjamin Rossman;. The n-variable PARITY function is computable (by a well-known recursive construction) by AC0 formulas of depth d + 1 and leafsize n·2dn1/d. These formulas are seen to possess a certain symmetry: they are syntactically invariant under the subspace P of even-weight elements in {0, 1}n, which acts (as a group) on formulas by toggling negations on input literals. In this paper, we prove a 2d(n1/d-1) lower bound on the size of syntactically P-invariant depth d + 1 formulas for PARITY. Quantitatively, this beats the best 2ω(d(n1/d-1)) lower bound in the noninvariant setting [16].