Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Diffusion-scale walk and recurrence/coarse-entropy counterexamples

Physical scope

A finite IID symmetric walk under diffusive scaling, an explicitly defined periodic rotor, and a four-state measure-preserving permutation. Results are conditional model calculations; no collision-to-diffusion limit, path-space convergence, experimental observation, or universal entropy law is asserted.

Statement

Assume the Axiom of Choice. The following are separate calculations for three explicitly defined models.

Diffusive-scale walk. Let D>0 have units m2s−1, fix t≥0 seconds, and let (δtj)j≥1 be any positive sequence tending to zero, with ℓj=2Dδtj metres and nj=⌊t/δtj⌋. For each j, on the finite product space Ωj={−1,1}nj with uniform probability, let Ξi be the coordinate increments and Sj=ℓj∑i=1njΞi. For the dimensionless lattice index r∈Z, define un(r):=2−n#{(x1,…,xn)∈{−1,1}n:∑i=1nxi=r}, with the empty sum equal to zero. Then ESj=0, Var⁡(Sj)=njℓj2, and the lattice probabilities satisfy un+1(r)=12un(r−1)+12un(r+1) with u0(r)=1{r=0}. For every wave number k∈R in m−1, φSj(k)=cos⁡(ℓjk)nj. The laws of Sj converge weakly on R to N(0,2Dt), the normal probability law with mean zero and variance 2Dt (in m2). The conclusion is fixed-time marginal convergence only.

Periodic rotor. Let T:=R/(2πZ) with its quotient topology, and let the phase space X=T×R have its metrizable product topology. Let q∈T be a dimensionless angle, p∈R have units kg m2s−1, and I>0 have units kg m2. Define the model energy H(q,p)=p2/(2I) and, for time s∈R measured in seconds, the flow Φs(q,p)=(q+ps/I mod 2π, p). For each p0≠0, the orbit is periodic with period T=2πI/∣p0∣ seconds. Let ν be normalized arc length on T, define the continuous inclusion ιp0(q)=(q,p0), and for each Borel E⊆X set μ0(E)=ν(ιp0−1(E)). Thus μ0 is the uniform angle probability on the fixed-p0 orbit. For this invariant probability, mixing means μ0(B∩Φs−1C)→μ0(B)μ0(C) for all Borel B,C⊆X as s→∞. The rotor is not mixing: for the half-circle arc A={([q],p0):q∈[0,π)}, where [q]=q+2πZ∈T, the mixing correlation fails along times s=mT with positive integers m. For any q0=[θ0]∈T, the point-supported initial law δ(q0,p0) (unit mass at (q0,p0)) has no weak limit as s→∞; the bounded continuous witness g([θ],p)=cos⁡(θ−θ0) is well-defined because cosine is 2π-periodic.

Finite coarse-entropy model. Let Ω={0,1,2,3} with uniform reference probability and permutation T(0)=1,T(1)=2,T(2)=3,T(3)=0. Start from π0=(1/2,1/2,0,0), and evolve by pushforward under T. For the coarse partition {{0,1},{2,3}}, let (r1,r2) be any probability vector with ri≥0 and r1+r2=1, and define its coarse Shannon entropy by Hc(r1,r2)=−∑i:ri>0rilog⁡ri in nats. Define fine entropy analogously for a probability vector on the four states, using 0log⁡0=0. The coarse entropies at times 0,1,2 are 0,log⁡2,0, while the fine entropy is log⁡2 at all three times. Thus deterministic invertibility and preservation of the uniform reference measure do not imply monotone coarse entropy.

The smooth-flow result Fine entropy under a specified incompressible periodic flow has different hypotheses: it concerns positive C1 densities on a flat torus transported by supplied jointly C2 volume-preserving diffeomorphisms and preserves their dimensionless fine differential entropy. It supplies no monotonicity conclusion for coarse entropy in a finite permutation. These models report no observations and prove no diffusion limit from deterministic collisions.

Facts & Assumptions

Given: The Axiom of Choice; the finite product walk laws; the stated rotor flow and dimensions; the four-state permutation and initial probability vector; and the definitions of the entropies in the Statement.

[F1]

