• Nie Znaleziono Wyników

On orthogonally additive functions with orthogonally additive second iterate

N/A
N/A
Protected

Academic year: 2021

Share "On orthogonally additive functions with orthogonally additive second iterate"

Copied!
4
0
0

Pełen tekst

(1)

COMMENTATIONES MATHEMATICAE Vol. 53, No. 2 (2013), 301-304

Karol Baron

On orthogonally additive functions with orthogonally additive second iterate

Dedicated to Professor Julian Musielak on his 85th birthday

Abstract. Let E be a real inner product space of dimension at least 2. If f maps Eonto E and both f and f ◦ f are orthogonally additive, then f is additive.

2010 Mathematics Subject Classification: 39B55, 39B12, 46C99.

Key words and phrases: orthogonally additive and additive function, inner product space, iterate.

1. Introduction. Let E be a real inner product space of dimension at least 2. A function f mapping E into an abelian group is called orthogonally additive, if

f (x + y) = f (x) + f (y) for all x, y ∈ E with x ⊥ y.

It is well known, see [5; Corollary 10] and [3; Theorem 1], that every orthogonally additive function f defined on E has the form

(1) f (x) = a(kxk2) + b(x) for x ∈ E, where a and b are additive functions uniquely determined by f.

According to [1; Theorem 1], if f : E → E is orthogonally additive and

(2) f (f (x)) = x for x ∈ E,

then f is additive. In the present paper we replace (2) by the orthogonal additivity of the second iterate f2of f and the condition

(3) f (E) = E.

(2)

302 On orthogonally additive functions with orthogonally additive second iterate

2. Main result. It reads as follows.

Theorem 2.1 Assume f : E → E and f2 are orthogonally additive. If (3) holds, then f is additive.

Proof As mentioned above f has form (1) and

(4) f2(x) = a2(kxk2) + b2(x) for x ∈ E

with additive functions a, a2:R → E and b, b2: E→ E. It follows from (1) that kf(x)k2=ka(kxk2)k2+ 2(a(kxk2)|b(x)) + kb(x)k2 for x ∈ E,

which jointly with (4) and (1) gives a2(kxk2) + b2(x) = a(kf(x)k2) + b(f (x))

= a(ka(kxk2)k2+ 2(a(kxk2)|b(x)) + kb(x)k2) + b(a(kxk2) + b(x)) for x ∈ E. Hence, following an idea from [1], if x ∈ E and r ∈ Q, then

r2a2(kxk2) + rb2(x) = r4a(ka(kxk2)k2) + 2r3a((a(kxk2)|b(x))) + r2a(kb(x)k2) + r2b(a(kxk2)) + rb(b(x)).

Consequently,

(5) a(ka(kxk2)k2) = 0 and a((a(kxk2)|b(x))) = 0 for x ∈ E.

