Fubini's nightmare explained

Fubini's nightmare is a seeming violation of Fubini's theorem, where a nice space, such as the square

[0,1] x [0,1],

is foliated by smooth fibers, but there exists a set of positive measure whose intersection with each fiber is singular (at most a single point in Katok's example). There is no real contradiction to Fubini's theorem because despite smoothness of the fibers, the foliation is not absolutely continuous, and neither are the conditional measures on fibers.

Existence of Fubini's nightmare complicates fiber-wise proofs for center foliations of partially hyperbolic dynamical systems: these foliations are typically Hölder but not absolutely continuous.

A hands-on example of Fubuni's nightmare was suggested by Anatole Katok and published by John Milnor.[1] A dynamical version for center foliation was constructed by Amie Wilkinson and Michael Shub.[2]

Katok's construction

Foliation

For a

p\in(0,1)

consider the coding of points of the interval

[0,1]

by sequences of zeros and ones, similar to the binary coding, but splitting the intervals in the ratio

(1-p):p

. (As for the binary coding, we identify

0111\ldots

with

1000\ldots

)

The point, corresponding to a sequence

(a1,a2,...)\in\{0,1\}\N,

is given explicitly by

Fp(a1,a2,...) =

\sum
n:an=1

an(1-p)\elln-1=

infty
\sum
n=1

an

\#\{j\len-1:aj=1\
p
} (1-p)^,where

\elln=

\#\{j\len:aj=1\
p
} (1-p)^is the length of the interval after first

n

splits.

For a fixed sequence

a\in\{0,1\}\N,

the map

p\mapstoFp(a)

is analytic. This follows from the Weierstrass M-test: the series for

p\mapstoFp(a)

converges uniformly on compact subsets of the intersection

\{|p|<1\}\cap\{|1-p|<1\}\subsetC.

In particular,

\gammaa=\{(p,Fp(a)):p\in(0,1)\}

is an analytic curve.

Now, the square

(0,1) x [0,1]

is foliated by analytic curves

\gammaa,a\in\{0,1\}\N.

Set

For a fixed

p

and random

x\in[0,1],

sampled according to the Lebesgue measure, the coding digits

a1=a1(x;p),a2=a2(x;p),...

are independent Bernoulli random variables with parameter

p

, namely

P(an=1)=p

and

P(an=0)=1-p.

By the law of large numbers, for each

p

and almost every

x,

1
n
n
\sum
j=1

aj(x;p)\top,n\toinfty.

By Fubini's theorem, the set

M=\left\{(p,x):

1
n
n
\sum
j=1

aj(x;p)\xrightarrow[n\toinfty]{}p\right\}

has full Lebesgue measure in the square

(0,1) x [0,1]

.

However, for each fixed sequence

(an),

the limit of its Cesàro averages

(a1++an)/n

is unique, if it exists. Thus every curve

\gammaa

either does not intersect

M

at all (if there is no limit), or intersects it at the single point

(p,Fp(a)),

where

p=\limn\toinfty

a1+...+an
n

.

Therefore, for the above foliation and set

M

, we observe a Fubini's nightmare.

Wilkinson–Shub construction

Wilkinson and Shub considered diffeomorphisms which are small perturbations of the diffeomorphism

A x id

of the three dimensional torus

T3=T2 x S1,

where

A=\left(\begin{smallmatrix}2&1\ 1&1\end{smallmatrix}\right):T2\toT2

 is the Arnold's cat map. This map and its small perturbations are partially hyperbolic. Moreover, the center fibers of the perturbed maps are smooth circles, close to those for the original map.

The Wilkinson and Shub perturbation is designed to preserve the Lebesgue measure and to make the diffeomorphism ergodic with the central Lyapunov exponent

λc0.

Suppose that

λc

is positive (otherwise invert the map). Then the set of points, for which the central Lyapunov exponent is positive, has full Lebesgue measure in

T3.

On the other hand, the length of the circles of the central foliation is bounded above. Therefore, on each circle, the set of points with positive central Lyapunov exponent has to have zero measure. More delicate arguments show that this set is finite, and we have the Fubini's nightmare.

Notes and References

  1. J. . Milnor . Fubini Foiled: Katok’s Paradoxical Example in Measure Theory . The Mathematical Intelligencer . 19 . 1997 . 2 . 30—32 . 10.1007/BF03024428 .
  2. M. . Shub . A. . Wilkinson . Pathological foliations and removable zero exponents . Inventiones mathematicae . 139 . 2000 . 495—508 . 10.1007/s002229900035 .