Ultraviolet Renormalization and Locality

Ultraviolet renormalization is organized around one structural fact: after subdivergences are treated recursively, short-distance ambiguities are local. They can therefore be absorbed into the finite set of local parameters and field normalizations allowed by the declared symmetries and approximation order. A prediction is complete only after those parameters are fixed by renormalization conditions, the auxiliary regulator is removed or controlled, and the remaining scheme dependence is shown to be beyond the calculated order.

The chapter builds that claim in ten steps. It first diagnoses ultraviolet sensitivity and counts possible divergences; then it separates regulator choice from subtraction, proves the need for local recursive counterterms, constructs renormalized perturbative rules, enforces symmetry identities, compares finite schemes, and ends with an observable regulator-removal test. The logical order matters: a finite-looking integral does not establish locality, and a list of counterterms does not establish a regulator-independent prediction.

The local ultraviolet problem

This chapter develops perturbative ultraviolet renormalization for local QFT: superficial and subgraph degree, regulator tradeoffs, dimensional and minimal subtraction, counterterm locality, forest recursion, renormalized fields and parameters, symmetry-compatible counterterms, finite scheme maps, and regulator removal. Its representative setting is a perturbative local action with a declared field content and symmetry, usually illustrated by four-dimensional scalar theory before gauge identities are added.

The evaluation and reduction of loop integrals remain in Loop Integrals and Reduction. Ward, Slavnov–Taylor, and BRST identities come from Symmetry and Gauge Structure; this chapter shows how those identities restrict the counterterm space. It stops before model-specific renormalization constants and precision inputs in Gauge Theories and the Standard Model, lattice continuum extrapolations in Lattice and Hamiltonian Field Theory, and theorem-first BPHZ, Epstein–Glaser, or constructive existence results in Mathematical Quantum Field Theory.

The locality statement is perturbative and conditional. It assumes a local starting interaction, a regulator/subtraction framework in which the relevant asymptotic expansion is valid, and inclusion of every symmetry-allowed counterterm required at the working order. It is not a proof that a perturbatively renormalizable Lagrangian defines a nonperturbative continuum QFT. Collins gives the chapter’s main perturbative construction, including subdivergences, forests, locality, and minimal subtraction Collins 1984/2023, ch. 5, pp. 88–137.

Check your preparation

This diagnostic routes study; it is not a scored assessment. A “ready” answer means that the named entry can be used without silently importing missing notation.

Can you perform this task?	Ready: enter here	Unsure: what to check	Repair
Distinguish a singular coincident product from a separated-point correlation function	Ultraviolet sensitivity	Ask which local distributions must be extended at coincidence and which separated-point dependence is already fixed	Coincident Products and Contact Terms
Read a Feynman graph with loop number, internal lines, external legs, and symmetry factor	Power counting	Verify $L=I-V+1$ for a connected graph and identify all proper 1PI subgraphs	Diagrammatics and Symmetry Factors
Explain why a scaleless dimensional integral may contain cancelling UV and IR information	Dimensional regularization and MS	Introduce a mass, external momentum, or explicit UV/IR labels before declaring the integral zero	Dimensional Regularization as an Amplitude Tool and the UV/IR pole interface
Distinguish a local polynomial in external momenta from a threshold logarithm or branch cut	Counterterm locality	Fourier transform a polynomial and identify its support at coincident points	Products, Scaling Degree, and Extensions of Singular Distributions
State the functional identity that a gauge-fixed calculation must satisfy	Symmetry constraints after the core counterterm chain	Identify the gauge-fixed action, sources, ghost number, and linearized identity operator	Slavnov–Taylor and Zinn-Justin Identities
Impose a physical or momentum-subtraction condition on a two-point function	Schemes and finite parts	Specify which pole, residue, Euclidean momentum point, or other datum is held fixed	The 1PI Effective Action and Mean-Field Equations

If only the first conceptual distinction is needed, begin with ultraviolet sensitivity and stop after the regulator-removal page. If an explicit multiloop graph is the goal, the graph and integral prerequisites are genuinely hard: forest recursion cannot compensate for an incorrectly specified graph or singular region.

