Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Poincare recurrence for finite measure-preserving systems

Statement

In a measure-preserving system (X,A,μ,T) with μ(X)<∞, for every E∈A almost every x∈E has Tnx∈E for infinitely many positive integers n.

Facts & Assumptions

[F1]

The set with no positive return and every one of its inverse-image levels are measurable and null. No-return sets have disjoint null preimage towers.

[F2]

A countable union of measurable null sets is null. Finite and countable subadditivity of measures.

Proof

Given: In a measure-preserving system (X,A,μ,T) with μ(X)<∞, for every E∈A almost every x∈E has Tnx∈E for infinitely many positive integers n.

1.1F1F2

Put W=E∖⋃n≥1T−nE and N=⋃m≥0T−mW. Every set in this union is measurable and null, whence N is measurable and μ(N)=0.

2.1step 1.1given∎

If x∈E has only finitely many positive return times, the finite nonempty set {m≥0:Tmx∈E} has a largest member q (it contains zero). There is no positive return to E from Tqx, so Tqx∈W and x∈N. Thus every x∈E∖N returns infinitely often. Conversely a point of E∩T−qW has no visit after q, so the exceptional set is exactly E∩N and is measurable. The argument includes the case of no positive return by taking q=0.

Depends on

Used by

Dependency tree · two levels

11 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