Declared example preparations and thermodynamic interpretation: product preparations are separately specified probability laws in consuming model statements, not consequences of flow and not assertions that a laboratory realizes them.

[F2]

Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space is a finite set with nonnegative outcome weights summing to one.

[F3]

Real random variables on finite probability spaces and their finite distributions: a finite real random variable is a function from the finite outcome set to R.

[F4]
[F5]

Characteristic function of a real random variable: φX(k)=E[eikX]; for a Borel law μ, φμ(k)=∫eikx μ(dx).

[F6]

Standard normal and normal laws: N(m,σ2) is the law of m+σZ for a standard normal Z, including N(m,0)=δm.

[F7]

Characteristic function of a normal law: assuming AC, N(m,σ2) has characteristic function eimk−σ2k2/2 for every real k, including σ=0.

[F8]

Characteristic function criterion for weak convergence: assuming AC, Borel probability laws on R converge weakly to a specified Borel probability law if their characteristic functions converge pointwise at every real frequency.

[F9]

The Axiom of Choice: AC states that every family of nonempty sets has a choice function; the weak-convergence and normal-law suppliers explicitly require this full axiom.

[F10]

The derivatives of sine and cosine are cosine and minus sine: sin⁡′=cos⁡, cos⁡′=−sin⁡, sin⁡0=0, and cos⁡0=1.

[F11]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of exp⁡ on (0,∞).

[F14]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): derivatives of differentiable compositions are compositions of derivatives.

[F15]

Peano's form: the normalized Taylor remainder tends to zero: if f is twice differentiable on an open neighbourhood of 0, then f(u)=f(0)+f′(0)u+12f′′(0)u2+o(u2).

[F16]

The one-dimensional torus and its normalized Haar integral: under countable choice, on R/Z the probability measure is the pushforward of Lebesgue measure on [0,1) and is translation-invariant; rescaling the angle by 2π gives normalized arc length on R/(2πZ).

[F17]

Fine entropy under a specified incompressible periodic flow: its current same-run draft statement says that for a specified jointly C2 diffeomorphic flow on a flat torus with identity initial map, C1 divergence-free velocity, and positive bounded C1 probability density, the dimensionless fine differential entropy of the transported density is finite and conserved; the item's proof is complete conditional on its stated mathematical suppliers, but independent review remains pending.

[F18]

Weak convergence of borel probability measures: weak convergence of Borel probability measures on a metric space means convergence of integrals against every bounded continuous real-valued function.

[F19]

Variance of a finite real random variable: on a finite probability space, Var⁡(Y)=E[(Y−E[Y])2].

[A1]

For each walk index j, the coordinates on {−1,1}nj are assigned the explicit uniform product weights 2−nj; the different j may use different finite spaces.

[A2]

The rotor law is the explicit flow in the Statement; no flow-existence theorem, ergodic hypothesis, or coupling to another system is assumed.

[A3]

The four-state probability evolves by the stated deterministic pushforward, with no stochastic reset.

Proof

Given: The definitions and model assumptions in the Statement and Facts & Assumptions; assume full AC for the weak-convergence and normal-law suppliers.

1.1givenA1F1F2F3F4F19algebra

Under the product-preparation convention [F1], for a fixed j the uniform weight on {−1,1}nj is a probability law, including the singleton case nj=0. Each increment has mean zero and square one by [F2]–[F4]. Independence follows from the product weights, so the cross terms in E(∑iΞi)2 vanish; hence ESj=0 and, by [F19], Var⁡(Sj)=njℓj2. Conditioning on the last increment gives un+1(r)=12un(r−1)+12un(r+1), with the stated initial mass.

1.2givenA2F9F16algebra

For the rotor, write Rs(q)=q+p0s/I modulo 2π. At T=2πI/∣p0∣, the angle increment is 2π when p0>0 and −2π when p0<0, so RT is the identity. The stated full AC includes the countable-choice assumption of [F16]. For every Borel E⊆X, ιp0−1(Φs−1E)=Rs−1(ιp0−1E); translation invariance in [F16] therefore gives μ0(Φs−1E)=μ0(E), and in particular μ0 is invariant under the rotor flow.

1.3givenA3F11algebra