Choose a route

In the table, ⇒ marks a required dependency and → a useful continuation. A plus sign means both inputs are needed.

Goal	Route	Result and stopping point
First graduate encounter	Ultraviolet sensitivity ⇒ power counting → regulator families ⇒ dimensional regularization and MS + counterterm locality ⇒ forests ⇒ renormalized rules → schemes ⇒ regulator removal	Construct a finite scalar prediction with its inputs, subtraction prescription, and removal test explicit. Add the symmetry branch when the theory has a nontrivial functional identity.
Diagnose which counterterms can occur	Ultraviolet sensitivity + diagrammatics ⇒ power counting → symmetry constraints	List the local structures allowed by degree and symmetry. Stop before claiming that the recursive subtraction has been performed.
Renormalize a graph with overlapping divergences	Power counting + counterterm locality ⇒ R-operation and forests ⇒ renormalized rules	Produce the admissible forests, counterterm insertions, and finite remainder. Integration and reduction of the resulting terms remain in Volume 4.
Compare regulators	Ultraviolet sensitivity ⇒ regulator families → dimensional regularization and MS → schemes and finite parts ⇒ regulator removal	Hold the same renormalized inputs fixed and compare invariant outputs, rather than comparing bare parameters term by term.
Preserve gauge symmetry	Core chain through renormalized rules + Slavnov–Taylor identities ⇒ symmetry constraints	Determine whether a breaking is removable by a local finite counterterm or is a cohomological obstruction. Stop before model-specific anomaly cancellation or coefficient tables.
Translate between schemes	Dimensional regularization and MS ⇒ schemes and finite parts ⇒ regulator removal	Derive a finite parameter map and verify equality of one physical prediction through the retained order.
Check the scalar benchmark computationally	Core chain through renormalized rules → cutoff/dimensional comparison	Compare a hand calculation with the forest and scheme-map benchmarks. The chapter contains the analytic reference for every check.
Seek theorem-first control	Counterterm locality → forests → Mathematical Quantum Field Theory	Translate the physical claim into the exact hypotheses of BPHZ, distribution extension, Epstein–Glaser, or constructive treatment.

The ten pages in order

The sidebar follows the dependency spine. Focused routes may omit optional branches, but each accepted page appears once here in canonical order.

Ultraviolet Sensitivity and the Renormalization Problem explains why short-distance singularities demand local input without making every parameter arbitrary. It requires coincident products and contact terms; continue when you can separate regulator-dependent terms, renormalized inputs, and observable momentum dependence.
Power Counting of Divergences and Perturbative Renormalizability computes superficial and subgraph degrees and applies symmetry filters. It requires ultraviolet sensitivity and diagrammatic bookkeeping; continue to regulator choice or counterterm locality after listing all potentially divergent subgraphs.
QFT Regulator Families and Their Tradeoffs compares hard and smooth cutoffs, Pauli–Villars and higher-derivative methods, dimensional and analytic continuation, and lattice regularization. It requires ultraviolet sensitivity; use it to choose which properties are manifest and which identities require restoration or extrapolation evidence.
Dimensional Regularization and Minimal Subtraction separates dimensional continuation as an amplitude tool from MS and $\overline{\rm MS}$ as subtraction schemes. It requires the regulator comparison and dimensional regularization in amplitudes; continue after tracing the measure, pole, and finite scale logarithm without mixing ultraviolet and infrared origins.
Local Counterterms and Subdivergence Structure shows why ultraviolet subtraction ambiguities are polynomials in external momenta and therefore local in position space. It requires ultraviolet sensitivity, power counting, and the free Wick theorem; continue to forest recursion after distinguishing those polynomials from physical nonlocal logarithms and cuts.
The R-Operation, Forest Formula, and Overlapping Divergences gives the recursive combinatorics for nested, disjoint, and overlapping divergent subgraphs. It requires both power counting and counterterm locality; continue after constructing the admissible forest set without double subtraction.
Renormalized Perturbation Theory and Counterterm Rules rewrites bare fields and parameters in terms of renormalized quantities and derives counterterm vertices with loop order fixed. It requires forests and dimensional/MS conventions; continue when every contribution required for the requested order has been included.
Symmetry Constraints and the Space of Counterterms restricts local counterterms using Ward, Slavnov–Taylor, or BRST identities and distinguishes removable regulator breaking from anomaly. It requires the renormalized rules and Slavnov–Taylor/Zinn-Justin identities; model-specific symmetry restoration exits to Volume 6.
Renormalization Conditions, Schemes, and Finite Parts compares on-shell, momentum-subtraction, and mass-independent schemes through finite parameter maps. It requires dimensional/MS conventions; continue after demonstrating equality of a physical prediction through the calculated order rather than equality of intermediate parameters.
Regulator Removal and Renormalized Predictions assembles the chapter’s validation record: fixed renormalized inputs, removal limit, residual artifacts, symmetry checks, dimensional analysis, scheme comparison, and perturbative remainder. It requires the schemes page and is the chapter’s exit test.

