Solution.
Let k∈N. Since everything is non-negative in the following, we may apply Fubini-Tonelli to obtain
∫kk+1n=1∑∞n1∣∣f(x−n)∣∣dx=n=1∑∞n1∫kk+1∣∣f(x−n)∣∣dx=n=1∑∞n1∫kk+1∣∣f(x−n)∣∣dx=n=1∑∞n1∫k−nk+1−n∣f(x)∣dx=n=1∑∞n1∫Rχ{k−n≤x≤k+1−n}∣f(x)∣dx=∫R∣f(x)∣n=1∑∞n1χ{k−x≤n≤k+1−x}dx.(x↦x−n)
To complete the proof, we will estimate the sum. Notice that because n≥1,
k−x≤n≤k+1−x⟹max{1,k−x}≤n≤1+max{1,k−x}⟹(max{1,k−x})2≤n≤(1+max{1,k−x})2.
Thus, for each x, there are at most
(1+max{1,k−x})2−(max{1,k−x})2+1=2max{1,k−x}+2
non-zero terms in the sum. Hence,
∫kk+1n=1∑∞n1∣∣f(x−n)∣∣dx≤∫R∣f(x)∣max{1,k−x}2max{1,k−x}+2dx≤4∥f∥L1,
so the sum converges absolutely for almost every x∈[k,k+1]. Since k is arbitrary, it follows that the sum converges absolutely almost everywhere.