Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Existence of the independent Gaussian-marked positional lift

Statement

Assume AC. Let P be any probability law on the simple locally finite positional configuration space Ω of Poisson Configuration Reference, and let ν be a probability on the momentum mark space Rd. Use the marked configuration space Ωmark and local restrictions ξΔ of Marked periodic continuation and local restriction. Define translations by Tyq={x+y:x∈q} and Tymarkξ={(x+y,p):(x,p)∈ξ}. Then there is a unique probability law Pmark on Ωmark whose positional projection is P and whose marks, conditional on the entire positional configuration, are independent with common law ν. If P is translation invariant, meaning (Ty)#P=P for every y∈Rd, then (Tymark)#Pmark=Pmark for every y. For the Gaussian νb of Interacting marked phase-space and reference measures, this is the independent Gaussian-marked positional lift. This is a mathematical marking construction, not a physical preparation or a convergence result.

Facts & Assumptions

Given: A probability law P on Ω and a probability mark law ν on R^d.

[A1]

AC is required by the standard-Borel coordinate extension used below (The Axiom of Choice).

[F1]

Poisson Configuration Reference: Ω has countably many unit-cell coordinates; each cell is a finite configuration represented by its count and lexicographically ordered point list, and its sigma-algebra is generated by Borel count maps.

[F2]

Marked periodic continuation and local restriction: Ω^mark has the marked-count sigma-algebra, positional projection, and finite-region restrictions ξ_Δ used in the statement.

[F3]

Gaussian mark normalization, moments, and exponential controls: in the marked model, the normalized Gaussian kernel ν_b is a probability on R^d.

[F4]

Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces: the consistent finite-dimensional product laws ν^{⊗J}, for finite J in a countable index set, extend uniquely to a probability on the countable product.

Proof

Given: The positional probability P and mark probability ν above.

1.1givenA1F4F5construct

Let I=Z^d×N index one potential mark slot for each cell and each within-cell rank. For finite J⊂I prescribe the mark law ν^{⊗J}. These laws are consistent under coordinate restriction and are probabilities because ν is a probability by the Given hypothesis, so [F4] gives a probability ν^I under [A1]. The product probability P⊗ν^I exists by [F5].

2.1F1F2F4F5step 1.1construct

For each cell i, write its finite positional list as x_{i,1},...,x_{i,N_i}, in the measurable lexicographic code of [F1]. Define Ψ(q,p) by pairing x_{i,k} with p_{i,k} for every i and 1≤k≤N_i(q). Every bounded spatial region meets finitely many unit cells, and each list is finite, so Ψ(q,p) is locally finite and simple in its positions. By [F2], it belongs to Ω^mark. For bounded Borel spatial A and Borel momentum set C, its marked count is the finite sum NA×C(Ψ(q,p))=∑i:Ci∩A≠∅∑k=1Ni(q)1{xi,k∈A}1{pi,k∈C}. Each summand is measurable in the cell code and mark coordinate by [F1, F4], so Ψ is measurable for the sigma-algebra generated by these counts from [F2]. Its pushforward of P⊗ν^I is the required law P^mark.

3.1F1F2F3F4givenstep 1.1step 2.1∎

Given q, each occupied point uses a distinct coordinate of the product ν^I, so its finite mark families have product law ν^{⊗J}, independent of q. This proves the conditional independence property and fixes every finite marked-count cylinder probability. Those cylinders generate the marked configuration sigma-algebra by [F2], so any law with the same position marginal and conditional product kernel agrees with the pushforward in step 2.1 on a generating class and is identical. Thus the lift exists and is unique. By [F3], the Gaussian kernel ν_b of the model is an admissible probability choice for ν. For each y, the map T_y^mark is measurable because it sends the count N_{A×C} to N_{(A-y)×C}. If P is translation invariant, translating the constructed law by y leaves its positional marginal P and its conditional independent mark kernel ν unchanged; uniqueness therefore gives (T_y^mark)_#P^mark=P^mark.

Depends on

Dependency tree · 2 levels

Sources