Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Theorem 2


Source. Section 5, printed pp. 61--62 (PDF pp. 3--4).

Statement. Use the definition of thin sets from Theorem 1. Let G,HG,H be additive abelian groups, let S⊆GS\subseteq G be thin, and let f:G→Hf:G\to H. If

f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y)

for every x,y∉Sx,y\notin S, then this identity holds for every x,y∈Gx,y\in G.

Proof. The exceptional pairs lie in

(S×G)∪(G×S),(S\times G)\cup(G\times S),

a light set. By Theorem 1, there is a homomorphism h:G→Hh:G\to H such that f=hf=h outside a thin set TT. Put k=f−hk=f-h and U=S∪TU=S\cup T, which is thin.

Fix a∈Ga\in G. Since U∪(a−U)U\cup(a-U) is thin and is therefore not all of GG, choose a1a_1 outside that union and set a2=a−a1a_2=a-a_1. Then a1,a2∉Ua_1,a_2\notin U. The assumed equation applies to (a1,a2)(a_1,a_2), while k(a1)=k(a2)=0k(a_1)=k(a_2)=0. Subtracting the additive identity for hh from the identity for ff gives

k(a)=k(a1)+k(a2)=0.k(a)=k(a_1)+k(a_2)=0.

Thus f=hf=h on all of GG, so ff is a homomorphism. □\square

Proof coverage. This is a complete deduction from Theorem 1. It is conditional on that theorem; the group-level proof chain underlying Theorem 1 remains sketch-only on its result page.

Dependencies. Theorem 1.

Bears on. #1126