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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Finite-window spatial likelihood

1 · Prerequisites

2 · Summary

For a bounded Borel observation window W⊂Rd, this page fixes the reference measure and boundary convention, then derives the spatial Poisson density relative to unit-rate Poisson measure and its log likelihood. The homogeneous rate example includes both positive-count and zero-count boundaries. Finite-window Gibbs laws require an explicit support and a finite, positive normalizer. Papangelou conditional intensity and pseudolikelihood are defined with a fixed exposure convention; no generic pseudo-likelihood or Gibbs asymptotic guarantee is claimed.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Borel sigma-algebra of a product of second-countable spaces

Statement

Let X,Y be second-countable topological spaces and give X×Y the product topology. Then B(X×Y)=B(X)⊗B(Y).

Facts & Assumptions

Given: Second-countable topological spaces X,Y with their product topology and the product sigma-algebra.

[F1]

A second-countable space has an at most countable basis, and every open set is a union of basis elements. (Second countability: an at most countable basis for the topology)

[F2]

Finite products of at most countable sets are at most countable. (A product of two at most countable sets is at most countable)

[F4]

The Borel sigma-algebra is generated by the open sets. (The Borel sigma-algebra of a topological space)

[F5]

The product sigma-algebra is generated by measurable rectangles. (The product sigma-algebra and its finite iterates)

Proof

Given: Second-countable spaces X,Y.

1.1givenF1F2F3F4

Choose at most countable bases U for X and V for Y using [F1]. Their product U×V is at most countable by [F2], and its members U×V form a basis for X×Y by [F3]. Each such rectangle lies in B(X)⊗B(Y); every open subset of X×Y is a union of a subfamily of this countable basis, hence a countable union of those rectangles. By [F4], this proves B(X×Y)⊆B(X)⊗B(Y).

2.1givenF3F4F5algebra∎

The coordinate projections πX:X×Y→X and πY:X×Y→Y are continuous by the definition of the product topology [F3]. For Borel A⊆X and C⊆Y, A×C=πX−1(A)∩πY−1(C) is Borel in X×Y. Thus every generator rectangle of the product sigma-algebra [F5] belongs to B(X×Y), giving the reverse inclusion.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-window spatial observations and configurations

Definition

Fix an integer d≥1 and a bounded Borel set W⊂Rd. Under Countable Choice every Borel subset of Rd is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable), so Lebesgue measure ℓd is defined on each such set. Write ∣A∣:=ℓd(A) for Borel A, and BW:={W∩A:A∈B(Rd)} for the trace Borel sigma-algebra on W. Every member of BW is Borel in Rd because W is Borel. Define ℓW:BW→[0,+∞] by ℓW(A):=ℓd(A). If (Ak) is pairwise disjoint in BW, then each Ak and their union are Borel in Rd, so countable additivity of ℓd gives ℓW ⁣(⋃kAk)=ℓd ⁣(⋃kAk)=∑kℓd(Ak)=∑kℓW(Ak), and ℓW(∅)=0. Thus ℓW is a measure on the trace sigma- algebra. Since W is bounded, ℓW(W)<∞ (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure). The only choice axiom used to regard ℓd as a measure in this library is Countable Choice, as recorded in Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume.

The finite configuration space on W, denoted C(W), is the measurable subspace of locally finite counting measures on Rd consisting of those η with η(Wc)=0 and η(Rd)<∞. It is measurable in the ambient evaluation sigma-algebra because both η↦η(Wc) and η↦η(Rd) are evaluation maps for Borel sets. Thus each η∈C(W) has a representation η=∑i=1nδxi for a finite n≥0 and xi∈W; repeated locations are allowed and represent multiplicity. Its sigma-algebra is the trace of the evaluation sigma-algebra: it is generated by η↦η(B) for Borel B⊆W.

For a finite ambient configuration η~, its observation in W is η=η~∣W, where η(B)=η~(B∩W). The observation includes precisely the locations belonging to W: a boundary location is included when and only when it belongs to W. This convention does not replace W by its interior or its closure.

Remarks