It follows from the second part of (5) that for all x, y ∈ E we have 0 = a((a(kx + yk2)|b(x + y))

= a((a(kxk2)|b(y)) + 2(a((x|y))|b(x + y)) + (a(kyk2)|b(x))), i.e.,

a((a(kxk2)|b(y)) + 2(a((x|y))|b(x))) = −a((a(kyk2)|b(x)) + 2(a((x|y))|b(y))).

As the function of x ∈ E, the left–hand side is even, whereas the right–hand side is odd, and so on each side we have zero for every x, y ∈ E. Hence

a((a(kxk2)|b(y))) = 0 for all orthogonal x, y ∈ E, and, by the standard argument,

(6) a((a(α)|b(y))) = 0 for α ∈ R and y ∈ E.

Moreover, if x, y ∈ E are orthogonal, then making use of the first part of (5) we see that 0 = a(ka(kx + yk2)k2) = a(ka(kxk2+ky|2)k2)

= a(ka(kxk2)k2+ 2(a(kxk2)|a(kyk2)) +ka(kyk2)k2)

= 2a((a(kxk2)|(a(kyk2))).

(3)

K. Baron 303

It shows that

a((a(α)|a(β))) = 0 for α, β ∈ R and this jointly with (1) and (6) gives

a((a(α)|f(x))) = 0 for α ∈ R and x ∈ E.

Hence and from (3) we infer that

(7) a((a(α)|z)) = 0 for α ∈ R and z ∈ E.

Suppose a(α) 6= 0 for some α ∈ R. Then



a(α) a(α) ka(α)k2



= α and by (7) we have

a(α) = a



a(α) a(α) ka(α)k2



= 0.

The contradiction obtained proves that a = 0 and (1) gives f = b. 

3. Remarks.

1. Assume

E = E1+ E2, E1⊥ E2

with non–zero linear subspaces E1, E2 of E. Fix unit vectors e1∈ E1, e2∈ E2and let a : R → E1, b : E→ E2 be additive functions such that (cf. [4; section 5.2])

a(1) = 0, a(R) = LinQ{e1}, b(e1) = 0, b(E)⊂ LinQ{e2}.

Define f : E → E by (1). Clearly f is not additive. To prove that f2 is even additive fix x ∈ E. Then

a(kxk2) = r1e1, b(x) = r2e2

with some r1, r2∈ Q and

kf(x)k2=ka(kxk2)k2+kb(x)k2= r12+ r22, whence

f2(x) = a(kf(x)k2) + b(a(kxk2) + b(x)) = b(r1e1+ r2e2) = b(r2e2) = b(b(x)).

It shows that we cannot remove (3) from Theorem 2.1. As follows from [1;

Remark 2] we also cannot remove the orthogonal additivity of f2from this theorem.

2. Function f considered in Remark 1 is discontinuous. Note however that we may have its second iterate continuous (taking, e.g., b = 0 or b(e2) = 0).

The next remark shows that we may replace (3) by the continuity of f.

3. Assume f : E → E is orthogonally additive and continuous at a point. If f2 is orthogonally additive, then f is linear.

(4)

304 On orthogonally additive functions with orthogonally additive second iterate

Proof Applying [2; Theorem 4.3] and [5; Corollary 11] we infer that f has form (1) with a continuous and linear b : E → E,

a(α) = αe for α ∈ R

and some e ∈ E. Hence and from the first part of (5) we get 0 =ka(kxk2)k2e =kxk4kek2e

for x ∈ E, whence e = 0 and f = b. 

Acknowledgement. The research was supported by the Silesian University Mathematics Department (Iterative Functional Equations and Real Analysis pro- gram).

References

[1] K. Baron, On some orthogonally additive functions on inner product spaces, Ann. Univ. Bu- dapest. Sect. Comput.40 (2013), 123-127.

[2] K. Baron and A. Kucia, On regularity of functions connected with orthogonal additivity, Func.

Approx. Comment. Math.26 (1998), 19-24.

[3] K. Baron and J. Rätz, On orthogonally additive mappings on inner product spaces, Bull.

Polish Acad. Sci. Math.43 (1995), 187-189.

[4] M. Kuczma, An introduction to the theory of functional equations and inequalities. Cauchy’s equation and Jensen’s inequality, second edition (edited by A. Gilányi), Birkhäuser Verlag, Basel, 2009.

[5] J. Rätz, On orthogonally additive mappings, Aequationes Math.28 (1985), 35-49.

Karol Baron

Instytut Matematyki Uniwersytetu Śla¸skiego Bankowa 14, 40–007 Katowice, Poland E-mail: baron@us.edu.pl

(Received: 1.08.2013)

Cytaty

Powiązane dokumenty

If card V ⩽ card E, then the set of all orthogonally additive surjections mapping E into V is dense in the space of all orthogonally additive functions from E into V with the

Brown [5℄ proved that there exist in nitely many arithmeti progressions ofr. four di erent terms, three of whi h are primes and the fourth

We are concerned with conditions on the number of indeterminates n which guarantees that (1) is solvable in any p-adic field, i.e., that there exists a common nontrivial p-adic zero

The author thanks the referee who provided a real simplification of the proof given in the first version of this article, and some nice cosmetical modifications to the original

Since nothing beyond properties of their distribution has been used in the preceding proof about the primes, Theorem 1 holds if the se- quence of primes is replaced by any other

Rickart The notion of strong boundedness for a finitely additive vector­. valued set function was introduced by

1.. for example [5], where a special case of th is theorem is considered). Fu rth e r, whenever we speak on the absolute continuity, or on the weak absolute continuity

Ghosh [4] improved the construction of strong distributive lattices of rings given by Bandelt and Petrich, and characterized the class of all semirings which are subdirect products of