A scalar thread from bare data to a prediction

Consider the $\mathbb Z_2$ -invariant scalar theory in $d=4-2\epsilon$ . A useful organization is

\begin{aligned} \phi_0 &= Z_\phi^{1/2}\phi,\\ m_0^2 &= m^2+\delta m^2,\\ \lambda_0 &= \mu^{2\epsilon}(\lambda+\delta\lambda). \end{aligned}

The split is not an observable decomposition. The bare quantities depend on the regulator, while the renormalized parameters depend on their defining conditions and scheme. The counterterms are fixed order by order so that chosen renormalized Green functions or amplitudes remain finite when the regulator is removed. Only after matching $m$ and $\lambda$ to declared inputs can a third quantity be called a prediction.

For a connected graph built only from quartic vertices in four dimensions,

\omega=4L-2I=4-E,

where $E$ is the number of external scalar legs. This superficial degree identifies candidate local structures, not the complete divergence of the graph. Every proper 1PI subgraph must be tested separately. The $\mathbb Z_2$ symmetry and degree bound allow vacuum, mass, kinetic, and quartic counterterms; subdivergences determine how their lower-order insertions enter a higher-order graph.

The recursive layer is essential. Nested and disjoint divergent subgraphs may appear together in a forest; overlapping subgraphs cannot belong to the same forest but each contributes in the appropriate term. After those subtractions, the remaining overall divergence is local. Zimmermann’s forest formulation makes this organization explicit and proves convergence for the momentum-space subtraction construction under its hypotheses Zimmermann 1969, pp. 208–234.

The renormalized Lagrangian may then be written schematically as

\begin{aligned} \mathcal L ={}&\frac12(\partial\phi)^2 -\frac12m^2\phi^2 -\frac{\lambda}{4!}\phi^4\\ &+\frac12\delta Z_\phi(\partial\phi)^2 -\frac12\delta m^2\phi^2 -\frac{\delta\lambda}{4!}\phi^4. \end{aligned}

The same physical input can be encoded in MS, $\overline{\rm MS}$ , momentum subtraction, or an on-shell condition. If two schemes use coordinates related by a finite map $g'=g+a_1g^2+\cdots$ , a prediction truncated after order $g^N$ need agree only up to $\mathcal O(g^{N+1})$ . Comparing the numerical values of $g$ and $g'$ without applying the map is not a regulator or scheme test.

This scalar thread ceases to be representative when gauge symmetry, chiral objects, massless infrared singularities, or nonperturbative continuum limits control the problem. Gauge theories require the complete functional identity and may need symmetry-restoring finite counterterms. Massless amplitudes require an explicit UV/IR separation. Chiral calculations require a stated continuation prescription. None of those qualifications changes the local logic, but each changes the admissible counterterm and validation record.

What must remain invariant

Changing a representation or scheme is legitimate only when the corresponding checkpoint is passed.