This definition allows multiplicities and makes no simplicity claim. The separate finite-intensity Poisson simplicity argument is in A finite Poisson process with atomless intensity is simple.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Products of a measurable intensity over finite configurations are measurable

Statement

Let W and C(W) be as in Finite-window spatial observations and configurations, and let f:W→[0,∞) be finite-valued and Borel measurable. For η=∑i=1nδxi∈C(W), counting repeated locations with their multiplicities and taking the empty product to be 1, define Gf(η):=∏i=1nf(xi). Then Gf:C(W)→[0,∞) is measurable.

Facts & Assumptions

Given: The finite-window configuration space, a finite-valued Borel function f, and the product Gf defined in the Statement.

[F1]

The sigma-algebra on C(W) is generated by the evaluation maps η↦η(B) for Borel B⊆W; each configuration is a finite sum of Dirac masses, with repetitions allowed. (Finite-window spatial observations and configurations)

[F2]

A nonnegative measurable function is the pointwise increasing limit of nonnegative simple measurable functions. (Every nonnegative measurable function is the increasing limit of simple measurable functions)

[F3]

If u,v are nonnegative measurable functions, then uv is measurable: for a≥0, {uv>a}=⋃q∈Q, q>0{u>q}∩{v>a/q}, and for a<0 the superlevel set is the whole space. Iterating this fact gives measurability of finite products. The identity uses the extended-product convention 0⋅(+∞)=0. (Extended-real-valued measurable functions)

Proof

Given: f is finite-valued and Borel measurable on W.

1.1givenF1F3construct

First suppose f is simple, with value cj≥0 on each member Bj of a finite Borel partition of W. Then Gf(η)=∏jcjη(Bj), using 00=1; every exponent is an evaluation map. For each fixed cj, the map m↦cjm on N0 is measurable: the inverse image of any Borel set is a union of the countable level sets {η(Bj)=m}. This also covers cj=0 with 00=1. The finite product is measurable by [F3].

2.1givenstep 1.1F2algebra∎

For general f, choose simple functions sm↑f by [F2]. If η=∑i=1nδxi, then Gsm(η)=∏i=1nsm(xi)↑∏i=1nf(xi)=Gf(η); the limit holds because the product has finitely many nonnegative factors, and it also holds for the empty configuration. Thus Gf is a pointwise limit of measurable functions from step 1.1 and is measurable.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

Finite-window pair counts are measurable

Statement

Let W and C(W) be as in Finite-window spatial observations and configurations. For R≥0, put DR:={(x,y)∈W×W:∥x−y∥2≤R}. For a finite configuration η, define SR(η):=12((η⊗η)(DR)−η(W)). Here η⊗η is the product measure and the subtraction removes the n ordered self-pairs from a representation with n=η(W) occurrences. Thus SR counts unordered pairs of distinct occurrences at distance at most R, including co-located distinct occurrences when multiplicity is present. Then SR:C(W)→[0,∞) is measurable.

Facts & Assumptions

Given: W, its finite-configuration space, and R≥0.

[F1]

The evaluation maps generate the sigma-algebra on C(W) and each η is a finite measure. (Finite-window spatial observations and configurations)

[F2]

For a finite measure η, the product measure η⊗η exists and satisfies (η⊗η)(B×C)=η(B)η(C) on measurable rectangles. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F3]

