How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite quartic graph and superficial scaling conventions
1 · Prerequisites
2 · Summary
This page defines a finite connected quartic graph and a precise Euclidean superficial power-counting convention. It proves the quartic incidence and loop-count identities, derives , and specializes to in four dimensions. A separate proposition derives scalar engineering dimensions and the tree-level dilation exponent after explicitly assigning degree zero to the kinetic and monomial action terms. A zero superficial degree is a power-counting label; these mathematical results do not prove convergence, divergence, a quantum fixed point, or a running coupling.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Finite quartic graph and superficial scaling conventions
Definition
Let be the number of Euclidean momentum coordinates. Use the finite undirected multigraph convention of Degree in a multigraph, indegree and outdegree in a digraph, and their underlying connectivity: loops are allowed, distinct edges with the same endpoints are parallel, and connectedness here means that the underlying simple graph obtained by deleting loops and identifying each parallel class is connected.
A finite quartic graph is data with the following properties. The vertex set is finite and nonempty, the internal-edge set and external-half-edge set are finite, and assigns the two (unoriented, but separately labelled) ends of each internal edge to vertices. Its endpoint set is , a singleton for a loop; distinct elements of with the same unordered endpoints remain distinct parallel edges. The internal multigraph is connected in the sense just specified.
For every , the incidence-slot set has exactly four elements. Set . The attachment map
is a bijection, and for each internal end its slot has vertex coordinate . Thus the two ends of a loop occupy distinct slots. Each external half-edge is attached by to exactly one vertex slot and has no second endpoint. In particular, each vertex has exactly four slots and every slot is used exactly once by an internal-edge end or an external half-edge. Write , , and .
Define the cycle rank and loop count by . For this mathematical power-counting convention, a single formal loop-momentum integration has assigned degree : for , Lebesgue measure acquires the factor under for . The total loop contribution is defined to be , the cycle rank multiplied by this one-loop degree; no momentum routing or actual graph integral is part of this definition. Assign degree to each internal scalar-propagator factor and degree to each quartic-vertex factor. For use the Euclidean norm . For example, if , then has assigned ultraviolet degree , since
The superficial degree of under this assignment is
By convention, is called a logarithmic superficial degree. This is finite graph bookkeeping under the stated assignment. It does not by itself establish convergence or divergence of an actual graph integral; proper subgraphs, numerator cancellations, exceptional infrared data, and distributional singularities require separate hypotheses and analysis.
Quartic graph superficial degree from exact counting
Statement
Let and let be a finite quartic graph in the sense of Finite quartic graph and superficial scaling conventions. With vertices, internal edges, external half-edges, and loop count , the incidence and loop-count identities are and . Its superficial degree under the stated Euclidean scalar power-counting convention is . In this reduces to . A zero value is a logarithmic superficial degree by the convention in the definition; these identities do not assert convergence or divergence of an actual graph integral.
Facts & Assumptions
Given: and a finite connected multigraph with four-slot vertices, internal edges, and external half-edges, using degree per loop integration and degree per internal scalar propagator.
Finite quartic graph and superficial scaling conventions: the internal-edge ends and the attached external half-edges are in bijection with the four incidence slots at each vertex; is the cycle rank; one formal loop integration contributes degree , each internal scalar propagator contributes degree , and . The value is called logarithmic superficial degree and is only formal graph bookkeeping.
Proof
Given: The graph and power-counting data in [F1].
Counting the four slots at every vertex gives slots. Each of the internal edges occupies two slots, including a self-loop, and each of the external half-edges occupies one. Hence .
Start with one vertex and repeatedly add an internal edge from the reached vertices to a vertex not yet reached. Connectedness provides such an edge until all vertices are reached. Each added edge introduces one new vertex, so the selected edges form a spanning tree with edges; for it is empty. Exactly internal edges lie outside this tree, including any unselected loops or parallel edges, so the cycle rank in [F1] is nonnegative and counts the non-tree internal edges.
By [F1], . Substitute from step 1.2 to obtain . From step 1.1, , so .
Setting in step 2.1 gives . The defining convention in [F1] calls its zero value logarithmic superficial degree; it makes no claim about an actual integral's convergence or divergence.
Scalar engineering dimensions and tree-level dilation
Statement
Let , let (the smooth real-valued functions with compact support), let be an integer, and let . The Euclidean gradient is and its squared norm is . With Lebesgue measure on , define the real-valued functionals
They are finite because and its derivatives have compact support. Use the following formal natural-unit mass-degree convention: set , assign degree to each coordinate (), degree to each partial derivative, and degree to ; degrees add under products. Normalize both displayed functionals as dimensionless action terms of degree . The symbols and denote their formal mass degrees in this convention; these are the engineering dimensions. They are and . Under the dilation for , and . Call the monomial relevant, marginal, or irrelevant at tree level according as this dilation exponent is positive, zero, or negative. Thus a quartic monomial has exponent : it is relevant for , marginal by engineering dimension for , and irrelevant for . These labels concern only this classical engineering-dimension convention; no quantum correction, fixed point, or renormalization-group flow is asserted.
Facts & Assumptions
Given: , , , integer , and real scalar .
The statement's formal natural-unit mass-degree convention assigns , , , and degree to both and ; degrees add under products, with .
The specified functionals are the Lebesgue integrals of the Euclidean-gradient and monomial densities in the statement; compact support makes both integrals finite.
Proof
Given: The dimension convention [A1] and the functionals and domain in [A2].
Since has degree and has degree , its integrand has degree . Each Euclidean partial derivative contributes degree , so and .
By the chain rule, for each . With , Lebesgue measure contributes and the two differentiated fields contribute , so .
By [A1], has degree , so its integrand must have degree . Therefore , and substituting step 1.1 gives .
For the monomial, the same Lebesgue change of variables gives . At the exponent is , whose sign gives the stated relevant, marginal, or irrelevant tree-level label.
5 · Examples, experiments and counterexamples
None yet.
Sources
- Alexander M. Polyakov's QFT I course material, reconstructed and expanded by QFT.org, lesson 39: One-Loop Divergences and Power Counting
- Mark Srednicki, Quantum Field Theory, author-posted prepublication draft, §18, equations (18.2)–(18.8)
- Mark Srednicki, Quantum Field Theory, author-posted prepublication draft, §12, equations (12.5)–(12.11)
- David Tong, Quantum Field Theory, §3 Interacting Fields, equations (3.202)–(3.204)