Under the four-state pushforward, the first three probability vectors are π0=(1/2,1/2,0,0),π1=(0,1/2,1/2,0),π2=(0,0,1/2,1/2). The map T is a permutation, so it maps the uniform reference weights 1/4 to themselves; it also leaves the multiset of the evolving fine probabilities unchanged, and each fine entropy is −12log⁡12−12log⁡12=log⁡2. The coarse cell probabilities for {{0,1},{2,3}} are (1,0), (1/2,1/2), and (0,1), giving coarse entropies 0,log⁡2,0 under the zero-term convention. This proves the stated decrease.

2.1givenA1F5F6F7F10F11F12F13F14F15step 1.1algebra

By independence and [F5], the characteristic function is φSj(k)=∏i=1njE(eikℓjΞi)=cos⁡(ℓjk)nj. Fix k. Continuity of cosine and cos⁡0=1 make cos⁡u>0 for all sufficiently small ∣u∣. For such u, put f(u)=log⁡cos⁡u. By the chain rule, f′(u)=−sin⁡u/cos⁡u and f′(0)=0. From [F10], sin⁡u/u→sin⁡′(0)=1 and cos⁡u→1, so the difference quotient f′(u)/u=−sin⁡u/(ucos⁡u) tends to −1; hence f′′(0)=−1. The same derivative rules make f twice differentiable on a neighbourhood of zero, so [F15] gives log⁡cos⁡u=−u2/2+o(u2). For t>0, njδtj→t because 0≤t−njδtj<δtj, and therefore njlog⁡cos⁡(ℓjk)=−njℓj2k22+nj o(ℓj2)⟶−Dtk2. Indeed njℓj2=2Dnjδtj→2Dt, so njℓj2 is bounded, while o(ℓj2)/ℓj2→0; their product proves the remainder tends to zero. For t=0, nj=0 and every law is δ0. Thus in all cases φSj(k)→e−Dtk2=φN(0,2Dt)(k) for every real k, using [F6]–[F7] for the target law.

2.2givenF16F18step 1.2algebra

The measure definition gives μ0(A)=ν([0,π))=1/2. At each s=mT, Φs is the identity on the support of μ0, so μ0(A∩Φs−1A)=1/2≠1/4=μ0(A)2, contradicting the mixing condition stated in the Statement. For q0=[θ0], the function g([θ],p)=cos⁡(θ−θ0) is well-defined and continuous on the quotient because cosine is continuous and 2π-periodic, and it is bounded by 1. Its values are 1 at times mT and −1 at times mT+T/2, so its expectation has no limit. By [F18], weak convergence would force convergence of this expectation, so the evolving point laws have no weak limit.

2.3givenF17step 1.3

The mathematical result [F17] assumes a smooth diffeomorphic flow on a flat torus, divergence-free velocity, and a positive bounded C1 density. The atomic four-state law in step 1.3 is not such a density or flow; its coarse-entropy decrease neither invokes nor contradicts that fine differential-entropy result. It establishes no monotonicity law for other coarse-graining procedures.

3.1givenF7F8F9step 1.1step 2.1

The right-hand side of step 2.1 is the characteristic function of the specified Borel probability N(0,2Dt). Apply the reverse implication of [F8] to the Borel laws of Sj to obtain weak convergence. The only non-finite-choice strength used here is the full AC explicitly carried by [F7]–[F9]; the finite product construction is in step 1.1 and its pointwise characteristic calculation is in step 2.1.

4.1givenA1A2A3step 1.1step 2.1step 3.1step 1.2step 1.3∎

The walk limit in steps 1.1–2.1 concerns only fixed-time marginal laws under the stated independent-increment scaling; no path-space limit, deterministic collision limit, experiment, observed frequency, or empirical inference is part of the hypotheses or conclusion.

Remarks

The full Axiom of Choice includes the countable-choice assumption of the normalized torus-measure definition [F16] and is also required by the imported normal-law and weak-convergence interfaces [F7]–[F9]. The recurrence, finite permutation, and finite product calculations themselves are choice-free. A finite histogram is not an underlying probability law, and no histogram is supplied as one here.

Depends on

Dependency tree · 2 levels

Sources