Translation	Convention-sensitive data	Invariant checkpoint
Bare action $\leftrightarrow$ renormalized action plus counterterms	field normalization, parameter definitions, regulator, perturbative order	Re-expansion reproduces the same regulated action through the retained order
Cutoff $\leftrightarrow$ dimensional regulator	powerlike terms, pole/log correspondence, symmetry visibility, UV/IR labels	The same renormalized inputs give the same physical prediction after removal, within the declared remainder
MS $\leftrightarrow$ $\overline{\rm MS}$	factors of $4\pi$ , $\gamma_E$ , and the definition of $\mu$	The finite parameter map removes every convention difference through the working order
Unrenormalized graph $\leftrightarrow$ forest-subtracted graph	divergent subgraph set, subtraction operator, ordering, overall subtraction	Every subdivergence is subtracted once, and the remaining ambiguity is a local polynomial of allowed degree
Gauge-fixed regulator $\leftrightarrow$ symmetric renormalized theory	regulator breaking, local finite counterterms, anomaly class	The complete renormalized functional satisfies the declared Ward or Slavnov–Taylor identity, or the obstruction is identified
Scheme A $\leftrightarrow$ scheme B	input coordinates, finite counterterms, truncation order	At least one non-input observable agrees through the retained order
Finite regulator $\leftrightarrow$ removal limit	which renormalized quantities are held fixed, bare-parameter trajectory	Residual regulator dependence vanishes with the predicted scaling and does not masquerade as perturbative uncertainty

The site-wide (+---) metric and $e^{iS}$ weight are inherited. In dimensional regularization this chapter uses $d=4-2\epsilon$ and distinguishes the regulator $\epsilon$ , subtraction scale $\mu$ , physical masses and momenta, and any separate Wilsonian cutoff. Unless a leaf states otherwise, bare objects carry a subscript $0$ , renormalized objects do not, and counterterms carry $\delta$ or are encoded in $Z$ factors. A source that defines $d=4+2\epsilon$ or absorbs $4\pi e^{-\gamma_E}$ into a rescaled $\mu$ must be translated before pole coefficients are compared.

Chapter synthesis

The minimum logic of perturbative renormalization is a dependency chain:

Power counting is a diagnostic. It bounds which subgraphs can diverge and which local monomials may be needed. It neither evaluates a graph nor subtracts it.
Locality is the structural result. After proper subdivergences are handled, the ultraviolet ambiguity is polynomial in external momenta to the allowed degree. Nonlocal logarithms, thresholds, and cuts are not counterterms to be removed.
Forest recursion is the bookkeeping theorem. It organizes nested and disjoint subtractions without double counting and handles overlapping cases through different admissible forests.
Renormalization conditions supply input. They select finite parameter coordinates; the theory predicts quantities not used as inputs.
Symmetry restricts the local freedom. A regulator may obscure an identity, but only admissible local restoration terms may be used. A nontrivial anomaly is not removable by choosing a more convenient finite part.
Regulator removal and scheme comparison test the result. Fixed renormalized inputs, a stable removal limit, identity checks, and higher-order residual scheme dependence together establish the claimed perturbative prediction.

Three category errors follow immediately. “Power-counting renormalizable” does not mean ultraviolet complete. “Dimensional regularization gives zero” does not identify whether ultraviolet and infrared poles cancelled in a scaleless integral. “Counterterms are arbitrary” confuses freedom to choose finite coordinates with freedom to change physical predictions.

For gauge theories, the symmetry step is more than checking one amplitude. The allowed counterterms are constrained by a functional identity and its linearized consistency condition; local breakings in the trivial class may be removed, whereas a nontrivial cohomology class represents an anomaly. Algebraic renormalization systematizes this distinction Piguet and Sorella 1995, chs. 3–6.

The chapter stops once a finite, symmetry-compatible, scheme-explicit prediction has passed its removal test. Composite Operators and Mixing begins when the renormalized object is a local insertion or operator product. Renormalization-Group Equations and Running begins when the question is how the finite description changes with $\mu$ . Effective Field Theory: Construction and Power Counting begins when an infinite local operator expansion is organized by a declared hierarchy rather than by perturbative renormalizability alone.

