14.08.2013 Views

Paperfolding, Automata, and Rational Functions - Diagonals and ...

Paperfolding, Automata, and Rational Functions - Diagonals and ...

Paperfolding, Automata, and Rational Functions - Diagonals and ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Hence, since Fp is finite, there are only a finite number of distinct<br />

yα 1...αe <strong>and</strong> we have a result of Christol, Kamae, Mendès France, <strong>and</strong><br />

Rauzy, here proved by the elegant independent methods of Jan Denef<br />

<strong>and</strong> Leonard Lipshitz.<br />

Theorem. If y = P aνx ν is algebraic then<br />

(F) there is an e such that for every (α1, . . . , αe) ∈ Se there is an<br />

e ′ < e <strong>and</strong> a (β1, . . . , βe ′) ∈ Se′<br />

such that<br />

yα 1...αe = yβ 1...β e ′ ;<br />

(A) equivalently, there is an e such that for all j = (j1, . . . , jn) with the<br />

ji < pe there is an e ′ < e <strong>and</strong> a j ′ = (j ′ 1 , . . . , j′ n) with the j ′<br />

i < pe′<br />

such that<br />

ap e ν+j = a p e ′ ν+j ′ for all ν .<br />

Conversely, if y satisfies (F) then taking yβ 1...β e ′ <strong>and</strong> breaking it up<br />

e − e ′ times, we see that the yα 1...αe satisfy a system of the form<br />

yα 1...αe = X x γ y pe−e′<br />

β 1...βe .<br />

By an easy lemma it follows that the yα 1...αe , <strong>and</strong> hence y , must be<br />

algebraic.<br />

33

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!