An analytic upper bound that controls the maximum size of a partial sum of a nonprincipal Dirichlet character modulo q, typically stated as S(χ;N):=|sum_{n=1}^N χ(n)| = O(√q log q) uniformly in N for any nonprincipal character χ (with implied constants depending on conventions).

Principle

Exploit orthogonality and completion techniques to convert character sums into manageable expressions and extract cancellation up to the square-root barrier, with a logarithmic loss coming from discrete summation and smoothing arguments.

Demonstration

For a primitive nonprincipal character χ modulo q, consider the completed sum via Fourier inversion or summation by parts; the Pólya–Vinogradov inequality yields max_{1≤N≤q} |∑_{n≤N} χ(n)| ≪ √q log q, showing that no partial sum can persistently reach the trivial order q.

Misapplication

Applying the inequality to the principal character (which has trivial partial sums of order N) or treating the O(√q log q) bound as an equality for typical characters; another misuse is to apply it indiscriminately to very short sums where other bounds (e.g., Burgess) are stronger.

Consequence

Provides a universal, easy-to-state nontrivial bound for character sums that feeds into estimates for L-functions, primes in arithmetic progressions, and other analytic results where control of character sums over long intervals is required.

Reversal

If a character exhibited no cancellation at all, its partial sums could grow linearly with N up to about q; the Pólya–Vinogradov inequality rules out such sustained linear growth for nonprincipal characters by giving the √q log q ceiling.

Boundary

Applies only to nonprincipal Dirichlet characters modulo q and addresses maximal partial sums over ranges up to length about q; constants and the exact logarithmic factor depend on normalization and whether χ is primitive.

Semantic Tension

Competes with other bounds for character sums: the Pólya–Vinogradov bound is simple and uniform but weaker than Burgess-type estimates for shorter sums and distinct in scope from asymptotic formulas that hold under GRH or deep analytic hypotheses.

Synthesis

A robust, general-purpose upper bound asserting that nonprincipal Dirichlet characters cannot maintain large partial sums: by combining orthogonality and smoothing, one achieves a √q-scale obstruction with a modest logarithmic inefficiency that is widely used when finer short-interval tools are unavailable.