Review the chapter

A successful response should expose assumptions and checks, not merely quote a formula.

Capability	Prompt	Successful response and repair
Explanation — predictive input	Explain why adding local counterterms does not make every amplitude arbitrary.	Identify the finite set of allowed inputs at a declared order and at least one non-input observable. Repair in ultraviolet sensitivity.
Calculation — degree count	Derive $\omega=4-E$ for connected four-dimensional $\phi^4$ graphs, then explain why this does not detect every subdivergence.	Use the topological identities, list candidate 2- and 4-point subgraphs, and apply the $\mathbb Z_2$ filter. Repair in power counting.
Comparison — regulators	Compare a hard momentum cutoff and dimensional regularization for a one-loop scalar two-point function while holding the same mass condition fixed.	Separate regulator-specific local terms from common momentum dependence and predict the required finite map. Repair in regulator families.
Convention translation — MS	A source writes $d=4+2\epsilon$ and subtracts $1/\epsilon+\gamma_E-\ln4\pi$ . Translate it to this chapter’s convention.	Track the sign of $\epsilon$ , measure scale, and finite subtraction before comparing coefficients. Repair in dimensional regularization and MS.
Construction — forests	Given nested, disjoint, and overlapping divergent subgraphs, construct the admissible forests and state why overlapping members do not coexist in one forest.	Every allowed nested/disjoint set appears once, with recursive counterterms and an overall subtraction. Repair in the R-operation.
Failure diagnosis — nonlocal subtraction	A proposed counterterm contains $\phi\ln(-\Box/M^2)\phi$ . Decide whether it can subtract a UV ambiguity in the local theory.	Recognize nonlocal momentum dependence, retain physical logarithms, and seek the missing local subdivergence subtraction. Repair in counterterm locality.
Symmetry check	A regulator breaks a Slavnov–Taylor identity by a local term. State the tests required before adding a finite counterterm.	Check locality, dimension, ghost number, consistency, and cohomology class. Repair in symmetry constraints.
Scheme round trip	Starting with $g'=g+a_1g^2$ , translate a prediction through order $g^2$ to the primed scheme and back.	The observable returns through $g^2$ and the mismatch is of the next order. Repair in schemes and finite parts.
Synthesis — removal test	Design the shortest validation record for a two-loop renormalized amplitude.	State regulator, subtraction, forest set, symmetry identity, renormalized inputs, removal trajectory, scheme comparison, and perturbative remainder. Repair in regulator removal.

Continue from a checked renormalized prediction

Continue to Composite Operators and Mixing when insertions, contact products, or operator matrices require renormalization beyond the action parameters.
Continue to Renormalization-Group Equations and Running when the subtraction-scale dependence and resummation of logarithms are the next questions.
Continue to Matching, Decoupling, and Threshold Evolution when a finite full-theory amplitude must be converted into short-distance EFT coefficients.
Return to Loop Integrals and Reduction when topology, counterterm insertions, and subtraction order are fixed but integral evaluation remains.
Return to Symmetry and Gauge Structure when the functional identity, anomaly class, or BRST cohomology itself is the question.
Reproduce the bounded scalar benchmark computationally, or return to the Volume 5 overview to choose another branch.

References

Collins, John C. 1984; open-access reissue 2023. Renormalization: An Introduction to Renormalization, the Renormalization Group and the Operator-Product Expansion. Cambridge Monographs on Mathematical Physics. Cambridge University Press. DOI and Open PDF.
Piguet, Olivier, and Silvio P. Sorella. 1995. Algebraic Renormalization: Perturbative Renormalization, Symmetries and Anomalies. Lecture Notes in Physics Monographs 28. Berlin: Springer. DOI.
Zimmermann, Wolfhart. 1969. “Convergence of Bogoliubov’s Method of Renormalization in Momentum Space.” Communications in Mathematical Physics 15: 208–234. DOI.