mathstodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance for maths people. We have LaTeX rendering in the web interface!

Server stats:

2.8K
active users

David Radcliffe

Can you show that
f(x):=x
is the sum of two periodic functions?

Proof:

By the Axiom of Choice, there exists a subset 𝑆 of ℝ that contains exactly one element from each coset of ℤ+√2ℤ .

For each 𝑥∈ℝ there exist unique elements 𝑠ₓ∈𝑆 and 𝑚ₓ,𝑛ₓ∈ℤ so that 𝑥=𝑠ₓ+𝑚ₓ+𝑛ₓ√2 .

Define 𝑔(𝑥)=𝑚ₓ and h(x)=sx+nx2.

Then 𝑓(𝑥)=𝑔(𝑥)+h(𝑥) , 𝑔(𝑥) has period 2 , and h(𝑥) has period 1.

@davidradcliffe If the two periods are rationally related then the sum has to be periodic as well, so that wouldn't work...

Let's check that

$$ g(x) + h(x) = \lfloor x \rfloor $$

By definition

$$ g(x) + h(x) = m_x + \lfloor s_x + n_x \sqrt{2} \rfloor $$

but you can push an integer inside the floor function so

$$ g(x) + h(x) = \lfloor m_x + s_x + n_x \sqrt{2} \rfloor =\lfloor x \rfloor $$

If I understand correctly, mx doesn't change when you add 2 to x, nx is unchanged when you add 1 to x, and sx is unchanged when you add either 2 or 1 to x.

Fun to observe that your proof only relies on irrationality of the square root of 2, and any irrational number works in its place.