A lambda-system containing a pi-system contains its generated sigma-algebra. (Dynkin's pi-lambda theorem)

[F4]

Sums, real scalar multiples, and hence differences of finite-valued measurable functions are measurable. (Closure properties of measurable functions used by the integral)

[F5]

Countable suprema and pointwise limits of measurable functions are measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

[F6]

Rational open boxes form a countable basis for Rd; their intersections with W form a countable basis for its subspace topology. (Qn is a countable dense subset of Rn, and rational open boxes form a countable basis)

[F7]

For second-countable spaces, the Borel sigma-algebra of the product equals the product of the Borel sigma-algebras. (Borel sigma-algebra of a product of second-countable spaces)

Proof

Given: The finite configuration η and the radius R.

1.1givenF1F2F4F5construct

For a measurable rectangle B×C, the map η↦(η⊗η)(B×C)=η(B)η(C) is measurable by [F1]. Let D:={A∈BW⊗2:η↦(η⊗η)(A) is measurable}. The whole space belongs to D because its value is η(W)2: for each integer k≥0, the level set {η(W)2≥k} is a countable union of evaluation level sets {η(W)=n}. The total product mass is finite. For A∈D, finite additivity gives (η⊗η)((W×W)∖A)=η(W)2−(η⊗η)(A); this finite-valued measurable difference is measurable by [F4], so complements belong. Countable disjoint unions belong by countable additivity, since the partial sums are measurable by [F4] and their pointwise limit is measurable by [F5]. Thus D is a lambda-system containing the rectangles.

2.1step 1.1F3F6F7

Rectangles form a pi-system and generate the product Borel sigma-algebra by [F6] and [F7]. Dynkin's theorem [F3] applied to step 1.1 therefore gives that η↦(η⊗η)(A) is measurable for every Borel A⊆W×W. The set DR is closed, so its product-measure evaluation is measurable.

3.1givenstep 2.1F1algebra∎

If η=∑i=1nδxi, then (η⊗η)(DR)=∑i,j=1n1{∥xi−xj∥2≤R}. The n terms with i=j all occur since R≥0; every remaining unordered pair of distinct occurrences contributes exactly two terms. Hence the displayed formula for SR is a finite nonnegative integer and is measurable by step 2.1 and [F1].

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite products of measures with densities have the product density

Statement

Let μ be any finite measure on (W,BW), where W and its trace Borel sigma-algebra BW are as in Finite-window spatial observations and configurations. Let f:W→[0,∞] be measurable with ∫Wf dμ<∞, and put ν=f dμ. For every integer n≥1, the product measure ν⊗n on BW⊗n has density Fn(x1,…,xn)=∏i=1nf(xi), where products use the extended-product convention 0⋅(+∞)=0. For n=0, both product measures are the unit mass on the one-point empty tuple and the product density is 1.

Facts & Assumptions

Given: A finite measure μ, a nonnegative measurable f with finite integral, and its density measure ν=f dμ.

[F1]

The set function A↦∫Af dμ is a measure. (The measure with density f relative to μ)

[F2]

Finite products of sigma-finite measures exist and have the rectangle product formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F3]

Tonelli's theorem interchanges nonnegative iterated integrals on a sigma-finite product. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F4]

Two finite measures agreeing on a generating pi-system that contains the whole space agree on the generated sigma-algebra: the constant sequence equal to the whole space is a common finite-measure exhaustion. (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system)

[F5]

Finite products of nonnegative measurable functions are measurable. For two such functions u,v, for a≥0, {uv>a}=⋃q∈Q, q>0{u>q}∩{v>a/q}, and for a<0 the superlevel set is the whole space. Iterating this identity proves the finite-product claim, using 0⋅(+∞)=0. (Extended-real-valued measurable functions)

Proof

Given: n≥1, μ(W)<∞, and ∫Wf dμ<∞.

1.1givenF1F3F5construct

Each coordinate projection πi:Wn→W is measurable because inverse images of members of BW are measurable rectangles. Hence each f∘πi is measurable, and [F5] makes Fn=∏i=1nf∘πi measurable. Thus A↦∫AFn dμ⊗n is a measure by the same indefinite-integral construction as [F1]. Its total mass is (∫Wf dμ)n<∞ by repeated Tonelli [F3].

1.2givenF1F2F3algebra

For a measurable rectangle B1×⋯×Bn, repeated use of [F2] gives ν⊗n(B1×⋯×Bn)=∏iν(Bi)=∏i∫Bif dμ. Repeated Tonelli [F3] gives the same value for ∫B1×⋯×BnFn dμ⊗n.

2.1step 1.1step 1.2F2F4∎

Rectangles form a generating pi-system containing the whole space Wn, and the product formula for Wn in step 1.2 shows that the two finite measures have the same finite total mass. Therefore [F4] applies and gives equality on all of BW⊗n. For n=0 the statement is the definition of the empty product measure.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Papangelou conditional intensity on a finite window

