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.
Criticality, Gaussian fields and exact block renormalization
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian and gamma product tools
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Infinite-volume nonanalytic-pressure criticality
Definition
Let be a nonempty open interval of values of a scalar control parameter , expressed in one fixed unit if it is dimensional. A function is real analytic if for every there are and real coefficients such that , the series converges there, and its sum equals throughout that interval. Let be positive integers with , interpreted as finite system sizes such as site counts. A finite-volume partition-function sequence on is a sequence of real-analytic functions . For each , define its dimensionless log partition density per site by , where is the natural logarithm. If the pointwise limit exists as a finite real number for every , call the infinite-volume pressure associated with this sequence. A point is critical under the nonanalytic-pressure criterion exactly when there do not exist with and real coefficients such that converges and equals throughout that interval.
This definition specifies only the nonanalytic-pressure criterion and makes no claim that a particular model satisfies it.
Definition references
Finite Gaussian probability with a positive precision matrix
Definition
Assume the Axiom of Countable Choice: every sequence of nonempty sets has a function with for every . For , a real symmetric positive-definite matrix (meaning for every nonzero ) defines the finite Gaussian probability on by
Under the stated Axiom of Countable Choice, . For the coordinate identity on , define its mean vector by and its covariance matrix by for . These integrals are finite under the Gaussian theorem Gaussian covariance for positive quadratic forms and a boundary counterexample, which gives and . Thus is centered, meaning its mean vector is zero. Here is called the precision matrix because it appears in the quadratic exponent; for this centered law its covariance matrix is its inverse. For , define to be the singleton containing the empty vector and define to put mass one on that point; its partition factor and empty determinant are both .
The variables and exponent are dimensionless in this mathematical definition. In a physical quadratic model, if each component of has declared field unit and is energy in joules, then each entry of has units . With , where in SI is Boltzmann's constant with units and is absolute temperature in kelvins, has units . For , the dimensionless precision is . This dimensional conversion does not assert an empirical model.
Fourier spectrum and positivity of the periodic lattice Laplacian
Statement
Let be integers and let , where is the quotient set of integers modulo . Use the quotient addition and additive inverse , and define these operations coordinatewise on . For , write for its unique coordinate representatives. For , let have coordinate in position and elsewhere. Count the two terms and separately even when they coincide for or .
For a real-valued function , define
For a complex-valued function, use the same formula for , which is its complex-linear extension. Write for the complex-valued functions on with pointwise vector operations. For , define the function by
Use the inner product . Identify real functions with coordinate vectors using the lexicographic order on the representatives , and let be the identity operator on those functions. A real matrix is symmetric when ; a real symmetric matrix is positive semidefinite when for every real vector , and positive definite when for every nonzero real vector . For all , the inner products satisfy if and otherwise; every complex-valued function on is a unique linear combination of the functions .
For each , the equation holds with ; this scalar is the eigenvalue associated with .
Consequently is real symmetric positive semidefinite, and for real and the matrix is real symmetric positive definite with eigenvalues .
Statement references
The congruence class and the quotient set
For , every class in has one representative with , so ; while is in bijection with
Addition and multiplication on by and
Orthogonality of the characters on
The complex exponential by its power series
, and the complex exponential extends the real exponential
The addition formulas for sine and cosine
Pythagorean and parity identities for all six trigonometric functions on their natural domains
Facts & Assumptions
Given: Integers , the coordinatewise quotient operations, canonical representatives, and discrete Laplacian of the Statement.
Every class in has a unique representative in (The congruence class and the quotient set , For , every class in has one representative with , so ; while is in bijection with ).
Quotient addition is and is independent of representatives; with this operation is an additive abelian group, with inverse (Addition and multiplication on by and , For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
For and integers , is if and is otherwise (Orthogonality of the characters on ).
Finite sums over product index sets may be factored and evaluated in either order (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule).
For real , and (, , and , The addition formulas for sine and cosine).
Complex conjugation fixes real numbers and sends to (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive); together with [F6] and [F7], this gives for real .
Proof
Fix and put . By [F1]–[F2], the th representative of is , where if and otherwise; the th representative of is , where if and otherwise. All other representatives are unchanged. Substitution into the definition of , followed by the exponential addition law and for integers from [F5], gives and . This also holds for and .
For , finite-sum factorization [F4] and the conjugation identity [F8] give . By [F1], distinct canonical representatives are incongruent modulo , so [F3] makes each factor when and otherwise. This is the inner-product identity stated above.
Substituting the shift identities of step 1.1 into gives . By [F6]–[F7], each coefficient equals , proving the eigenvalue formula.
For any , set . By [F4] and [F8], the frequency sum factors as . The canonical-representative theorem [F1] and orthogonality [F3] make this product if in and otherwise. Therefore for every . If a linear combination vanishes, taking its inner product with and applying step 1.2 gives for each , so the expansion is unique.
For every real , the translations are bijections with inverses , so reindexing the finite sums [F4] gives . Thus is positive semidefinite; its matrix is symmetric because every shift term is paired with its inverse shift. For nonzero , since and . By steps 2.1 and 2.2, the spanning functions satisfy the eigenvalue equations in the Statement, so the combined operator has the displayed eigenvalues.
Chord and Lipschitz bounds for sine
Statement
For , . For all real , .
Statement references
Facts & Assumptions
Given: Real numbers , with for the chord inequality.
The product and quotient rules hold for differentiable functions on their domains (Sums, scalar multiples, products and quotients: , , , and when ).
The identity function has derivative , and a differentiable function is continuous at each point where it is differentiable (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, A function differentiable at is continuous at ).
The mean value theorem applies to a function continuous on with and differentiable on (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
Proof
On define . By [F1]–[F3] and the product rule, is differentiable and continuous, with and on . For , the mean value theorem on gives for some ; at equality holds.
If , then by [F1]. For , sine is continuous on and differentiable on its interior by [F1] and [F3], so the mean value theorem applies on this nondegenerate interval. Its derivative has modulus at most by [F1] and [F5], so ; parity gives .
For , put . The quotient rule and step 1.1 give . Applying the mean value theorem to on yields by [F1] and the quarter-turn value in [F1]; the endpoint is equality, and is immediate. Parity in [F5] extends the lower bound to negative .
If , apply the mean value theorem to on the closed interval with endpoints . For some interior , by [F1], [F4], and [F5]; if , both sides are zero.
Positive Schur complements for finite Gaussian precisions
Statement
Let and be integers. For , a real matrix is symmetric positive definite if and for every nonzero . Let , , and , and set
Assume is symmetric positive definite. Then is symmetric positive definite, , and exists. The Schur complement is symmetric positive definite when ; when , is the empty matrix. For all and ,
For , the first term and are interpreted on the singleton space .
Statement references
Facts & Assumptions
Given: A symmetric positive-definite real block matrix with block sizes and as in the Statement.
Every real symmetric positive-definite matrix has a factorization with lower triangular and positive diagonal; the determinant of a triangular matrix is the product of its diagonal entries, determinants are multiplicative, and a real square matrix with nonzero determinant is invertible (A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique, The determinant of a triangular matrix is the product of its diagonal entries, For same-sized finite square matrices over a commutative ring, , A finite square real matrix is invertible if and only if its determinant is nonzero).
Proof
For nonzero , the vector is nonzero, so . Thus is symmetric positive definite. By the Cholesky statement in [F1], with positive diagonal; by the determinant laws in [F1], , so the invertibility criterion in [F1] gives that is invertible.
Since is symmetric and invertible, is symmetric. Expanding the quadratic form on the right gives , which is the quadratic form on the left; this proves the displayed completion-of-the-square identity.
If and , choose in step 2.1. The second term vanishes and , so positive definiteness of gives . Symmetry of follows from symmetry of ; hence is symmetric positive definite. If , the claimed empty-matrix convention holds by definition.
Unconstrained massless periodic Gaussian has infinite normalizer
Statement
Assume the Axiom of Countable Choice . Let be integers, let have sites, and let . Define the zero-mass precision on , with the periodic Laplacian convention of Fourier spectrum and positivity of the periodic lattice Laplacian. Then the unrestricted Lebesgue normalizer diverges:
Thus this quadratic weight does not define a probability density on the full coordinate space. A finite-volume massless Gaussian must first restrict the field, for example to , before inverting the Laplacian.
Statement references
Facts & Assumptions
Given: , integers , the periodic site set with , and .
The periodic operator is real symmetric and annihilates the constant vector ; the function for every is that constant vector (Fourier spectrum and positivity of the periodic lattice Laplacian).
Under , a diffeomorphism changes a nonnegative Lebesgue integral by its absolute Jacobian (The Axiom of Countable Choice (), A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).
Euclidean Lebesgue measure is the product of its coordinate measures on Borel rectangles; the coordinate measures are sigma-finite, and Tonelli identifies the integral of a nonnegative measurable function with its iterated integral (Lebesgue measurable sets, the family , and the restricted set function , The nonnegative Lebesgue integral, On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
Boxes have their side-length product as Lebesgue measure, and increasing nonnegative functions pass to their limit under the integral (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, Monotone convergence for the integral).
The nonnegative Lebesgue integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral).
Proof
By [F1], and is symmetric. Hence the quadratic form is unchanged by adding any constant multiple of : for every and , .
If , then by step 1.1, and the integrand is identically on . Its integral is infinite because the intervals have measure for every integer by [F4], and [F5] bounds the full integral below by each of these unbounded values.
Suppose and enumerate the lattice sites as . Define the linear map by . Its matrix is triangular with all diagonal entries , so it is a diffeomorphism with determinant . For , one has . By step 1.1, , which is independent of . Applying [F2] changes the original integral to
The function is continuous and positive. On , , where ; hence there. By [F4] and [F5], . By [F3], Tonelli factors the nonnegative integral in step 2.2 as . The second factor is infinite because each interval has measure for integer by [F4], and [F5] bounds the full-line integral below by each such value. Thus the original normalizer is infinite, proving the claim.
Finite periodic Gaussian lattice field with positive mass
Definition
Assume the Axiom of Countable Choice from The Axiom of Countable Choice (). Let integers specify the periodic lattice and let and be dimensionless real parameters in lattice units. On the real coordinate space , let
where is the periodic Laplacian of Fourier spectrum and positivity of the periodic lattice Laplacian. Its eigenvalues are
so it is symmetric positive definite. The finite periodic Gaussian lattice field is the centered probability of Finite Gaussian probability with a positive precision matrix, with density proportional to against Lebesgue measure on and covariance by Gaussian covariance for positive quadratic forms and a boundary counterexample at .
The lattice coordinates and the quadratic exponent are dimensionless. Under the physical quadratic convention of Finite Gaussian probability with a positive precision matrix, where and each field component has unit , choosing gives dimensionless precision when the energy is divided by . Here with the SI units for and specified in Finite Gaussian probability with a positive precision matrix; equivalently the physical precision for this lattice model is . This conversion makes no empirical claim. At , the constant field is a zero mode and the unrestricted normalizer diverges by Unconstrained massless periodic Gaussian has infinite normalizer, so the full-space positive-precision definition does not apply. A finite-volume massless model must first specify a restriction such as the subspace before inverting the Laplacian.
Definition references
The Axiom of Countable Choice ()
Fourier spectrum and positivity of the periodic lattice Laplacian
Unconstrained massless periodic Gaussian has infinite normalizer
Finite Gaussian probability with a positive precision matrix
Gaussian covariance for positive quadratic forms and a boundary counterexample
Dimension threshold for the infinite-lattice massless Gaussian Green integral
Statement
Assume the Axiom of Countable Choice , meaning every sequence of nonempty sets has a function with for every . Let integer , parameter , and , and put
Here is -dimensional Lebesgue measure restricted to the cube. For a measurable function , write and ; its signed Lebesgue integral is when at most one of these two integrals is infinite, and is integrable when . For , define and . Define the massless infinite-lattice Green integral when it is finite by
where the integrand is assigned value at , a choice that does not affect the integral because a singleton has Lebesgue measure zero. If , this integral is absolutely finite for every fixed . If , the nonnegative diagonal integral with is . Thus the dimension threshold concerns this free Gaussian Fourier integral; it does not assert an interacting critical exponent or a continuum scaling limit.
Statement references
The Axiom of Countable Choice ()
Finite periodic Gaussian lattice field with positive mass
Lebesgue measurable sets, the family , and the restricted set function
The nonnegative Lebesgue integral
Integrable real and complex functions, and their integrals
A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included
Facts & Assumptions
Given: , an integer , , , the cube with Euclidean Lebesgue measure, and as in the Statement.
For , (Chord and Lipschitz bounds for sine).
Under , boxes are Lebesgue measurable with measure equal to the product of their side lengths, and Lebesgue measure is complete and countably additive (The Axiom of Countable Choice (), Lebesgue measurable sets, the family , and the restricted set function , A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
The nonnegative Lebesgue integral is monotone and additive for finite sums; increasing nonnegative measurable functions pass to their limit under the integral (Monotonicity and nonnegative homogeneity of the nonnegative integral, Additivity of the nonnegative Lebesgue integral, Monotone convergence for the integral).
A continuous real function is Borel measurable, and a geometric series with ratio in has finite sum (A continuous map has Borel preimages of Borel sets, For , , and for the series diverges).
for every real (Signs, monotonicity intervals, and ranges of sine and cosine).
The real signed Lebesgue integral and the criterion for finite integrability are as stated in the real-integral definition linked above; the nonnegative integrals used in the comparison are those of The nonnegative Lebesgue integral.
Proof
For , apply [F1] to in each coordinate and square the bounds. Summing yields where . The denominator is positive off the origin, so its reciprocal is continuous on the cube with the origin removed. Extending it by the stated value at the closed singleton makes it Borel measurable: each open-set preimage is the union of a Borel subset of that complement and, when applicable, the singleton. The cosine numerator is continuous, so all nonnegative comparison integrands below are measurable by [F4].
For , let . The sets are pairwise disjoint, are contained in , and by [F2] have measure . On , , so step 1.1 gives . Hence For , these upper bounds sum to a finite geometric series by [F4]. On the remaining part of outside , , so step 1.1 bounds by ; that part has finite measure by [F2]. Countable additivity and monotone convergence in [F3] therefore show that is integrable on the whole cube.
For , step 1.1 gives on every . There , and hence The right side is bounded below by the positive constant for all when . Since the are disjoint, finite additivity in [F3] shows that the integral over their first layers is at least ; letting and using monotonicity gives .
If , then away from the origin by [F5], and step 2.1 proves ; hence the signed integral in the Statement is finite by [F6], and multiplication by the finite constant preserves it. If and , the cosine is , so step 2.2 gives the stated infinite nonnegative diagonal integral.
Exact finite Gaussian block elimination
Definition
The exact Gaussian block-elimination algorithm has input:
- an integer and a real matrix satisfying and for every nonzero . In the finite Gaussian convention, is the precision because it appears in the density proportional to ;
- an integer and nested retained coordinate sets each given in increasing coordinate order.
It starts at stage with the ordered coordinates and matrix . For each , let be the coordinates to eliminate at that stage.
- If , set and .
- If , reorder the current coordinates as the increasing list of followed by the increasing list of , and write the correspondingly permuted matrix Solve the nonsingular system , set Interpret in the increasing coordinate order on .
The output is , with the accumulated log normalization . If , this output means and an empty list of increments. When , is the unique empty matrix and its determinant is defined to be . This is an exact-arithmetic procedure on finite matrices.
Correctness of finite Gaussian block elimination
Statement
Assume the Axiom of Countable Choice and the hypotheses of Exact finite Gaussian block elimination with input and retained sets . Let be the algorithm outputs. At each stage write , and use the empty-set conventions of the algorithm. Then the algorithm terminates after stages, every nonempty retained precision is positive definite, and for every fixed retained vector ,
where lists the eliminated coordinates in increasing order and is the unique full coordinate vector agreeing with on and with on . The measure is Euclidean Lebesgue measure when the eliminated-coordinate space has positive dimension; if , identify with the singleton and let assign mass one to it. If , the normalized marginal law of the retained coordinates under is exactly ; if , the final retained space is the singleton and the identity gives . In all cases,
with under the empty-space convention. These are exact finite-dimensional Gaussian identities and make no approximation or empirical claim.
Statement references
Facts & Assumptions
Given: , a finite symmetric positive-definite , and a finite nested retained-coordinate list as in the algorithm.
For a positive-definite precision matrix on with , the density proportional to has normalizer ; the empty-space normalizer is by definition (Gaussian covariance for positive quadratic forms and a boundary counterexample, Finite Gaussian probability with a positive precision matrix).
Completing the square gives the Schur-complement identity, and for a nonempty retained block its Schur complement is positive definite (Positive Schur complements for finite Gaussian precisions).
Under , the nonnegative Lebesgue integral is defined for nonnegative measurable functions, obeys the change-of-variables formula for a diffeomorphism, and Tonelli identifies it with either iterated integral on finite-dimensional Lebesgue product spaces (The Axiom of Countable Choice (), The nonnegative Lebesgue integral, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, Lebesgue measurable sets, the family , and the restricted set function , A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, On Borel subsets of R^{m+n}, the product lambda_m times lambda_n agrees with lambda_{m+n}, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
The natural logarithm sends positive products to sums and (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, , and the complex exponential extends the real exponential).
Proof
Initially is positive definite. At any later stage with nonempty , the current is positive definite by induction, so its principal block is positive definite. The Schur identity in [F2] then gives exactly the algorithm's and proves it positive definite when is nonempty. If is empty, the empty-matrix convention applies. Stages with leave . The algorithm is consequently well-defined at every one of its finitely many stages.
Fix one stage with and fix its retained coordinates . By step 1.1 the current matrix is well-defined and positive definite. Reordering the coordinates is a linear permutation with Jacobian determinant of absolute value , so the change-of-variables formula in [F3] preserves the integral. With eliminated coordinates denoted by , [F2] gives For fixed , the translation is a diffeomorphism of Euclidean space with Jacobian . The change-of-variables formula [F3] and the Gaussian normalizer [F1] therefore give The last equality follows from the definition of and positivity of . If , the same identity holds with factor by definition.
Apply step 2.1 successively for the finite stages. At each stage the integrand is nonnegative, so Tonelli [F3] permits the iterated eliminations in the stated order. Multiplying the one-stage factors yields, for each fixed final retained vector , using exponential addition in [F4]. If , including , the integral is with respect to the unit mass on and the equality is the identity with an empty product.
If no coordinates are eliminated, then every , , and , so the normalizer identity is immediate. If , then has coordinates; evaluating step 3.1 at the unique empty retained vector gives , while . In the remaining case both and are nonempty, so Tonelli [F3] and the Euclidean product-measure identity in [F3] allow integration of step 3.1 over the retained vector and give . The nonempty is positive definite by step 1.1, so [F1] makes finite and positive. In each case, dividing step 3.1 by gives the retained density when , exactly ; for empty the marginal is the unit mass . Taking natural logarithms of the positive normalizer identity and using [F4] proves the logarithmic formula, including the empty-space case.
Engineering scaling of the Gaussian gradient and quartic actions
Statement
Assume the Axiom of Countable Choice , meaning every sequence of nonempty sets has a function with for every . Let integer , dimensionless scale factor , and real function be given, where denotes the functions whose partial derivatives of every order exist and are continuous and whose support is compact. Define
For any , define its Gaussian gradient action and quartic integral by
where is the vector of first partial derivatives. Then
Consequently a coefficient multiplying transforms to when the action is re-expressed in the rescaled coordinate . This is engineering power counting on smooth test fields; it neither constructs an interacting probability measure nor proves an interacting critical exponent.
Statement references
Facts & Assumptions
Given: , integer , , and a real smooth compactly supported on .
Under , a diffeomorphism changes a nonnegative Lebesgue integral by its absolute Jacobian (The Axiom of Countable Choice (), A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).
The derivative of a composition is given by the chain rule (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ).
Proof
The map is a diffeomorphism of with Jacobian determinant . By [F2], each partial derivative satisfies Thus . Applying [F1] with to this nonnegative integrand gives The compact support and smoothness assumptions make these integrands measurable and finite.
The same change of variables gives Therefore with , as claimed.
5 · Examples, experiments and counterexamples
None yet.
Sources
- David Tong, Statistical Field Theory, complete Cambridge lecture notes
- Sacha Friedli and Yvan Velenik, Statistical Mechanics of Lattice Systems (A Concrete Mathematical Introduction), complete book PDF
- Hugo Touchette, The large deviation approach to statistical mechanics
- NIST Digital Library of Mathematical Functions, Chapter 4, §4.18 Inequalities
- MIT OpenCourseWare, 2.154 Maneuvering and Control, lecture notes
- Nick Higham, What Is the Schur Complement of a Matrix?