1. Introduction
In the past 20 years, Poisson algebra, which has a wide and profound application, has attracted the interests of many researchers, see [
1,
2,
3,
4,
5,
6] for details.
In [
1,
2,
3], the authors studied DG Poisson algebras, Poisson Hopf algebras, Poisson ore extensions and their universal envelope algebras. Jie Tong and Quanqin Jin studied non-commutative Poisson algebra structures on the Lie algebra 
 and 
 in [
4]. Poisson algebra structures on toroidal Lie algebras, Witt algebra, and Virasoro algebra were studied by researchers in [
5,
6]. In this paper, we studied the structure of Poisson algebras over four-dimensional Lie algebra 
g using the matrix method.
Scholars have obtained many profound results on the automorphism of Lie algebras. In [
7,
8,
9], scholars studied the automorphisms of many kinds of Lie algebras, such as the Bianchi model Lie groups and matrix algebras over communicative rings. Automorphisms of some matrix algebras were discussed by scholars in [
10,
11,
12]. Automorphisms of some triangular matrices over commutative rings were explored by researchers in [
13,
14,
15]. In [
16], Qiu Yu and Dengyin Wang and Shikun Ou studied the automorphism of standard Borel subalgebras of CM type Lie algebras over a co ring. In a word, many scholars have studied the automorphism of Lie algebras [
17,
18,
19,
20,
21]. Determining the automorphism group 
 of a Lie algebra 
g is a basic problem in the study of the structure theory of Lie algebras. The structure problem of Lie algebras also occupies an irreplaceable position in the study of the structure theory of Lie algebras. The author of this paper has also studied the structure and representation of Lie algebras [
22,
23,
24,
25,
26].
The set of all second-order square matrices on the complex field 
 is denoted as 
. The definition of 
 in the four-dimensional Lie algebra satisfies a very special lie operation different from the general one. This operation also satisfies the bilinear, antisymmetric condition and the square bracket product of Jacobi constant equation as follows:
A group of bases of 
 is 
 and satisfies the following formula:
      and
      
For convenience, Lie algebra  is written as Lie algebra g, and represents its square bracket product [A,B] as function .
Let 
R be an elementary divisor ring or a local ring; [
27] determined the automorphisms of the general Lie operation
      
      linear Lie algebra 
 and the general linear Lie algebra 
. However, in this paper, we discussed the automorphisms of the Lie operation of 
 as:
  2. Main Results
After calculation, it can be verified that  is a one-dimensional ideal generated by . So, g is a four-dimensional solvable Lie algebra. The center  of g is a two-dimensional subspace generated by . In order to save space, it is no longer verified.
Theorem 1. g is not a nilpotent Lie algebra.
 Proof.  According to the operation law between the basis vectors of 
g, the following formula can be obtained.
        
 Thus, g is not a nilpotent Lie algebra.    □
Poisson algebra is defined below.
Definition 1. Define the Poisson algebra  on the base field , which is a vector space g on , and has bilinear product ∗ and Lie algebra structure , and the following Leibniz rule holds: For any  in g, ∗ does not necessarily satisfy the associative law and commutative law.
 Since ∗ is a bilinear binary operation,
      
Thus, ∗ induces a left multiply linear transformation 
. Since 
 can be linearly represented by base 
. We only need to calculate the matrices of the linear transformation
      
      under the basis of
      
When studying the Poisson algebra structure of Lie algebra 
g, we marke 
 as 
, 
 as 
, 
 as 
, and 
 as 
. Note that we only simplify the sign in this way when we study the Poisson algebra structure of the Lie algebra 
g. When we study the automorphism of the Lie algebra 
g, we still use the original sign, because
      
      thus,
      
Theorem 2.  is a Poisson algebra on , then:  Proof.  Since the Leibniz law is established, there are
        
Since ∗ and 
 are bilinear operations. If 
 can only select 
, so that there are (
1) cases of 
, one by one can be verified. When
        
        the following equation can be obtained from (
1):
        
        left side of (2a)
        
        right side of (2a)
        
        thus
        
Because
        
        left side of (2b)
        
        right side of (2b)
        
        thus
        
Because
        
        left side of (2c) = right side of (2c), so Equation (2c) holds.
Because
        
        left side of (2d)
        
        right side of (2d)
        
        thus,
        
Because
        
        left side of (2e)
        
        right side of (2e)
        
        thus,
        
Because
        
        left side of (2f)
        
        right side of (2f)
        
        thus,
        
Because
        
        left side of (2g) = right side of (2g) so Equation (2g) holds.
