Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
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.

Hitting, return, and visit times

Definition

Let (Xn,Fn)n≥0 be an adapted Stochastic processes and their finite-dimensional distributions with values in a countable set E equipped with 2E. For A⊆E, define

TA:=inf⁡{n≥0:Xn∈A},Tx:=T{x},Tx+:=inf⁡{n≥1:Xn=x}.

The infimum of the empty set is +∞. The visit count is the extended nonnegative integer

Nx:=∑n≥01{Xn=x}∈N0∪{+∞}.

For a process started at x, put R0=0 and define recursively

Rk={inf⁡{n>Rk−1:Xn=x},Rk−1<∞,+∞,Rk−1=∞.

Thus a later return time is assigned +∞ if the preceding one is infinite; the expression X∞ is never used. For every A and n≥0,

{TA≤n}=⋃j=0n{Xj∈A},{Tx+≤n}=⋃j=1n{Xj=x},

where the second union is empty when n=0. Adaptedness makes these events belong to Fn, so these are stopping times under Discrete stopping time.

Depends on

Used by

Dependency tree · two levels

5 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