I am asked to show that for any $A\subset \mathbf{R}\setminus \{0\}$ with $|A| = n$, there is a subset $B\subset A$ of more than $n/3$ numbers such that no $a_1,a_2,a_3\in B$ satisfy $a_1+a_2=a_3$. I am aware of this question, indeed I managed to prove this part using the probabilistic method. However I have no idea how to extend this property to irrational numbers.
I tried to slightly perturb every $a\in A$ by a tiny number to produce a set of rational for which the result then holds. But then a subset of those rationals that is sum free does not necessarily map back to a set of the irrationals that is sum free.
Maybe we can partition $A$ into sets $A_1,\ldots, A_k$ such that elements in $A_i$ have rational ratios with each other and then.... ?
Any ideas? Thanks!
Update I think we might be able to do it as follows. If $a_i+a_j - a_k\neq 0$ then it exceeds in magnitude some rational number $q_{ijk}$. For $ijk$ such that $a_i+a_j -a_k = 0$, set $q_{ijk} = 0$. Then define the set of conditions on a set $B = \{b_1,\ldots, b_n\}$:
\begin{align} b_i + b_j + b_k = 0 &\iff q_{ijk} = 0,\\ b_i + b_j + b_k \geq q_{ijk} &\iff q_{ijk} \neq 0.\\ \end{align} This is a set of $3^n$ conditions. It seems like a linear programming question without any optimization part. I know little about these kinds of problems but maybe there is some theorem that we may use to show that the above has a solution with rational $b_1,\ldots, b_n$. Then we would be done as $b_i+b_j = b_k$ then implies $a_i + a_j = a_k$.