Because
        
        and it can be known from (2e):
        
        left side of (2h)
        
        right side of (2h)
        
So the equation holds.
By analogy from the remaining 56 cases:
        
Since ∗ is a bilinear binary operation,
        
Thus, ∗ induces a right multiply linear transformation 
. Since any 
x in 
g can be linearly represented by base 
, we only need to calculate the matrices of linear transformation
        
        under base
        
 □
 Since it is similar to Theorem 2, in order to save space, it will not be described again.
In addition, if any  in g, ∗ satisfies the associative law or the commutative law, there will be more strict requirements for the matrix . In order to save space, we will not repeat it.
Definition 2. Let  be a Lie algebra over field F. If the linear mapping φ of  to  satisfiesthen 6φ is said to be a homomorphic mapping or homomorphism of  to .  Definition 3. The homomorphism of a Lie algebra g to itself is called the endomorphism of g, and all endomorphisms of g are denoted as . The isomorphism from g to itself is called automorphism and all automorphisms of g form a group, which is called the automorphism group of g and is called .
 Theorem 3. The linear mapping in the four-dimensional Lie algebra g is established as follows: If φ is an automorphism of Lie algebra g, then there must be  Proof.  Let  be an automorphism on g, then  must be a linear transformation on g.
According to the definition of isomorphism, 
Based on the above six cases, the following equation holds:
        
Since 
 is isomorphic, 
 is known from the previous reasoning, so there must be 
, otherwise:
        
        it is an isomorphic contradiction with 
. Thus, 
, and the following equation holds:
        
        so:
        
□
 Theorem 4. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, there are
        
        so 
 belongs to 
, easy-to-know 
 is equal to 
. Let
        
So,  is a commutative subgroup of .    □
 Theorem 5. Letthen,  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, there are
        
        so 
 belongs to 
, easy-to-know 
 is equal to 
.
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 6. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, there are
        
        so, 
 belongs to 
, easy-to-know 
 is equal to 
.
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 7. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, there are
        
        so, 
 belongs to 
, easy-to-know 
 is equal to 
.
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 8. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, 
, there are
        
        so, 
 belongs to 
, easy-to-know 
 is equal to 
.
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 9. Letthen  is a second order cyclic subgroup of .  Proof.  Obviously, 
 holds.
        
        so, 
 is a second order cyclic subgroup of 
.    □
 Theorem 10. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, 
 there are
        
        so, 
 belongs to 
, easy-to-know 
 is equal to 
. 
,
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 11. Letthen  is a commutative subgroup of .  Proof.  Obviously, 
 holds. For any 
 in 
, 
        so, 
 belongs to 
, easy-to-know 
 is equal to 
. 
,
        
        so, 
 is a commutative subgroup of 
.    □
 Theorem 12.  and  are interchangeable.
 Proof.  , because
        
        so,
        
Thus,  and  are interchangeable.    □
 Definition 4. Given that  and  are two subgroups of , let 
 Theorem 13.  is a subgroup of .
 Proof.  Because  and , so .
, due to 
 and 
 is exchangeable, so
        
        and
        
□
 Theorem 14.  and  are interchangeable.
 Proof.  , because
        
        so
        
Thus,  and  are interchangeable.    □
 Theorem 15.  and  are interchangeable.
 Proof.  , because
        
        so,
        
Thus,  and  are interchangeable.    □
 Theorem 16.  and  are not necessarily interchangeable.
 Proof.  , because
        
        so, 
 is not necessarily equal to 
Thus,  and  are not necessarily interchangeable.    □
 Theorem 17.  and  are interchangeable.
 Proof.   because
        
        so,
        
        obviously,
        
Thus,  and  are interchangeable.    □
 Theorem 18.  and  are interchangeable.
 Proof.  , bcause
        
        so,
        
Thus,  and  are interchangeable.    □
 Theorem 19.  and  are interchangeable.
 Proof.  , because
        
        so,
        
Thus,  and  are interchangeable.    □
 Similarly, we can study the commutativity between  and . For example, we can prove that  and  can be exchanged,  and  can be exchanged, and  and  can be exchanged. Studying this commutativity is certainly helpful for the subsequent study of whether the decomposition of automorphism groups is unique.
Theorem 20. The automorphism group  of Lie algebra g can be decomposed into the following form:
(1) When , there are (2) When , there are (3) When , there are  Proof.  Take any B in G at 
; let
        
Using the undetermined coefficient method, for
        
        it is advisable to set
        
Thus, the original proposition holds.
At this time, because , it is converted to case 1.
At this time, when , it is changed to case 1.    □