Alphabeta Math
Pipeline-generated
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 ωD=D+(D−4)V−(D−2)E/2, and specializes to 4−E 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

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite quartic graph and superficial scaling conventions

Definition

Let D∈Z≥1 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 Γ=(V,Eint,η,Hext,(Sv)v∈V,a) with the following properties. The vertex set V is finite and nonempty, the internal-edge set Eint and external-half-edge set Hext are finite, and η:Eint×{0,1}→V assigns the two (unoriented, but separately labelled) ends of each internal edge to vertices. Its endpoint set is {η(e,0),η(e,1)}, a singleton for a loop; distinct elements of Eint with the same unordered endpoints remain distinct parallel edges. The internal multigraph (V,Eint,η) is connected in the sense just specified.

For every v∈V, the incidence-slot set Sv has exactly four elements. Set S:=⨆v∈V({v}×Sv). The attachment map

a:(Eint×{0,1})⊔Hext⟶S

is a bijection, and for each internal end (e,j) its slot has vertex coordinate η(e,j). Thus the two ends of a loop occupy distinct slots. Each external half-edge h∈Hext is attached by a(h) 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 V:=∣V∣, I:=∣Eint∣, and E:=∣Hext∣.

Define the cycle rank and loop count by L:=I−V+1. For this mathematical power-counting convention, a single formal loop-momentum integration has assigned degree +D: for ℓ∈RD, Lebesgue measure dDℓ acquires the factor λD under ℓ↦λℓ for λ>0. The total loop contribution is defined to be DL, the cycle rank multiplied by this one-loop degree; no momentum routing or actual graph integral is part of this definition. Assign degree −2 to each internal scalar-propagator factor and degree 0 to each quartic-vertex factor. For q=(q1,…,qD)∈RD∖{0} use the Euclidean norm ∣q∣2:=∑j=1Dqj2. For example, if m≥0, then (∣q∣2+m2)−1 has assigned ultraviolet degree −2, since

lim⁡λ→∞λ2(∣λq∣2+m2)−1=∣q∣−2.

The superficial degree of Γ under this assignment is

ωD(Γ):=DL−2I.

By convention, ωD(Γ)=0 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.

PropositionStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Quartic graph superficial degree from exact counting

Statement

Let D∈Z≥1 and let Γ be a finite quartic graph in the sense of Finite quartic graph and superficial scaling conventions. With V vertices, I internal edges, E external half-edges, and loop count L, the incidence and loop-count identities are 4V=2I+E and L=I−V+1. Its superficial degree under the stated Euclidean scalar power-counting convention is ωD(Γ)=DL−2I=D+(D−4)V−D−22E. In D=4 this reduces to ω4(Γ)=4−E. 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: D∈Z≥1 and a finite connected multigraph Γ with V≥1 four-slot vertices, I internal edges, and E external half-edges, using degree D per loop integration and degree −2 per internal scalar propagator.

[F1]

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; L:=I−V+1 is the cycle rank; one formal loop integration contributes degree D, each internal scalar propagator contributes degree −2, and ωD(Γ):=DL−2I. The value ωD=0 is called logarithmic superficial degree and is only formal graph bookkeeping.

Proof

Given: The graph and power-counting data in [F1].

1.1givenF1algebra

Counting the four slots at every vertex gives 4V slots. Each of the I internal edges occupies two slots, including a self-loop, and each of the E external half-edges occupies one. Hence 4V=2I+E.

1.2givenF1construct

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 V vertices are reached. Each added edge introduces one new vertex, so the selected edges form a spanning tree with V−1 edges; for V=1 it is empty. Exactly I−(V−1)=I−V+1=L 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.

2.1F1step 1.1step 1.2algebra

By [F1], ωD=DL−2I. Substitute L=I−V+1 from step 1.2 to obtain ωD=(D−2)I−DV+D. From step 1.1, I=2V−E/2, so ωD=(D−2)(2V−E/2)−DV+D=D+(D−4)V−D−22E.

3.1F1step 2.1algebra∎

Setting D=4 in step 2.1 gives ω4=4−E. The defining convention in [F1] calls its zero value logarithmic superficial degree; it makes no claim about an actual integral's convergence or divergence.

PropositionStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Scalar engineering dimensions and tree-level dilation

Statement

Let D∈Z≥1, let ϕ∈Cc∞(RD;R) (the smooth real-valued functions with compact support), let r≥3 be an integer, and let gr∈R∖{0}. The Euclidean gradient is ∇Eϕ:=(∂1ϕ,…,∂Dϕ) and its squared norm is ∣∇Eϕ∣2:=∑j=1D(∂jϕ)2. With Lebesgue measure dDx on RD, define the real-valued functionals

Skin(ϕ):=12∫RD∣∇Eϕ(x)∣2 dDx,Sr(ϕ):=gr∫RDϕ(x)r dDx.

They are finite because ϕ and its derivatives have compact support. Use the following formal natural-unit mass-degree convention: set ℏ=c=1, assign degree −1 to each coordinate xμ (1≤μ≤D), degree 1 to each partial derivative, and degree −D to dDx; degrees add under products. Normalize both displayed functionals as dimensionless action terms of degree 0. The symbols [ϕ] and [gr] denote their formal mass degrees in this convention; these are the engineering dimensions. They are [ϕ]=(D−2)/2 and [gr]=D−r(D−2)/2. Under the dilation ϕb(x)=b−(D−2)/2ϕ(x/b) for b>0, Skin(ϕb)=Skin(ϕ) and Sr(ϕb)=bD−r(D−2)/2Sr(ϕ). 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 4−D: it is relevant for D<4, marginal by engineering dimension for D=4, and irrelevant for D>4. These labels concern only this classical engineering-dimension convention; no quantum correction, fixed point, or renormalization-group flow is asserted.

Facts & Assumptions

Given: D∈Z≥1, b>0, ϕ∈Cc∞(RD;R), integer r≥3, and real scalar gr≠0.

[A1]

The statement's formal natural-unit mass-degree convention assigns [xμ]=−1, [∂μ]=1, [dDx]=−D, and degree 0 to both Skin and Sr; degrees add under products, with ℏ=c=1.

[A2]

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].

1.1givenA1A2algebra

Since Skin has degree 0 and dDx has degree −D, its integrand ∣∇Eϕ∣2 has degree D. Each Euclidean partial derivative contributes degree 1, so 2+2[ϕ]=D and [ϕ]=(D−2)/2.

1.2givenA2algebra

By the chain rule, ∂j(ϕb)(x)=b−(D−2)/2−1(∂jϕ)(x/b) for each j=1,…,D. With x=by, Lebesgue measure contributes bD and the two differentiated fields contribute b−(D−2)−2=b−D, so Skin(ϕb)=Skin(ϕ).

2.1givenA1A2step 1.1algebra

By [A1], Sr has degree 0, so its integrand grϕr must have degree D. Therefore [gr]+r[ϕ]=D, and substituting step 1.1 gives [gr]=D−r(D−2)/2.

3.1givenA1A2step 1.1algebra∎

For the monomial, the same Lebesgue change of variables gives Sr(ϕb)=grbDb−r(D−2)/2∫ϕ(y)rdDy=bD−r(D−2)/2Sr(ϕ). At r=4 the exponent is 4−D, whose sign gives the stated relevant, marginal, or irrelevant tree-level label.

5 · Examples, experiments and counterexamples

None yet.

Sources