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

Strong, uniform, and maximal-correlation mixing coefficients

Definition

Let Y=(Yk)k≥0 be a process on a probability space whose finite-dimensional laws are invariant under common nonnegative time shifts; call this strict stationarity. For j≥0, set Fj−:=σ(Y0,…,Yj) and Fj+:=σ(Yj,Yj+1,…). For n≥1, define the strong-mixing coefficient by αY(n):=sup⁡j≥0 sup⁡A∈Fj−B∈Fj+n+∣P(A∩B)−P(A)P(B)∣.

Define the uniform-mixing coefficient by ϕY(n):=sup⁡j≥0 sup⁡A∈Fj−P(A)>0 sup⁡B∈Fj+n+∣P(B∣A)−P(B)∣.

For square-integrable real random variables U,V with positive variances, write Corr⁡(U,V):=Cov⁡(U,V)Var⁡(U)Var⁡(V). For each n≥1, let Cn consist of the triples (j,U,V) such that j≥0, U,V are real and square-integrable, U and V are measurable with respect to Fj− and Fj+n+ respectively, and both have positive variance. Define the maximal-correlation coefficient by ρY(n):=sup⁡({0}∪{∣Corr⁡(U,V)∣:(j,U,V)∈Cn}), where square-integrability is in the sense of The space Lp(μ) as the quotient by null functions. Thus ρY(n)=0 when there is no admissible pair, as for a constant process. The process is called strongly mixing, uniformly mixing, or rho-mixing, respectively, when the corresponding coefficient tends to zero. These coefficients are distinct conditions; no implication between them is included in this definition.

Depends on

Used by

Dependency tree · two levels

9 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