Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Stable finite-range continuum specification normalization and consistency

Statement

Assume the Axiom of Choice and fix d≥1. For every bounded Borel set D⊂Rd and n∈N0, the unit-intensity Poisson law restricted to ND=n, represented on ordered simple tuples in Dn before forgetting labels, is the pushforward of e−∣D∣/n! times product Lebesgue measure. Now fix a nonempty bounded Borel region Λ⊂Rd, a stable even Borel pair potential ϕ with finite range R>0 as in Finite-range continuum Gibbs kernels and DLR notion, a locally finite exterior configuration η⊂Λc, and z,β>0. Let m=NΛR(η), with ΛR={y:dist⁡2(y,Λ)≤R}. Then the partition integral in Finite-range continuum Gibbs kernels and DLR notion obeys e−∣Λ∣≤ZΛη(z,β)≤e−∣Λ∣exp⁡ ⁣(z∣Λ∣eβB(1+2m))<∞. Consequently γΛη is a Borel probability kernel in η. For every nonempty bounded Borel region Δ⊆Λ, the extended kernels satisfy γΛγΔ=γΛ, and their fixed measures are exactly the probability laws whose conditional distribution inside each Λ, given the exterior, is γΛη.

Facts & Assumptions

Given: The Axiom of Choice, the dimension, region, stable finite-range potential, exterior configuration, activity, inverse-energy parameter, and reference conventions stated above; for the fixed-measure equivalence let μ be any probability measure on configuration space.

[F1]

Finite-range continuum Gibbs kernels and DLR notion defines the simple locally finite configurations, HΛ(ω∣η), ZΛη, γΛη, and the DLR fixed-kernel identity.

[F2]

The current draft Stability, superstability and regular tails defines stability by UN(X)≥−BN for a finite B≥0, every finite position list X, and every N. Enumerating the n distinct points of ω gives Uϕ(ω)≥−Bn; applying the same bound to any two-point list gives ϕ(x−y)≥−2B for every nonzero separation. This carrier is a definition, so no proof-status claim is used.

[F3]

Poisson Configuration Reference constructs Q as a product of independent half-open unit-cell Poisson configurations, each of Lebesgue volume one. In each cell the count has mass e−1/n!, and conditional on that count the point coordinates are independent and uniform before sorting. The configuration sigma-algebra is generated by bounded-set counts.

[F4]

Poisson Reference Counts and Translation Invariance states that NΛ is Poisson with mean ∣Λ∣, disjoint bounded restrictions are independent, and EQΛeaNΛ=exp⁡ ⁣(∣Λ∣(ea−1)).

[F6]

The real exponential function and the number e by a power series defines exp⁡(t)=∑m≥0tm/m! for real t, and The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y) gives exp⁡(s+t)=exp⁡(s)exp⁡(t).

[F7]

Monotone convergence for the measure integral permits increasing nonnegative partial sums and integrals to pass to their pointwise limit.

[F8]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product permits nonnegative integration in either order and makes parameter integrals of nonnegative jointly measurable functions measurable. For the exterior parameter below, apply it to the finite measures QΛ and Q restricted to the measurable exterior subspace {η:NΛ(η)=0}.

[F9]

Dynkin's pi-lambda theorem gives the pi-lambda theorem: a lambda-system containing a generating pi-system contains its generated sigma-algebra.

[F10]

Every nonnegative measurable function admits an explicit increasing sequence of simple approximations: every nonnegative measurable function is the increasing pointwise limit of simple measurable functions.

Proof

1.1F3F5F6F7F8givenconstruct

Let D be any bounded Borel set. It meets finitely many half-open unit cells Ci. Put Ai=D∩Ci and Bi=Ci∖Ai. Conditional on r+s points in a cell, the iid uniform-position rule in [F3] gives the labelled sector density e−1/(r+s)!. Splitting the labels between Ai and Bi yields (r+s)!/(r!s!) assignments by [F5]; integrating the s outside coordinates and summing over s gives e−1r!∑s=0∞∣Bi∣ss! dx1⋯dxr=e−∣Ai∣r! dx1⋯dxr, by [F6], since ∣Ai∣+∣Bi∣=1. Tonelli and monotone convergence [F7, F8] justify the nonnegative sector sum and integral. The cells are independent by [F3]. For total count n across their finitely many pieces, the label assignments for counts (ri) number n!/∏iri! by [F5]; partitioning Dn by these assignments shows that the n-point sector on D has density e−∣D∣/n! against product Lebesgue measure. The collision diagonals have product measure zero because Lebesgue measure has no atoms; this is also the simplicity convention in [F3]. Thus the density pushes to the sector on unordered simple configurations. Zero-volume pieces contribute no points.

1.2F2

Put ΛR={y:dist⁡2(y,Λ)≤R}. The distance map is 1-Lipschitz, so ΛR is a bounded Borel set. For bounded Borel S,T⊆Rd, the product sigma-algebra generated by Borel rectangles in S×T is its relative Euclidean Borel sigma-algebra: relative open rectangles from countable Euclidean bases form a countable base for S×T, so every open set is a countable union of such rectangles; conversely Borel rectangles are Borel because coordinate projections are continuous. The map (x,y)↦x−y is continuous, and for every Borel E⊆R∪{+∞}, the preimage of E under (x,y)↦ϕ(x−y) is the continuous preimage of the Borel set ϕ−1(E). Hence f(x,y)=ϕ(x−y) is Borel on these products and on their off-diagonal Borel subspaces.