Definition

Let W, ℓW, and C(W) be as in Finite-window spatial observations and configurations. Let Pθ,b be a specified probability law on C(W); b denotes a fixed exterior configuration when the model uses a boundary condition, and is omitted when it does not. For this fixed boundary convention, a jointly measurable function λθ:W×C(W)→[0,+∞] is a Papangelou conditional intensity relative to ℓW for this law and boundary convention; the notation λθ(u;η,b) displays the fixed boundary label but b is not an additional variable in its measurable domain. Omit b when there is no exterior condition or when the fixed convention is clear from context. The defining identity holds when, for every nonnegative product-measurable h:W×C(W)→[0,∞], Eθ,b[∑x∈ηh(x,η−δx)]=Eθ,b[∫Wh(u,η)λθ(u;η,b) ℓW(du)]. The sum runs over atom occurrences, so η−δx deletes one occurrence; if b is used, it is fixed on both sides. The identity is the definition of the Papangelou intensity used on this page. It does not assert that every finite-window law has such a function.

The deletion operation and the resulting measurable random sum use Deleting one occurrence from a locally finite counting measure is measurable. On the occurrence domain, the deletion-composition is measurable; extend it by zero off that measurable domain and integrate against the evaluation kernel K(η,B)=η(B). This integral is the displayed sum, and its measurability follows from the deletion map and Measurability of integration against a kernel, as used in the deletion lemma.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-window point-process pseudolikelihood

Definition

Let W and C(W) be as in Finite-window spatial observations and configurations. Fix an observed configuration η∈C(W) and a boundary convention b (a specified exterior configuration held fixed, or no exterior configuration). When a model supplies a Papangelou conditional intensity λθ(u;ζ,b), define its finite-window pseudolikelihood criterion by PL⁡W,b(θ;η):=(∏x∈ηλθ(x;η−δx,b))exp⁡{−∫Wλθ(u;η,b) ℓW(du)}. The finite product counts multiplicities, the empty product is 1, and one occurrence is deleted in each event factor. The criterion is used only when the displayed intensity values and integral are finite; a zero event factor makes the criterion zero. The exterior pattern b is fixed throughout the calculation. This criterion is not asserted to be a joint likelihood, and its definition supplies no consistency or asymptotic guarantee.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-window Gibbs density relative to a Poisson reference

Definition

Let W and C(W) be as in Finite-window spatial observations and configurations, and let Q be a specified finite-window Poisson probability measure on that space. For each parameter θ, let Sθ⊆C(W) be a measurable admissible support and let Hθ:Sθ→R be measurable. Extend the weight by zero off Sθ: wθ(η)=e−Hθ(η) on Sθ and 0 elsewhere. Put Zθ:=∫C(W)wθ(η) Q(dη). Only when 0<Zθ<∞ do these data define the finite-window Gibbs law, with density dPθdQ(η)=Zθ−1wθ(η). The support and normalizer are part of the model specification. No general existence, mixing, consistency, or asymptotic result is included in this definition.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A finite Poisson process with atomless intensity is simple

Statement

Let ν be a finite atomless Borel measure on Rd, and let η be a Poisson point process with intensity ν. Then η is simple almost surely: with probability one, every singleton has mass at most one.

Facts & Assumptions

Given: A finite atomless Borel measure ν and a Poisson point process η of intensity ν.

[F1]

A counting configuration ξ is simple if ξ({x})≤1 for every x. This is a pointwise definition; almost-sure simplicity of η is the conclusion to be proved here. (Random measures and locally finite point processes)

[F2]

If ν is finite with Λ=ν(Rd)>0, the Poisson process law is the push-forward of e−ΛΛn/n! (ν/Λ)⊗n on each finite tuple space under (x1,…,xn)↦∑iδxi; if Λ=0, the process is zero. (Finite-intensity Poisson-process existence and mixed-binomial law)

The diagonal in Rd×Rd is measurable for the product Borel sigma-algebra: rational open boxes are countable and form a basis of Rd because every open neighbourhood of a point contains a box with rational endpoints around that point. Pairwise rectangles from this basis form a countable basis of the product topology. Every open set is therefore a countable union of product-measurable rectangles, and the closed diagonal is product-measurable.

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2

Put Λ=ν(Rd). If Λ=0, [F2] says the process is the zero measure, which is simple by [F1]. Suppose Λ>0 and set Q=ν/Λ. Atomlessness of ν implies Q({x})=0 for every x∈Rd.

1.2F1construct

For m∈N0 and k∈Zd, put Cm,k=2−m(k+[0,1)d). The set H={ξ:ξ(Rd)<∞}∩⋃m≥0⋂k∈Zd{ξ:ξ(Cm,k)≤1} is evaluation-measurable, since all cubes are Borel and the unions and intersections are countable. It is exactly the set of finite simple configurations: a repeated location forces a count at least two in its cube at every scale; conversely, a finite set of distinct locations has positive minimum pairwise distance when it has at least two points, so cubes of sufficiently small diameter contain at most one point. Counts zero and one satisfy the condition at every scale.

2.1givenstep 1.1F3algebra

Fix n≥2 and a pair i<j of coordinate indices. The diagonal is product-measurable by the preceding basis argument. Under Q⊗n, the event xi=xj has measure ∫Q({x}) Q(dx)=0 by [F3] and step 1.1, since every singleton has zero Q-mass by step 1.1. The other n−2 coordinates contribute total mass one. There are only finitely many pairs among n coordinates, so with Q⊗n-probability one no two coordinates coincide.

3.1step 1.2step 2.1F1F2algebra∎

In the mixed-binomial construction [F2], the image configuration belongs to H with probability one on each component: step 2.1 treats n≥2, and counts n=0,1 are simple directly. Summing over the component probabilities gives mass one to H. Since H is measurable by step 1.2 and every Poisson process with intensity ν has this push-forward law by [F2], P{η∈H}=1. Thus η is simple almost surely.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite-window spatial Poisson likelihood relative to unit rate

Statement

Let W⊂Rd and C(W) be as in Finite-window spatial observations and configurations, with volume v=∣W∣<∞. For each parameter θ, let λθ:W→[0,∞) be a finite-valued Borel function and assume Λθ:=∫Wλθ(x) ℓW(dx)<∞. Extend λθ by zero off W and let Pθ be the law on C(W) of the Poisson process on Rd with intensity measure νθ=1Wλθ dℓd. Let P0 be the unit-rate Poisson law on C(W) obtained from intensity 1W dℓd. Then dPθdP0(η)=gθ(η):=exp⁡{v−Λθ}∏x∈ηλθ(x). where the product counts atom occurrences and the empty product is 1. In particular Pθ≪P0. This formula explicitly chooses a common parameter-indexed density version, so it requires no arbitrary simultaneous selection of Radon–Nikodym representatives.

For an observed η, if every observed occurrence has positive intensity, the log likelihood, up to the parameter-independent term v, is ℓη(θ)=∑x∈ηlog⁡λθ(x)−Λθ. If any observed occurrence has zero intensity, the likelihood is zero and its log is −∞.

Facts & Assumptions

Given: The window W, the parameter-indexed intensities, and their finite integrals as in the Statement.

[F1]

C(W) is the finite-window configuration space, with boundary points included exactly when they belong to W; v=ℓW(W)<∞. (Finite-window spatial observations and configurations)

[F2]

A nonnegative measurable density f relative to a measure μ defines the measure f dμ, and its total mass is ∫f dμ. (The measure with density f relative to μ)

[F3]

The law of a Poisson process with finite intensity ν is the push-forward of ∑n≥0e−ν(W)ν(W)n/n! (ν/ν(W))⊗n under (x1,…,xn)↦∑iδxi; the zero-intensity case is the empty process. (Finite-intensity Poisson-process existence and mixed-binomial law)

[F4]

For a finite measure with density f, the n-fold product has density ∏i=1nf(xi) relative to the n-fold product of the reference measure. (Finite products of measures with densities have the product density)

[F5]

The occurrence product η↦∏x∈ηf(x) is measurable for every finite-valued Borel f. (Products of a measurable intensity over finite configurations are measurable)

[F6]

In a dominated experiment the supplied reference measure is fixed, and a likelihood density at the observation is a chosen density version evaluated there. (Dominated statistical experiments, Likelihood densities)

[F7]

Proof

Given: λθ is finite-valued Borel and ∫Wλθ dℓW=Λθ<∞.

1.1givenF1F2F3

The zero extension of λθ is Borel: for Borel E⊆[0,∞) its inverse image is W∩λθ−1(E) if 0∉E, and Wc∪(W∩λθ−1(E)) if 0∈E; both are Borel because W is Borel and λθ is Borel on W. Thus [F2] defines its finite measure of total mass Λθ on Rd, supported on W. The unit-rate reference intensity 1W dℓd has total mass v by [F1]. Thus [F3] applies to both Poisson laws, and their finite-mixture tuple integrals are supported on Wn.

1.2givenF5construct

The product factor in gθ is measurable by [F5], and the exponential factor is a finite nonnegative constant. Hence gθ is a measurable nonnegative function on C(W).

2.1step 1.1F3F4

Let A⊆C(W) be measurable. Expanding [F3] for Pθ on its support W and using [F4] gives Pθ(A)=e−Λθ∑n=0∞1n!∫Wn1A ⁣(∑i=1nδxi)∏i=1nλθ(xi) ℓW⊗n(d(x1,…,xn)). For P0, the same formula holds with Λθ replaced by v and every product factor replaced by 1.

3.1step 2.1F3F4algebra

Expand ∫Agθ dP0 by the P0 formula in step 2.1. On the n-tuple component, gθ(∑iδxi)=ev−Λθ∏iλθ(xi), including n=0 by the empty-product convention. Cancellation of e−v with ev yields exactly the series for Pθ(A) in step 2.1.

4.1step 1.2step 3.1F6F7algebra∎

Since step 3.1 holds for every measurable A, gθ is a Radon–Nikodym density of Pθ relative to P0, and therefore Pθ≪P0. The explicitly displayed gθ supplies the density version for every θ, so the arbitrary selector in [F6] is not used. Taking its logarithm gives the stated expression when all event factors are positive; a zero factor makes the finite product zero and the log likelihood −∞.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck pendingjudge pass (gpt-6-luna)Open item page →

Homogeneous Poisson rate MLE in a positive-volume window

Statement

Let W be as in Finite-window spatial observations and configurations and suppose v=∣W∣>0. Consider the homogeneous family λρ(x)=ρ with parameter space either [0,∞) or (0,∞). For an observed configuration with n=η(W) occurrences, if n>0 the unique maximum likelihood estimate is ρ^=n/v. If n=0, the likelihood is maximized at ρ=0 when zero is in the parameter space; on (0,∞) its supremum is the boundary value at ρ↓0 and is not attained.

Facts & Assumptions

Given: v>0, a finite configuration η with count n=η(W), and the homogeneous intensity λρ=ρ.

[F1]

For ρ>0, the log likelihood up to a parameter-independent constant is nlog⁡ρ−vρ; for a zero event factor the likelihood is zero. (Finite-window spatial Poisson likelihood relative to unit rate)

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2algebra

Suppose n>0 and put ρ^=n/v>0. For ρ>0 set t=ρ/ρ^. By [F1] and the logarithm quotient law [F2], the log-likelihood difference is ℓ(ρ)−ℓ(ρ^)=n(log⁡t−t+1).

1.2givenF1algebra

Suppose n=0. For ρ>0, [F1] gives log likelihood −vρ, which is strictly below 0 and tends to 0 as ρ↓0. At ρ=0, the empty product is 1 and the density in Finite-window spatial Poisson likelihood relative to unit rate has log likelihood equal to its parameter-independent constant, so the normalized log likelihood value is 0. Thus zero is the maximizer when admitted and is only a supremum when the parameter space is (0,∞).

2.1givenstep 1.1F1F2F3algebra

