Research article

A note on maps preserving products of matrices

  • Received: 20 February 2024 Revised: 23 April 2024 Accepted: 26 April 2024 Published: 16 May 2024
  • MSC : 16R60, 15A04, 16W10

  • Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D) be the matrix ring over D, where n>1. Let m,k be fixed invertible elements in R. The main purpose of the paper is to give a description of a bijective additive map f: RR, satisfying the identity f(x)f(y)=m for every x,yR with xy=k, which gives a correct version of a result due to Catalano et al. in 2019.

    Citation: Lan Lu, Yu Wang. A note on maps preserving products of matrices[J]. AIMS Mathematics, 2024, 9(7): 17039-17062. doi: 10.3934/math.2024827

    Related Papers:

    [1] Huaqing Gong, Shilin Yang . The representation ring of a non-pointed bialgebra. AIMS Mathematics, 2025, 10(3): 5110-5123. doi: 10.3934/math.2025234
    [2] Wasim Ahmed, Amal S. Alali, Muzibur Rahman Mozumder . Characterization of $ (\alpha, \beta) $ Jordan bi-derivations in prime rings. AIMS Mathematics, 2024, 9(6): 14549-14557. doi: 10.3934/math.2024707
    [3] Mohd Arif Raza, Huda Eid Almehmadi . Lie (Jordan) $ \sigma- $centralizer at the zero products on generalized matrix algebra. AIMS Mathematics, 2024, 9(10): 26631-26648. doi: 10.3934/math.20241295
    [4] Yousef Alkhamees, Badr Alhajouj . Structure of a chain ring as a ring of matrices over a Galois ring. AIMS Mathematics, 2022, 7(9): 15824-15833. doi: 10.3934/math.2022866
    [5] Muhammad Jawad, Niat Nigar, Sarka Hoskova-Mayerova, Bijan Davvaz, Muhammad Haris Mateen . Fundamental theorems of group isomorphism under the framework of complex intuitionistic fuzzy set. AIMS Mathematics, 2025, 10(1): 1900-1920. doi: 10.3934/math.2025088
    [6] Mohd Arif Raza, Abdul Nadim Khan, Husain Alhazmi . A characterization of $ b- $generalized derivations on prime rings with involution. AIMS Mathematics, 2022, 7(2): 2413-2426. doi: 10.3934/math.2022136
    [7] Xinfeng Liang, Lingling Zhao . Bi-Lie n-derivations on triangular rings. AIMS Mathematics, 2023, 8(7): 15411-15426. doi: 10.3934/math.2023787
    [8] Jeong Min Kang, Sang-Eon Han, Sik Lee . Digital products with $ PN_k $-adjacencies and the almost fixed point property in $ DTC_k^\blacktriangle $. AIMS Mathematics, 2021, 6(10): 11550-11567. doi: 10.3934/math.2021670
    [9] Yousef Alkhamees, Sami Alabiad . Classification of chain rings. AIMS Mathematics, 2022, 7(4): 5106-5116. doi: 10.3934/math.2022284
    [10] Gurninder S. Sandhu, Deepak Kumar . Correction: A note on derivations and Jordan ideals in prime rings. AIMS Mathematics, 2019, 4(3): 684-685. doi: 10.3934/math.2019.3.684
  • Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D) be the matrix ring over D, where n>1. Let m,k be fixed invertible elements in R. The main purpose of the paper is to give a description of a bijective additive map f: RR, satisfying the identity f(x)f(y)=m for every x,yR with xy=k, which gives a correct version of a result due to Catalano et al. in 2019.



    Let R be an associative ring. Throughout the paper we will denote by R×, the set of all invertible elements of R. For x,yR, we set

    xy=xy+yx.

    A map f: RR is said to be additive if

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

    for all x,yR.

    In 1999, Essannouni and Kaidi [1] obtained the following result, which generalized a well-known result due to Hua [2].

    Theorem 1.1. [1,Theorem A] Let D be a division ring with DF2, the field of two elements. Let R=Mn(D) be the ring of n×n matrices with n2. Let f: RR be a bijective additive map satisfying the identity

    f(x1)=f(x)1

    for every xR×. Then, f is either an automorphism or an antiautomorphism.

    In 2005, Chebotar et al. [3] proved that a bijective additive map f on a division ring D that satisfies

    f(x1)f(x)=f(y1)f(y)

    for all x,yD× must have the form

    f(x)=f(1)φ(x),

    where φ is an automorphism or antiautomorphism, and f(1) is a central element of D. In 2006, Lin and Wong [4] generalized this result to matrix rings.

    In 2018, Catalano [5] initiated the study of maps preserving products of division rings. More precisely, she proved the following result.

    Theorem 1.2. [5,Theorem 5] Let D be a division ring with characteristic different from 2. Let Z be the center of R. With m,kD×, let f: DD be a bijective additive map satisfying the identity

    f(x)f(y)=m

    for every x,yD× such that xy=k. Then,

    f(x)=f(1)φ(x)

    for all xD, where φ: DD is either an automorphism or an antiautomorphism. Moreover, we have the following:

    (1) If φ is an automorphism, then f(1)Z.

    (2) If φ is an antiautomorphism, then f(1)=f(k)1m and f(k)Z.

    In 2019, Catalano et al. [6] initiated the study of maps preserving products of matrices. More precisely, they proved the following result.

    Theorem 1.3. [6,Theorem 1] Let D be a division ring with characteristic different from 2. Let R=Mn(D) be the ring of n×n matrices with n2, and let Z be the center of R. With m,kR×, let f: RR be a bijective additive map satisfying the identity

    f(x)f(y)=m

    for every x,yR× such that xy=k. Then,

    f(x)=f(1)φ(x)

    for all xR, where φ: RR is either an automorphism or an antiautomorphism. Moreover, we have the following:

    (1) If φ is an automorphism, then f(1)Z.

    (2) If φ is an antiautomorphism, then f(1)=f(k)1m and f(k)Z.

    The study of maps preserving products of matrices is an active topic. For recent results on maps preserving products of matrices, we refer the reader to [7,8,9,10,11].

    We point out that the proof of Theorem 1.3 is wrong. Indeed, they used the following identity due to Hua:

    aaba=(a1+(b1a)1)1, (1.1)

    where a,b,b1aR×. By taking a=1 and b=xR in (1.1), they obtained that

    φ(x1)=φ(x)1

    for all xR×, where

    f=f(1)φ.

    By using Theorem 1.1 they got that φ is an automorphism or an antiautomorphism. However, the condition of x11R× (equivalently, 1xR×) should be added in the use of (1.1). Thus, they cannot obtain that

    φ(x1)=φ(x)1

    for all xR×, where f=f(1)φ. In fact, they can obtain that

    φ(x1)=φ(x)1

    for all xR× with 1xR×, which cannot use Theorem 1.1 to get that φ is an automorphism or an antiautomorphism.

    In the present paper we shall give the following result:

    Theorem 1.4. Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D) be the ring of n×n matrices with n2, and let Z be the center of R. With m,kR×, let f,g: RR be bijective additive maps satisfying the identity

    f(x)g(y)=m

    for every x,yR× such that xy=k. Then,

    f(x)=f(1)φ(x)andg(x)=φ(xk1)g(k)

    for all xR, where φ: RR is either an automorphism or an antiautomorphism. Moreover, we have the following:

    (1) If φ is an automorphism, then g(x)=φ(x)g(1) for all xR.

    (2) If φ is an antiautomorphism, then g(x)=f(k)1f(x)g(k) for all xR.

    As a consequence of Theorem 1.4 we shall give the following result, which gives a correct version of Theorem 1.3.

    Theorem 1.5. Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D) be the ring of n×n matrices with n2, and let Z be the center of R. With m,kR×, let f: RR be a bijective additive map satisfying the identity

    f(x)f(y)=m

    for every x,yR× such that xy=k. Then,

    f(x)=f(1)φ(x)

    for all xR, where φ: RR is either an automorphism or an antiautomorphism. Moreover, we have the following:

    (1) If φ is an automorphism, then f(1)Z.

    (2) If φ is an antiautomorphism, then f(1)=f(k)1m and f(k)Z.

    We organize the paper as follows: In Section 2 we shall give the proof of Theorem 1.4. In Section 3 we shall give the proof of Theorem 1.5.

    We remark that the method in the proof of Theorem 3 is different from that in the proof of Theorem 2. We believe that the method will play a certain role in the study of maps preserving products of matrices.

    Throughout this section, let D be a division ring and let R=Mn(D) with n>1. By Z we denote the center of D. We identify Z with the center of R canonically. For AR, we denote by |A| the determinant of A.

    We begin with the following technical result, which will be used in the proof of our main result.

    Lemma 2.1. Let D be a division ring with char(D)2,3. Let R=Mn(D) with n>1. For any α,βD and 1i,j,k,ln, we set

    T=αeij+βekl.

    We claim that either there exists γ{1,2,3} such that

    γ+T,γ+T+1R×

    or there exist γ1,γ2R× such that

    γi+1,γi+T,γi+T+1,γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×

    for all i=1,2.

    Proof. We prove the result by way of the following several cases:

    Case 1. Suppose that i=j=k=l. We set

    γ={3,if α+β=1,2;1,otherwise.

    It is clear that γ+T,γ+1+TR×.

    Case 2. Suppose that i=j, k=l, and ik. We set

    γ={3,if α,β=1,2;1,otherwise.

    It is clear that γ+T,γ+1+TR×.

    Case 3. Suppose that i=j and kl. We set

    γ={3,if α=1,2;1,otherwise.

    It is clear that γ+T,γ+1+TR×.

    Case 4. Suppose that ij and k=l. We set

    γ={3,if β=1,2;1,otherwise.

    It is clear that γ+T,γ+1+TR×.

    Case 5. Suppose that ij, kl, and (i,j)(l,k). It is easy to check that

    |γ+T|=γn

    for all γD. We set γ=1. It is clear that

    γ+T,γ+T+1R×.

    Case 6. Suppose that ij, kl, and (i,j)=(l,k). We may assume that i<j. The case of i>j can be discussed analogously. It is easy to check that

    |ns=1aieii+T|=a1ana1ai1αai+1aj1βaj+1an

    for all aiD, i=1,,n. Suppose first that αβ1,4. We set γ=1. It follows that

    γ+T=1+αeij+βeji;γ+T+1=2+αeij+βeji.

    This implies that

    |γ+T|=1αβ0

    and

    |γ+T+1|=2n2n2αβ=2n2(4αβ)0.

    This implies that

    γ+T,γ+T+1R×.

    Suppose next that αβ=1 or 4. We first discuss the case of αβ=1. We set γ=2. It follows that

    γ+T=2+αeij+βeji;γ+T+1=3+αeij+βeji.

    This implies that

    |γ+T|=2n2n2αβ=2n2×30

    and

    |γ+T+1|=3n3n2αβ=3n2×230.

    We get that

    γ+T,γ+T+1R×.

    We now assume that αβ=4. We set

    γ1=1snsjess+2ejj;γ2=1snsj3ess+ejj.

    It is clear that γ1,γ2R×. Note that

    γ1+1=1snsj2ess+3ejj;γ2+1=1snsj4ess+2ejj.

    It is clear that

    γ1+1,γ2+1R×.

    Note that

    γ1γ2=1snsj(2)ess+ejj;γ1γ2+1=1snsj(1)ess+2ejj.

    It is clear that

    γ1γ2,γ1γ2+1R×.

    Note that

    γ1+T=1snsjess+2ejj+αeij+βeji;γ1+T+1=1snsj2ess+3ejj+αeij+βeji;γ2+T=1snsj3ess+ejj+αeij+βeji;γ2+T+1=1snsj4ess+2ejj+αeij+βeji;γ1γ2+T=1snsj(2)ess+ejj+αeij+βeji;γ1γ2+T+1=1snsj(1)ess+2ejj+αeij+βeji.

    It implies that

    |γ1+T|=2αβ=20;|γ1+T+1|=2n1×32n2αβ=2n10;|γ2+T|=3n13n2αβ=3n20;|γ2+T+1|=4n1×24n2αβ=4n10;|γ1γ2+T|=(2)n1(2)n2αβ=(2)n2×(6)0;|γ1γ2+T+1|=(1)n1×2(1)n2αβ=(1)n2×(6)0.

    This implies that

    γi+T,γi+T+1,γ1γ2+T,γ1γ2+T+1R×

    for i=1,2. The proof of the result is complete.

    The following technical result will be used in the proof of our main result.

    Lemma 2.2. Let D be a division ring, which is not a field. Suppose that char(D)2. Let R=Mn(D) with n>1. For any α,βD and 1i,j,k,ln, we set T=αeij+βekl. We claim that either there exists γ{1,2,3} such that

    γ+T,γ+T+1R×

    or there exist γ1,γ2R× such that

    γi+1,γi+T,γi+T+1,γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×

    for i=1,2.

    Proof. In view of Lemma 2.1, we may assume that char(D)=3. It is clear that D is a central division algebra over Z. It is well known that the dimension of a finite dimensional central division algebra is a perfect square (see [12,Corollary 1.37]). This implies that dimZ(D)4. We now prove the result by way of the following two cases:

    Case 1. Suppose first that α,β,1 are linearly independent over Z. We get that there exists γD such that γ,α,β,1 are linearly independent over Z. We now discuss the following six subcases:

    Subcase 1.1. Suppose that i=j=k=l. We set

    γ1=γandγ2=γα.

    It is clear that

    γi,γi+1,γi+(α+β),γi+(α+β)+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=α.

    It is clear that

    γ1γ2,γ1γ2+1,γ1γ2+(α+β),γ1γ2+(α+β)+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 1.2. Suppose that i=j, k=l, and ik. We set

    γ1=γandγ2=γ1αβ.

    It is clear that

    γi,γi+1,γi+α,γi+α+1,γi+β,γi+β+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=α+β.

    It is clear that

    γ1γ2,γ1γ2+1,γ1γ2+α,γ1γ2+α+1,γ1γ2+β,γ1γ2+β+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 1.3. Suppose that i=j and kl. We set

    γ1=γandγ2=γ1β.

    It is clear that

    γi,γi+1,γi+α,γi+α+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=β.

    It is clear that

    γ1γ2,γ1γ2+1,γ1γ2+α,γ1γ2+α+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 1.4. Suppose that ij and k=l. We set

    γ1=γandγ2=γα.

    It is clear that

    γi,γi+1,γi+β,γi+β+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that γ1γ2=α. It is clear that

    γ1γ2,γ1γ2+1,γ1γ2+β,γ1γ2+β+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 1.5. Suppose that ij, kl, and (i,j)(l,k). It is easy to check that

    |ns=1aieii+T|=a1an

    for all aiD, i=1,,n. We set

    γ1=γandγ2=γα.

    This implies that

    |γi|=γni0;|γi+1|=(γi+1)n0;|γi+T|=γni0;|γi+T+1|=(γi+1)n0;|γ1γ2|=αn0;|γ1γ2+1|=(α+1)n0;|γ1γ2+T|=αn0;|γ1γ2+T+1|=(α+1)n0

    for i=1,2. It follows that

    γi,γi+1,γi+T,γi+T+1,γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×

    for i=1,2, as desired.

    Subcase 1.6. Suppose that ij, kl, and (i,j)=(l,k). We may assume that i<j. The case of i>j can be discussed analogously. It is easy to check that

    |ns=1aieii+T|=a1ana1ai1αai+1aj1βaj+1an

    for all aiD, i=1,,n. We set

    γ1=1snsj(γ+α)ess+(γ+β+2)ejj+2αeij;γ2=γ+2αeij.

    It is clear that

    |γ1|=(γ+α)j1(γ+β+2)(γ+α)nj0;|γ1+1|=(γ+α+1)j1(γ+β)(γ+α+1)nj0;|γ2|=γn0;|γ2+1|=(γ+1)n0.

    This implies that

    γ1,γ1+1,γ2,γ2+1R×.

    Since char(D)=3 we get that

    γ1+T=1snsj(γ+α)ess+(γ+β+2)ejj+βeji;γ1+T+1=1snsj(γ+α+1)ess+(γ+β)ejj+βeji;γ2+T=γ+βeji;γ2+T+1=γ+1+βeji.

    It is easy to check that

    |γ1+T|=(γ+α)j1(γ+β+2)(γ+α)nj0;|γ1+T+1|=(γ+α+1)j1(γ+β)(γ+α+1)nj0;|γ2+T|=γn0;|γ2+T+1|=(γ+1)n0.

    This implies that

    γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=1snsjαess+(β+2)ejj;γ1γ2+1=1snsj(α+1)ess+βejj.

    We get that

    |γ1γ2|=αj1(β+2)αnj0;|γ1γ2+1|=(α+1)j1β(α+1)nj0.

    This implies that

    γ1+γ2,γ1+γ2+1R×.

    Note that

    γ1γ2+T=1snsjαess+(β+2)ejj+αeij+βeji;γ1γ2+T+1=1snsj(α+1)ess+βejj+αeij+βeji.

    We get that

    |γ1γ2+T|=αj1(β+2)αnjαj1βαnj=2αn10

    and

    |γ1γ2+T+1|=(α+1)j1β(α+1)nj(α+1)i1α(α+1)ji1β(α+1)nj=(α+1)j1β(α+1)nj(α+1)j2αβ(α+1)nj=(α+1)j2(α+1α)β(α+1)nj=(α+1)j2β(α+1)nj0.

    This implies that

    γ1+γ2+T,γ1+γ2+T+1R×,

    as desired.

    Case 2. Suppose next that α,β,1 are linearly dependent over Z. Note that dimZD4. We get that there exists γ1D such that γ1L(1,α,β), where L(1,α,β) is a subspace of D generalized by 1,α,β. It is clear that

    dimZ(L(1,α,β,γ1))3,

    where L(1,α,β,γ1) is a subspace of D generalized by 1,α,β,γ1. We get that there exists γ2D such that γ2L(1,α,β,γ1). We now discuss the following six subcases.

    Subcase 2.1. Suppose that i=j=k=l. We set γ1=γ1 and γ2=γ2. It is clear that

    γi,γi+1,γi+(α+β),γi+(α+β)+1D×

    for i=1,2. This implies that

    γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2,γ1γ2+1,γ1γ2+(α+β),γ1γ2+(α+β)+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 2.2. Suppose that i=j, k=l, and ik. We set γ1=γ1 and γ2=γ2. It is clear that

    γi,γi+1,γi+α,γi+α+1,γi+β,γi+β+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2,γ1γ2+1,γ1γ2+α,γ1γ2+α+1,γ1γ2+β,γ1γ2+β+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 2.3. Suppose that i=j and kl. We set γ1=γ1 and γ2=γ2. It is clear that

    γi,γi+1,γi+α,γi+α+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2,γ1γ2+1,γ1γ2+α,γ1γ2+α+1D×.

    This implies that

    γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 2.4. Suppose that ij and k=l. We set γ1=γ1 and γ2=γ2. It is clear that

    γi,γi+1,γi+β,γi+β+1D×

    for i=1,2. This implies that

    γi,γi+1,γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2,γ1γ2+1,γ1γ2+β,γ1γ2+β+1D×.

    This implies that

    γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×,

    as desired.

    Subcase 2.5. Suppose that ij, kl and (i,j)(l,k). We set γ1=γ1 and γ2=γ2. It is easy to check that

    |ns=1aieii+T|=a1an

    for all aiD, i=1,,n. It is clear that

    γi,γi+1,γ1γ2,γ1γ2+1D×

    for i=1,2. We get that

    γi,γi+1,γ1γ2,γ1γ2+1D×

    for i=1,2. Note that

    |γi+T|=γni0;|γi+T+1|=(γi+1)n0;|γ1γ2+T|=(γ1γ2)n0;|γ1γ2+T+1|=(γ1γ2+1)n0

    for i=1,2. It follows that

    γi+T,γi+T+1,γ1γ2+T,γ1γ2+T+1R×

    for i=1,2, as desired.

    Subcase 2.6. Suppose that ij, kl, and (i,j)=(l,k). We may assume that i<j. The case of i>j can be discussed analogously. It is easy to check that

    |ns=1aieii+T|=a1ana1ai1αai+1aj1βaj+1an

    for all aiD, i=1,,n. Suppose first that αβZ. We set

    γ1=1snsj(γ1+1)ess+γ1ejj+2αeij;γ2=1snsjγ1ess+γ2ejj+2αeij.

    It is clear that

    |γ1|=(γ1+1)j1γ1(γ1+1)nj0;|γ1+1|=(γ1+2)j1(γ1+1)(γ1+2)nj0;|γ2|=(γ1)j1γ2(γ1)nj0;|γ2+1|=(γ1+1)j1(γ2+1)(γ1+1)nj0.

    This implies that

    γ1,γ1+1,γ2,γ2+1R×.

    Since char(D)=3 we get that

    γ1+T=1snsj(γ1+1)ess+γ1ejj+βeji;γ1+T+1=1snsj(γ1+2)ess+(γ1+1)ejj+βeji;γ2+T=1snsjγ1ess+γ2ejj+βeij;γ2+T+1=1snsj(γ1+1)ess+(γ2+1)ejj+βeij.

    It is easy to check that

    |γ1+T|=(γ1+1)j1γ1(γ1+1)nj0;|γ1+T+1|=(γ1+2)j1(γ1+1)(γ1+2)nj0;|γ2+T|=(γ1)j1γ2(γ1)nj0;|γ2+T+1|=(γ1+1)j1(γ2+1)(γ1+1)nj0.

    This implies that

    γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=1snsjess+(γ1γ2)ejj;γ1γ2+1=1snsj2ess+(γ1γ2+1)ejj.

    We get that

    |γ1γ2|=γ1γ20;|γ1γ2+1|=2n1(γ1γ2+1)0.

    This implies that

    γ1γ2,γ1γ2+1R×.

    Note that

    γ1γ2+T=1snsjess+(γ1γ2)ejj+αeij+βeji;γ1γ2+T+1=1snsj2ess+(γ1γ2+1)ejj+αeij+βeji.

    Since αβZ, we get that

    |γ1γ2+T|=γ1γ2αβ0

    and

    |γ1γ2+T+1|=2n1(γ1γ2+1)2n2αβ=2n2(2γ12γ2+2αβ)0.

    This implies that

    γ1+γ2+T,γ1+γ2+T+1R×,

    as desired.

    Suppose next that αβZ. We set

    γ1=1snsj(γ1+1)ess+αβejj+2αeij;γ2=1snsjγ1ess+ejj+2αeij.

    It is clear that

    |γ1|=(γ1+1)j1αβ(γ1+1)nj0;|γ1+1|=(γ1+2)j1(αβ+1)(γ1+2)nj0;|γ2|=(γ1)n10;|γ2+1|=2(γ1+1)n10.

    This implies that

    γ1,γ1+1,γ2,γ2+1R×.

    Since char(D)=3 we get that

    γ1+T=1snsj(γ1+1)ess+αβejj+βeji;γ1+T+1=1snsj(γ1+2)ess+(αβ+1)ejj+βeji;γ2+T=1snsjγ1ess+ejj+βeij;γ2+T+1=1snsj(γ1+1)ess+2ejj+βeij.

    It is easy to check that

    |γ1+T|=(γ1+1)j1αβ(γ1+1)nj0;|γ1+T+1|=(γ1+2)j1(αβ+1)(γ1+2)nj0;|γ2+T|=(γ1)n10;|γ2+T+1|=2(γ1+1)n10.

    This implies that

    γi+T,γi+T+1R×

    for i=1,2. Note that

    γ1γ2=1snsjess+(αβ1)ejj;γ1γ2+1=1snsj2ess+αβejj.

    Since αβZ we get that

    |γ1γ2|=αβ10;|γ1γ2+1|=2n1αβ0.

    This implies that

    γ1γ2,γ1γ2+1R×.

    Note that

    γ1γ2+T=1snsjess+(αβ1)ejj+αeij+βeji;γ1γ2+T+1=1snsj2ess+αβejj+αeij+βeji.

    Since αβZ, we get that

    |γ1γ2+T|=αβ1αβ=10

    and

    |γ1γ2+T+1|=2n1αβ2n2αβ=2n2αβ0.

    This implies that

    γ1γ2+T,γ1γ2+T+1R×,

    as desired. The proof of the result is complete.

    The following result will be used in the proof of our main result, which is of some independent interests.

    Proposition 3.1. Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D), where n>1. Let φ: RR be a bijective additive map such that φ(1)=1 and

    φ(x2)=φ(x)2

    for all xR× with x+1R×. Then, φ is either an automorphism or an antiautomorphism.

    Proof. We first claim that φ is a Jordan automorphism by way of the following three steps:

    Step 1. We claim that

    φ((αeij+βekl)2)=φ(αeij+βekl)2 (3.1)

    for all 1i,j,k,ln and α,βD. In particular, we have

    φ((αeij)2)=φ(αeij)2 (3.2)

    for all 1i,jn and αD. We set

    T=αeij+βekl.

    In view of both Lemmas 2.1 and 2.2 we note that either there exists γ{1,2,3} such that

    γ+T,γ+T+1R×

    or there exist γ1,γ2R× such that

    γi+1,γi+T,γi+T+1,γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×

    for all i=1,2. Suppose first that there exists γ{1,2,3} such that

    γ+T,γ+T+1R×.

    By our hypothesis we have

    φ((γ+T)2)=φ(γ+T)2.

    Note that

    φ(γ)=γandφ(γT)=γφ(T).

    Expanding the last relation we get

    γ2+2γφ(T)+φ(T2)=γ2+2γφ(T)+φ(T)2,

    which implies that φ(T2)=φ(T)2, as desired.

    Suppose next that there exist γ1,γ2R× such that

    γi+1,γi+T,γi+T+1,γ1γ2,γ1γ2+1,γ1γ2+T,γ1γ2+T+1R×

    for all i=1,2. By our hypothesis we have that

    φ(γ21)=φ(γ1)2; (3.3)
    φ((γ1+T)2)=φ(γ1+T)2. (3.4)

    Expanding (3.4) we get

    φ(γ21)+φ(γ1T)+φ(T2)=φ(γ1)2+φ(γ1)φ(T)+φ(T)2. (3.5)

    Using (3.3) we get from (3.5) that

    φ(γ1T)+φ(T2)=φ(γ1)φ(T)+φ(T)2. (3.6)

    By our hypothesis we have that

    φ(γ22)=φ(γ2)2; (3.7)
    φ((γ2+T)2)=φ(γ2+T)2. (3.8)

    Expanding (3.8) we get

    φ(γ22)+φ(γ2T)+φ(T2)=φ(γ2)2+φ(γ2)φ(T)+φ(T)2. (3.9)

    Using (3.7) we get from (3.9) that

    φ(γ2T)+φ(T2)=φ(γ2)φ(T)+φ(T)2. (3.10)

    By our hypothesis we have that

    φ((γ1γ2)2)=φ((γ1γ2)2; (3.11)
    φ(((γ1γ2+T)2)=φ(γ1γ2+T)2. (3.12)

    Expanding (3.12) we get

    φ((γ1γ2)2)+φ((γ1γ2)T)+φ(T2)=φ(γ1γ2)2+φ(γ1γ2)φ(T)+φ(T)2. (3.13)

    Using (3.11) we get from (3.13) that

    φ((γ1γ2)T)+φ(T2)=φ(γ1γ2)φ(T)+φ(T)2. (3.14)

    Subtracting (3.6) from (3.10) we get

    φ((γ1γ2)T)=φ(γ1γ2)φ(T). (3.15)

    It follows from both (3.14) and (3.15) that

    φ(T2)=φ(T)2,

    as desired.

    Step 2. We claim that

    φ(αeijβekl)=φ(αeij)φ(βeij) (3.16)

    for all α,βD and 1i,j,k,ln.

    On one hand, we get from (3.2) that

    φ((αeij+βekl)2)=φ((αeij)2+αeijβekl+(βekl)2)=φ((αeij)2)+φ(αeijβekl)+φ((βekl)2)=φ(αeij)2+φ(αeijβekl)+φ(βekl)2. (3.17)

    On the other hand, we get from (3.1) that

    φ((αeij+βekl)2)=φ(αeij+βekl)2=(φ(αeij)+φ(βekl))2=φ(αeij)2+φ(αeij)φ(βekl)+φ(βekl)2. (3.18)

    Combining (3.17) with (3.18) we get

    φ(αeijβekl)=φ(αeij)φ(βeij)

    for all α,βD and 1i,j,k,ln, as desired.

    Step 3. We claim that φ(x2)=φ(x)2 for all xR.

    For any

    x=1i,jnαijeijR,

    we get from both (3.2) and (3.16) that

    φ(x2)=φ((1i,jnαijeij)2)=φ(1i,jn(αijeij)2+1i,j,k,ln(i,j)<(k,l)αijeijαklekl)=1i,jnφ((αijeij)2)+1i,j,k,ln(i,j)<(k,l)φ(αijeijαklekl)=1i,jnφ(αijeij)2+1i,j,k,ln(i,j)<(k,l)φ(αijeij)φ(αklekl)=(1i,jnφ(αijeij))2=φ(1i,jnαijeij)2=φ(x)2.

    In view of Step 3, we get that φ is a Jordan automorphism. Since char(D)2, we get from [13,Theorem 1] that φ is an automorphism or antiautomorphism. This proves the result.

    The following simple result will be used in the proof of our main result:

    Lemma 3.1. Let D be a division ring such that either char(D)2,3 or D is not a field and char(D)2. Let R=Mn(D), where n>1. Let f: RR be an additive map such that f(x)=0 for all xR× with x+1R×. Then f=0.

    Proof. For any αD and 1i,jn, In view of both Lemmas 2.1 and 2.2 we get that there exists γR× such that

    γ+1R×;γ+αeijR×;γ+αeij+1R×.

    By our hypothesis we have

    f(γ)=0andf(γ+αeij)=0.

    Since f is additive, we get that f(αeij)=0. For any

    x=1i,jnαijeijR,

    we get that f(x)=0, as desired.

    We are in a position to give the proof of our main result.

    Proof of Theorem 1.4. For xR× with x+1R×, we note that

    (x1(x+1)1)1=x(x+1).

    We set

    y=x(x+1).

    Since

    y(y1k)=k,

    we have that

    f(y)g(y1k)=m.

    It follows that

    m=f(y)g(y1k)=f(x(x+1))g((x1(x+1)1)k)=(f(x2)+f(x))(g(x1k)g((x+1)1k))=f(x2)g(x1k)f(x2)g((x+1)1k)+f(x)g(x1k)f(x)g((x+1)1k). (3.19)

    Note that

    f(x)g(x1k)=m.

    It follows from (3.19) that

    0=f(x2)g(x1k)f(x2)g((x+1)1k)f(x)g((x+1)1k). (3.20)

    For any zR×, we note that z(z1k)=k. This implies that

    f(z)g(z1k)=m

    and so

    g(z1k)=f(z)1m.

    We get from (3.20) that

    0=f(x2)f(x)1mf(x2)f(x+1)1mf(x)f(x+1)1m. (3.21)

    Multiplying (3.21) by m1f(x+1) on the right hand side, we get

    0=f(x2)f(x)1f(x+1)f(x2)f(x)=f(x2)f(x)1f(x)+f(x2)f(x)1f(1)f(x2)f(x)=f(x2)+f(x2)f(x)1f(1)f(x2)f(x)=f(x2)f(x)1f(1)f(x),

    which implies that

    f(x2)=f(x)f(1)1f(x) (3.22)

    for all xR× with x+1R×. It follows from (3.22) that

    f(1)1f(x2)=f(1)1f(x)f(1)1f(x) (3.23)

    for all xR× with x+1R×. We define

    φ(x)=f(1)1f(x)

    for all xR. Then,

    f(x)=f(1)φ(x)

    for all xR. It is clear that φ(1)=1. The additivity of f immediately yields the additivity of φ. It follows from (3.23) that

    φ(x2)=φ(x)2

    for all xR× with x+1R×. In view of Proposition 3.1, we can conclude that φ is an automorphism or antiautomorphism.

    For any xR×, since

    (kx1)x=k

    we get that

    f(kx1)g(x)=m.

    This implies that

    g(x)=f(kx1)1m=(f(1)φ(kx1))1m=φ(kx1)1f(1)1f(1)g(k)=φ(kx1)1g(k)=φ(xk1)g(k)

    for all xR×. In view of Lemma 3.1, we get that

    g(x)=φ(xk1)g(k) (3.24)

    for all xR. Suppose first that φ is an automorphism. We get from (3.24) that

    g(x)=φ(xk1)g(k)=φ(x)φ(k1)g(k)=φ(x)φ(k)1g(k)=φ(x)(f(1)1f(k))1g(k)=φ(x)f(k)1f(1)g(k)=φ(x)f(k)1m=φ(x)f(k)1f(k)g(1)=φ(x)g(1)

    for all xR. In particular, if f=g, we have that

    f(1)φ(x)=φ(x)f(1)

    for all xR. This implies that f(1)Z. Suppose next that φ is an antiautomorphism. We get from (3.24) that

    g(x)=φ(xk1)g(k)=φ(k1)φ(x)g(k)=φ(k)1φ(x)g(k)=(f(1)1f(k))1f(1)1f(x)g(k)=f(k)1f(x)g(k)

    for all xR. In particular, if f=g, we get that

    f(x)=f(k)1f(x)f(k)

    for all xR. This implies that

    f(k)f(x)=f(x)f(k)

    for all xR. Since f is a bijective map we obtain that f(k)Z. Note that f(k)f(1)=m, and so f(1)=f(k)1m. The proof of the result is complete.

    As a consequence of Theorem 1.4 we give the proof of Theorem 1.5 as follows:

    Proof of Theorem 1.5. In view of Theorem 1.4, we have that

    f(x)=f(1)φ(x)

    for all xR, where φ: RR is either an automorphism or an antiautomorphism. Moreover, we have the following:

    (1) If φ is an automorphism, then f(x)=φ(x)f(1) for all xR.

    (2) If φ is an antiautomorphism, then f(x)=f(k)1f(x)f(k) for all xR.

    Suppose first that φ is an automorphism. Since

    f(x)=φ(x)f(1)

    for all xR, we get that

    f(1)φ(x)=f(x)=φ(x)f(1)

    for all xR. Since φ is an automorphism, we get that f(1)Z, as desired.

    Suppose next that φ is an antiautomorphism. Since

    f(x)=f(k)1f(x)f(k)

    for all xR, we get that

    f(k)f(x)=f(x)f(k)

    for all xR. Recall that f is a bijective map. We get from the last relation that f(k)Z. Since k1=k, we have that

    f(k)f(1)=m.

    This implies that

    f(1)=f(k)1m,

    as desired. The proof of the result is complete.

    We give a complete description of maps preserving products of matrices over a division D such that either char(D)2,3 or D is not a field and char(D)2, which gives a correct version of Theorem 1.3. The future study of this field is to give a complete description of maps preserving products of matrices over a division D with char(D)2.

    Lan Lu: writing the draft of the manuscript. Yu Wang: correcting some errors in the proof of some results and writing the final manuscript.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors are thankful to the anonymous referees for their valuable comments and suggestions. The second author is supported by the science and technology research project of education department of Jilin province (Grant No. JJKH20241000KJ) and the "fourteen five" scientific planning project of Jilin province education society (Grant No. G215000).

    The authors declare no conflicts of interest.



    [1] H. Essannouni, A. Kaidi, Le thˊeorˊeme Hua pour les algˊebres artiniennes simples, Linear Algebra Appl., 297 (1999), 9–22. https://doi.org/10.1016/S0024-3795(99)00081-6 doi: 10.1016/S0024-3795(99)00081-6
    [2] L. K. Hua, On the automorphisms of sfield, Proc. Nat. Acad. Sci. USA, 35 (1949), 386–389. https://doi.org/10.1073/pnas.35.7.386 doi: 10.1073/pnas.35.7.386
    [3] M. A. Chebotar, W. F. Ke, P. H. Lee, L. S. Shiao, On maps preserving products, Canad. Math. Bull., 48 (2005), 355–369. https://doi.org/10.4153/CMB-2005-033-8 doi: 10.4153/CMB-2005-033-8
    [4] Y. F. Lin, T. L. Wong, A note on 2-local maps, Proc. Edinb. Math. Soc., 49 (2006), 701–708. https://doi.org/10.1017/S0013091504001142 doi: 10.1017/S0013091504001142
    [5] L. Catalano, On maps characterized by action on equal products, J. Algebra, 511 (2018), 148–154. https://doi.org/10.1016/j.jalgebra.2018.06.022 doi: 10.1016/j.jalgebra.2018.06.022
    [6] L. Catalano, S. Hsu, R. Kapalko, On maps preserving products of matrices, Linear Algebra Appl., 563 (2019), 193–206. https://doi.org/10.1016/j.laa.2018.10.029 doi: 10.1016/j.laa.2018.10.029
    [7] L. Catalano, On maps preserving products equal to a rank-one idempotent, Linear Multilinear Algebra, 69 (2019), 673–680. https://doi.org/10.1080/03081087.2019.1614518 doi: 10.1080/03081087.2019.1614518
    [8] L. Catalano, H. Julius, On maps preserving products equal to a diagonalizable, Commun. Algebra, 49 (2021), 4339–4349. https://doi.org/10.1080/00927872.2021.1919133 doi: 10.1080/00927872.2021.1919133
    [9] L. Catalano, T. Merchán, On rational functional identities, Commun. Algebra, 32 (2024), 717–722. https://doi.org/10.1080/00927872.2023.2247488 doi: 10.1080/00927872.2023.2247488
    [10] C. Costara, Linear bijective maps preserving fixed values of products of matrices at fixed vectors, Commun. Algebra, 50 (2022), 920–926. https://doi.org/10.1080/00927872.2021.1976202 doi: 10.1080/00927872.2021.1976202
    [11] H. J. Huang, M. C. Tsai, Maps preserving trace of products of matrices, Linear Multilinear Algebra, 71 (2023), 2963–2985. https://doi.org/10.1080/03081087.2022.2129556 doi: 10.1080/03081087.2022.2129556
    [12] M. Brešar, Introduction to noncommutative algebra, Springer, 2014. https://doi.org/10.1007/978-3-319-08693-4
    [13] M. F. Smiley, Jordan homomorphisms onto prime rings, Trans. Amer. Math. Soc., 84 (1957), 426–429. https://doi.org/10.2307/1992823 doi: 10.2307/1992823
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(887) PDF downloads(54) Cited by(0)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog