Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources