On the set of derivations with big graph (Q2496993)

A derivation is a function \(f:\mathbb R \to \mathbb R\) satisfying the functional equations \[ f(x+y)=f(x)+f(y), \quad f(xy)=xf(y)+yf(x), \] for all \(x, y \in \mathbb R\). A function \(f:\mathbb R \to \mathbb R\) has a big graph iff \[ B \cap \text{Graph}(f) \neq \emptyset \] for every Borel set in \(\mathbb R^2\) with its projection on the first axis having the cardinality of the countinuous. The main result of the paper says that the set of derivations with big graph is dense (in the Tikhonov topology) in the set of all derivations.