2.1F1F2step 1.1algebra

If ω has n points, [F2] gives its internal energy at least −Bn and pair potential at least −2B at every distinct separation. There are at most mn interior-to-exterior pairs in HΛ, so HΛ(ω∣η)≥−B(1+2m)n. The empty configuration has HΛ(∅∣η)=0 and QΛ({∅})=e−∣Λ∣, proving the lower bound. The sector density from step 1.1 gives ZΛη≤e−∣Λ∣∑n=0∞(z∣Λ∣eβB(1+2m))nn!=e−∣Λ∣exp⁡ ⁣(z∣Λ∣eβB(1+2m))<∞.

2.2F2F3F9F10step 1.2

Define νωint(E)=∑x,y∈ω∩Λ, x≠y1E(x,y) for Borel E⊆(Λ×Λ)∖{(x,x):x∈Λ}, and define νω,ηbd(E)=∑x∈ω∩Λ, y∈η∩ΛR1E(x,y) for Borel E⊆(Λ×ΛR)∖{(x,x):x∈Λ∩ΛR}. On a restricted rectangle (A1×A2), the first measure evaluates to NA1(ω)NA2(ω)−NA1∩A2(ω) for Borel A1,A2⊆Λ, measurable by [F3]; the second evaluates to NA(ω)NC(η) for Borel A⊆Λ, C⊆ΛR, jointly measurable in (ω,η). These are finite measures: their total masses are respectively n(n−1) and nNΛR(η), where n=NΛ(ω). For either family, the sets whose pair-count evaluations are measurable form a lambda-system: the whole space has measurable total mass, complements subtract from that finite mass, and disjoint unions give pointwise limits of measurable partial sums. Restricted Borel rectangles form a pi-system generating each off-diagonal product Borel sigma-algebra, so [F9] gives measurability of the pair-count evaluations on every Borel subset. By stability on two-point lists [F2], the shifted Borel function f+2B is nonnegative on both off-diagonal pair spaces. Apply [F10] there to obtain increasing nonnegative simple Borel functions converging to f+2B. Each simple-function integral is a finite linear combination of the measurable pair-count evaluations, so its pointwise limit, the integral of f+2B, is measurable in ω or in (ω,η) as appropriate. Subtracting 2B times the measurable total pair count gives the signed pair integral without losing measurability; the subtraction is of a finite real quantity, and a value +∞ remains +∞. Evenness makes the internal unordered-pair energy half its ordered-pair integral. Thus HΛ(ω∣η) and g(ω,η)=zNΛ(ω)e−βHΛ(ω∣η) are jointly measurable.

3.1F3F8step 2.1step 2.2

The exterior subspace {η:NΛ(η)=0} is measurable by [F3], and its restriction of Q is a finite measure; together with the probability QΛ, this permits Tonelli [F8] for each map η↦∫1C(ω)g(ω,η)QΛ(dω), where C is a measurable interior event. Taking C to be the whole space shows ZΛη is measurable. Step 2.1 gives 0<ZΛη<∞, so division defines a probability and makes η↦γΛη(C) measurable for every C. This is the probability-kernel condition.

4.1F1F4F8step 2.1step 3.1algebra

Under QΛ, the restrictions to disjoint Δ and Λ∖Δ are independent by [F4]. Write an interior configuration as ωΔ∪ζ, with ζ⊆Λ∖Δ. Every finite pair term in HΛ(ωΔ∪ζ∣η) either touches Δ, in which case it is a term of HΔ(ωΔ∣ζ∪η), or does not touch Δ, in which case it depends only on ζ,η. Likewise zNΛ=zNΔ(ωΔ)zNΛ∖Δ(ζ). Thus, for fixed ζ,η, the conditional density of ωΔ under γΛ is proportional to zNΔ(ωΔ)e−βHΔ(ωΔ∣ζ∪η) relative to QΔ; its normalizer is finite and positive by step 2.1. It is exactly γΔζ∪η, proving γΛγΔ=γΛ after nonnegative iterated integration over ζ by [F8].

4.2F1F3F9step 3.1

The extended kernel leaves the exterior fixed. For an interior event A and exterior event E, apply μγΛ=μ to the full-configuration test 1A(ηΛ)1E(ηΛc). This gives ∫1E(ηΛc)1A(ηΛ) μ(dη)=∫1E(ηΛc)γΛη(A) μ(dη) for every exterior event E. This is the defining conditional-expectation identity, so γΛη is a version of the conditional interior law given the exterior. Conversely, if those conditional identities hold, the probability measures μγΛ and μ agree on every rectangle generated by an interior and an exterior event. Such rectangles form a pi-system and generate the full configuration sigma-algebra because each bounded-set count splits into its parts in Λ and Λc by [F3]. The sets on which the two probability measures agree form a lambda-system; [F9] therefore gives μγΛ=μ. This proves the stated equivalence.

5.1step 2.1step 3.1step 4.1step 4.2∎

Steps 2.1, 3.1, 4.1, and 4.2 establish, respectively, finite positive normalization, Borel-kernel measurability, specification consistency, and the DLR conditional-law interpretation. No infinite-volume existence, uniqueness, or minimizer-identification claim was used.

Depends on

Dependency tree · 2 levels

Sources