Let ψ(t)=log⁡t−t+1. For each s>0, ψ(s+h)−ψ(s)h=log⁡(s+h)−log⁡sh−1⟶1s−1 as h→0, by [F2]; hence ψ′(s)=1/s−1. If t>1, apply [F3] on [1,t]: its intermediate point c>1 has ψ′(c)<0, so ψ(t)<ψ(1)=0. If 0<t<1, apply [F3] on [t,1]: its intermediate point has ψ′(c)>0, so again ψ(t)<ψ(1)=0. Equality holds at t=1. Therefore [F1] and step 1.1 give the unique maximum at ρ=ρ^ among positive rates; at ρ=0 the observed nonempty configuration has likelihood zero.

3.1step 1.1step 2.1step 1.2∎

Steps 1.1 and 2.1 prove the positive-count claim, and step 1.2 proves the zero-count boundary claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A positive finite-window Gibbs density has its density-ratio Papangelou intensity

Statement

Let Q be the unit-rate Poisson law on C(W) from Finite-window spatial observations and configurations. Suppose g:C(W)→(0,∞) is measurable, finite everywhere, and ∫g dQ=1. Let P=gQ and define λg(u;η):=g(η+δu)g(η). Then λg is a Papangelou conditional intensity for P relative to ℓW in the sense of Papangelou conditional intensity on a finite window.

Facts & Assumptions

Given: The hypotheses in the Statement and a nonnegative product-measurable test function h on W×C(W).

[F1]

For a finite-intensity Poisson process ξ and every nonnegative measurable k, the add-one Mecke identity is EQ∑x∈ξk(x,ξ)=∫WEQ[k(u,ξ+δu)] ℓW(du). (Mecke identity for a finite-intensity Poisson point process)

[F2]

On the measurable domain where an occurrence at x is present, (x,η)↦η−δx is measurable and deletes one occurrence. (Deleting one occurrence from a locally finite counting measure is measurable)

[F3]

A Papangelou conditional intensity is characterized by the deletion form of the Georgii–Nguyen–Zessin identity. (Papangelou conditional intensity on a finite window)

[F4]

Evaluation maps generate the configuration sigma-algebra, and the Dirac mass at u evaluates to 1B(u); hence (η+δu)(B)=η(B)+1B(u) is measurable. (Finite-window spatial observations and configurations, The Dirac set function at a point)

[F5]

The finite Poisson reference with intensity 1Wℓd is concentrated on C(W), since its mixed-binomial locations lie in W. (Finite-intensity Poisson-process existence and mixed-binomial law, Finite-window spatial observations and configurations)

[F6]

Tonelli's theorem interchanges the nonnegative expectation and window integral. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

Proof

Given: g is a positive finite density relative to the finite unit-rate Poisson law Q.

1.1givenF1F2F4F5construct

Extend g and h by zero outside C(W) and W×C(W), respectively; [F5] makes these measurable extensions. For a test function h as in the Statement, define on the domain where (x,ζ) contains an occurrence at x k(x,ζ):=g(ζ)h(x,ζ−δx), and set k=0 off that domain. The domain and deletion map are measurable by [F2]; the extensions, addition operation, and g,h are measurable by [F4, F5], so k is a nonnegative measurable test function for [F1]. Also the addition map is measurable by [F4], and since g is finite and strictly positive, its ratio λg(u;η)=g(η+δu)/g(η) is a measurable function on W×C(W).

2.1step 1.1F1F3F5F6algebra

The left side of [F1] with this k is EQ[g(ξ)∑x∈ξh(x,ξ−δx)]=EP∑x∈ηh(x,η−δx). On the right side, (u,ξ+δu) is in the deletion domain and (ξ+δu)−δu=ξ, so the integrand is g(ξ+δu)h(u,ξ)=g(ξ)λg(u;ξ)h(u,ξ). Consequently [F1] gives, after Tonelli's interchange [F6], EP∑x∈ηh(x,η−δx)=EP∫Wh(u,η)λg(u;η) ℓW(du). which is the defining identity [F3].

3.1step 2.1∎

Step 2.1 proves the claimed Papangelou identity for every admissible nonnegative h, hence proves the Statement.

5 · Examples, counterexamples and false statements

None yet.

Sources