Lattices Generated by Orbits of Subspaces under Finite Singular Orthogonal Groups II
Abstract
Let be a (2ν + δ + l)-dimensional vector space over the finite field 𝔽q. In this paper we assume that 𝔽q is a finite field of odd characteristic, and O2ν+δ+l, Δ(𝔽q) the singular orthogonal groups of degree 2ν + δ + l over 𝔽q. Let ℳ be any orbit of subspaces under O2ν+δ+l, Δ(𝔽q). Denote by ℒ the set of subspaces which are intersections of subspaces in ℳ, where we make the convention that the intersection of an empty set of subspaces of is assumed to be . By ordering ℒ by ordinary or reverse inclusion, two lattices are obtained. This paper studies the questions when these lattices ℒ are geometric lattices.
1. Introduction
The results on the geometricity of lattices generated by subspaces in d-bounded distance-regular graphs can be found in Guo et al. [1]; on the geometricity and the characteristic polynomial of lattices generated by orbits of flats under finite affine-classical groups can be found in Wang and Feng [2], Wang and Guo [3]; on inclusion relations, the geometricity and the characteristic polynomial of lattices generated by orbits of subspaces under finite nonsingular classical groups and a characterization of subspaces contained in lattices can be found in Huo [4–6], Huo and Wan [7, 8]; on inclusion relations, the geometricity and the characteristic polynomial of lattices generated by orbits of subspaces under finite singular symplectic groups, singular unitary groups, and singular pseudosymplectic groups and a characterization of subspaces contained in lattices can be found in Gao and You [9–12]. In [13], the authors studied the various lattices ℒO(ℳ) and ℒR(ℳ) generated by different orbits ℳ of subspaces under singular orthogonal group O2ν+δ+l,Δ(𝔽q). The study contents include the inclusion relations between different lattices, the characterization of subspaces contained in a given lattice ℒR(ℳ) (resp., ℒO(ℳ)), and the characteristic polynomial of ℒR(ℳ). The purpose of this paper is to study the questions when ℒR(ℳ) (resp., ℒO(ℳ)) are geometric lattices.
2. Preliminaries
In the following, we recall some definitions and facts on ordered sets and lattices (see [8, 14]).
Let A be a partially ordered set, and a, b ∈ A. We say that b covers a and write a < · b, if a < b and there exists no c ∈ A such that a < c < b. An element m ∈ A is called the minimal element if there exists no elements a ∈ A such that a < m. If A has a unique minimal element, denote it by 0 and we say that A is a poset with 0.
Let A be a poset with 0 and a ∈ A. If all maximal ascending chains starting from 0 with endpoint a have the same finite length, this common length is called the rank r(a) of a. If rank r(a) is defined for every a ∈ A, A is said to have the rank function r : A → ℕ, where ℕ is the set consisting of all positive integers and 0.
A poset A is said to satisfy the Jordan-Dedekind (JD) condition if any two maximal chains between the same pair of elements of A have the same finite length.
Proposition 2.1 ([14, Proposition 2.1]). Let A be a poset with 0. If A satisfies the JD condition then A has the rank function r : A → ℕ which satisfies
- (i)
r(0) = 0,
- (ii)
a < · b⇒r(b) = r(a) + 1.
Let A be a poset with 0. An element a ∈ A is called an atom of A if 0 < · a. A lattice L with 0 is called an atomic lattice (or a point lattice) if every element a ∈ L∖{0} is a supremum of atoms, that is, a = sup {b ∈ L∣0 < ·b ≤ a}.
Definition 2.2 ([14, page 46]). A lattice L is called a semimodular lattice if for all a, b ∈ L,
Proposition 2.3 ([14, Theorem 2.27]). Let L be a lattice with 0. Then, L is a semimodular lattice if and only if L possesses a rank function r such that for all x, y ∈ L
Definition 2.4 ([14, page 52]). A lattice L is called a geometric lattice if it is
-
an atomic lattice,
-
a semimodular lattice,
-
G3 without infinite chains in L.
According to Definition 2.2, Proposition 2.3, and Definition 2.4, we can obtain the following proposition.
Proposition 2.5. Let L be a lattice with 0. Then, L is a geometric lattice if and only if
-
G1 for every element a ∈ L∖{0}, a = sup {b ∈ L∣0 < ·b ≤ a},
-
G2 L possesses a rank function r and for all x, y ∈ L, (2.2) holds,
-
G3 without infinite chains in L.
Two n × n matrices A and B are called to be cogredient if there exists a nonsingular matrix P such that PAPt = B.
- (i)
P is a subspace of type (m, 2s + γ, s, Γ),
- (ii)
dim (P∩E) = k.
Moreover, if ℳ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is nonempty, then it forms an orbit of subspaces under O2ν+δ+l,Δ(𝔽q). Let ℒ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) denote the set of subspaces which are intersections of subspaces in ℳ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), where we make the convention that the intersection of an empty set of subspaces of is assumed to be . Partially ordering ℒ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) by ordinary or reverse inclusion, we get two finite lattices and denote them by ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) and ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), respectively.
The case ℒR(m − l, 2s + γ, s, Γ; 2ν + δ, Δ) has been discussed in [8]. So, we only discuss the case 0 ≤ k < l in this paper.
By [13], we have the following results.
Theorem 2.6. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l, assume that (m, 2s + γ, s, Γ, k) satisfies conditions (2.10) and (2.11). Then,
Theorem 2.7. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l. Assume that (m, 2s + γ, s, Γ, k) satisfies condition (2.10), then ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) consists of and all the subspaces of type (m1, 2s1 + γ1, s1, Γ1, k1), where (m1, 2s1 + γ1, s1, Γ1, k1) satisfies condition (2.13).
Theorem 2.8. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l, and (m, 2s + γ, s, Γ, k) satisfy
Theorem 2.9. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l, and (m, 2s + γ, s, Γ, k) satisfy (2.14). For any X ∈ ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), define
3. The Geometricity of Lattices ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ)
Theorem 3.1. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l, assume that (m, 2s + γ, s, Γ, k) satisfies conditions (2.10) and (2.11). Then
- (i)
each of ℒO(k + 1, 0, 0, ϕ, k; 2ν + δ + l, Δ) and ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ) (Γ = 1 or z) is a finite geometric lattice, when k = 0, and is a finite atomic lattice, but not a geometric lattice when 0 < k < l;
- (ii)
when 2 ≤ m − k ≤ 2ν + δ − 1, ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is a finite atomic lattice, but not a geometric lattice.
Proof. By Theorem 2.8, the rank function of ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is defined by formula (2.15), we will show the condition G1 of Proposition 2.5 holds for ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ). {0} ∈ ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) and it is the minimal element, so all 1-dim subspaces in ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) are atoms of ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ).
Let , by Theorem 2.7, U is a subspace of type (m1, 2s1 + γ1, s1, Γ1, k1) and satisfies condition (2.13). If m1 = 1, then U is an atom of ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ). Assume m1 ≥ 2, then
Let Ui be an ith (1 ≤ i ≤ m1) row vector of U, then 〈Ui〉 is a subspace of type (1, 0, 0, ϕ, 0), (1, 1, 0, 1, 0), (1, 1, 0, z, 0), or (1, 0, 0, 0, 1), and 〈Ui〉 ⊂ U. By Theorem 2.7, we know 〈Ui〉 ∈ ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), so 〈Ui〉 is an atom of ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), and , hence, U is a union of atoms in ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ). Since |ℳ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ)| ≥ 2, there exist W1, W2 ∈ ℳ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), W1 ≠ W2, such that . W1, W2 are unions of atoms in ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), hence, is a union of atoms in ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), therefore, G1 holds.
In the following, we prove (i) and (ii).
The Proof of (i). We only prove the formula (2.2) holds for ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ). The other can be obtained in the similar way. We consider two cases:
(a) k = 0. ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ) consists of and subspaces of type (1, 1, 0, Γ, 0). Let U, W ∈ ℒO(1, 1, 0, Γ, 0; 2ν + δ + l, Δ), if U, W are , respectively, then , so r(U∨W) + r(U∧W) = r(U) + r(W). If U = W is {0} or , the other is a subspace of type (1, 1, 0, Γ, 0), then U∧W is {0} or subspace of type (1, 1, 0, Γ, 0), U∨W is a subspace of type (1, 1, 0, Γ, 0) or , so r(U∨W) + r(U∧W) = r(U) + r(W). If U and W are subspaces of type (1, 1, 0, Γ, 0), then , so r(U∨W) + r(U∧W) = r(U) + r(W).
Hence, (2.2) holds and ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ) is a finite geometric lattice when k = 0.
(b) 0 < k < l. Let U = 〈e1 + (Γ/2)eν+1〉, W = 〈es+1 + (Γ/2)eν+s+1〉, where s ≤ ν − 1, then U, W ∈ ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ). When q = 3(mod 4) or q = 1(mod 4), then −1 is a nonsquare element or a square element, respectively. Thus, [Γ, Γ] is cogredient to either [1, −z] or S2·1, and 〈U, W〉 is a subspace of type (2, 2, 0, Γ, 0), where Γ = [1, −z], or a subspace of type (2, 2, 1, ϕ, 0). So 〈U, W〉 ∉ ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ), and we have , U∧W = {0}. By the definition of rank function, r(U∨W) = k + 1 + 1 = k + 2, r(U∧W) = 0, r(U) = r(W) = 1, we have r(U∨W) + r(U∧W) = k + 2 > r(U) + r(W) = 2.
Hence, ℒO(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ) is a finite atomic lattice, but not a geometric lattice when 0 < k < l.
The Proof of (ii). We will show there exist U, W ∈ ℒO(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) such that the formula (2.2) does not hold. As to γ = 0, 1, or 2, we only show the proof of γ = 1, others can be obtained in the similar way. We distinguish the following three cases.
(a) δ = 0, or δ = 1, Γ ≠ Δ. Then, the formula (2.10) is changed into 2s + 1 ≤ m − k ≤ ν + s. Let σ = ν + s − m + k, we distinguish the following two subcases.
(a.1) m − k − 2s − 1 ≥ 1. From m − k − 2s − 1 ≥ 1 and m − k ≤ ν + s, we have s + 2 ≤ ν. Let
(a.2) m − k − 2s − 1 = 0. From 2 ≤ m − k ≤ 2ν + δ − 1, we have s + 1 ≤ ν, s ≥ 1. Let
(b) δ = 1, Γ = Δ. Then, the formula (2.10) is changed into 2s + 1 ≤ m − k ≤ ν + s + 1. Let σ = ν + s − m + k + 1, we distinguish the following two subcases.
(b.1) m − k − 2s − 1 ≥ 1. From m − k − 2s − 1 ≥ 1, and 2 ≤ m − k ≤ 2ν, we have s + 1 ≤ ν. Let
(b.2) m − k − 2s − 1 = 0. From 2 ≤ m − k ≤ 2ν, we have s + 1 ≤ ν. Let
(c) δ = 2. Then, the formula (2.10) is changed into 2s + 1 ≤ m − k ≤ ν + s + 1. Let σ = ν + s − m + k + 1, we distinguish the following two subcases.
(c.1) m − k − 2s − 1 ≥ 1. From m − k − 2s − 1 ≥ 1, and m − k ≤ 2ν + 1, we have s + 1 ≤ ν. Let
(c.2) m − k − 2s − 1 = 0. From 2 ≤ m − k ≤ 2ν + 1, we have s ≥ 1 and m ≥ 3. We choose (a, b) and (c, d) being two linearly independent solutions of the equation x2 − zy2 = Γ. Let
4. The Geometricity of Lattices ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ)
Theorem 4.1. Let 2ν + δ + l > m ≥ 1, 0 ≤ k < l, assume that (m, 2s + γ, s, Γ, k) satisfies conditions (2.10) and (2.11). Then,
- (i)
each of ℒR(k + 1, 0, 0, ϕ, k; 2ν + δ + l, Δ), ℒR(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ) (Γ = 1 or z) and ℒR(2ν + δ + k − 1, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is a finite geometric lattice when k = 0, and is a finite atomic lattice, but not a geometric lattice when 0 < k < l;
- (ii)
when 2 ≤ m − k ≤ 2ν + δ − 2, ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is a finite atomic lattice, but not a geometric lattice.
Proof . By Theorem 2.9, the rank function of ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) is defined by formula (2.16), is the minimal element of ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), all subspaces of type (m, 2s + γ, s, Γ, k) in ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) are atoms of ℒR(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ).
The Proof of (i). By [8], ℒR(k + 1, 0, 0, ϕ, k; 2ν + δ + l, Δ), ℒR(k + 1, 1, 0, Γ, k; 2ν + δ + l, Δ), and ℒR(2ν + δ + k − 1, 2s + γ, s, Γ, k; 2ν + δ + l, Δ) are finite geometric lattices when k = 0; in the following, we will show that they are finite atomic lattices, but not geometric lattices when 0 < k < l.
(a) Let
(b) Let
(c) From the condition (2.10), the following hold.
- (i)
If γ = δ = 1, Γ ≠ Δ, then 2ν + δ − 1 ≤ ν + s, that is, ν ≤ s, ν = s, hence 2ν + 1 ≤ 2ν, and it is a contradiction.
- (ii)
If γ = δ, Γ = Δ, then 2ν + δ − 1 ≤ ν + s + δ, that is, ν − 1 ≤ s, hence s = ν, or s = ν − 1. When s = ν, from 2s + γ ≤ 2ν + δ − 1, we obtain 2ν + δ ≤ 2ν + δ − 1, and it is a contradiction. When s = ν − 1, we have 2ν + δ − 2 ≤ 2ν + δ − 1. That is, in this situation, ν − 1 = s holds.
- (iii)
If γ ≠ δ, then 2ν + δ − 1 ≤ ν + s + min {δ, γ} ≤ ν + s + δ, that is, ν − 1 ≤ s, hence s = ν, or s = ν − 1. When s = ν, we have 2ν + γ ≤ 2ν + δ − 1, then γ ≤ δ − 1. When s = ν − 1, we have 2ν + γ − 2 ≤ 2ν + δ − 1, then γ − 1 ≤ δ.
From the discussion above, we know that
(c.1) If s = ν, then γ ≤ δ − 1, and we have δ = 1, γ = 0; δ = 2, γ = 0, and δ = 2, γ = 1 three possible cases. For ℒR(2ν + δ + k − 1, 2ν + γ, ν, Γ, k; 2ν + δ + l, Δ), here we just give the proof of the case δ = 2, γ = 1, others can be obtained in the similar way. We choose (a, b) and (c, d) being two linearly independent solutions of the equation x2 − zy2 = Γ. Let
(c.2) If s = ν − 1, then we have γ ≠ δ, γ − 1 ≤ δ; or γ = δ, Γ = Δ. As to ℒR(2ν + δ + k − 1, 2(ν − 1) + γ, ν − 1, Γ, k; 2ν + δ + l, Δ), we consider δ = 0, δ = 1, and δ = 2 three cases. Here we just give the proof of the case δ = 1, and we also discuss the following three subcases:
(c.2.1) δ = 1, γ = 0. For ℒR(2ν + k, 2(ν − 1), ν − 1, ϕ, k; 2ν + δ + l, Δ), let
(c.2.2) δ = 1, γ = 1, Γ = Δ. For ℒR(2ν + k, 2(ν − 1) + 1, ν − 1, Δ, k; 2ν + δ + l, Δ), let
(c.2.3) δ = 1, γ = 2. See the proof of the Theorem 7 in [12].
The Proof of (ii). Let U ∈ ℳ(m, 2s + γ, s, Γ, k; 2ν + δ + l, Δ), then
In Table 1 as follows .
As to δ = 0; δ = 1, Δ = 1; δ = 1, Δ = z, and δ = 2 four cases, we only show the proof of the case δ = 0, others can be obtained in the similar way. We also distinguish the following three subcases.
(a) If γ = 0, then Λ1 = S2s, Λ* = S2(ν−m+k+s). Let u1, u2, …, us, v1, v2, …, vs, us+1, …, um−k−s, w1, …, wk and vs+1, …, vm−k−s, um−k−s+1, …, uν, vm−k−s+1, …, vν, wk+1, …, wl be row vectors of U and Z, respectively,
From m − k ≤ 2ν − 2, we know s < ν. If m − k = 2s, then m − k − s = s < ν, so uν, vν ∉ U. If m − k > 2s, then s < ν − 1, so vν−1, vν ∉ U. In a word, dim 〈U, W〉 ≥ m + 2, dim (U∩W) ≤ m − 2. That is, , r′(U∧W) = 0, r′(U∨W) ≥ m + 1 − (m − 2) = 3, r′(U) = r′(W) = m + 1 − m = 1. Consequently, r′(U∧W) + r′(U∨W) > r′(U) + r′(W).
(b) If γ = 1, then Λ1 = S2s+1,Γ, Λ* = S2(ν−m+k+s)+1,−Γ, and Γ = (1) or (z). Let u1, u2, …, us, v1, v2, …, vs, ω, us+1, …, um−k−s−1, w1, …, wk and vs+1, …, vm−k−s−1, um−k−s, …, uν−1, vm−k−s, …, vν−1, ω*, wk+1, …, wl be row vectors of U and Z, respectively
(c) If γ = 2, then Λ1 = S2s+2,Γ, Λ* = S2(ν−m+k+s)+2,Γ, and Γ = [1, −z]. Let u1, u2, …, us, v1, v2, …, vs, ω1, ω2, us+1, …, um−k−s−2, w1, …, wk and be row vectors of U and Z, respectively,
From the discussion above, we know that when 2 ≤ m − k ≤ 2ν − 2, ℒR(m, 2s + γ, s, Γ, k; 2ν + l) is a finite atomic lattice, but not a geometric lattice.
δ = 0 | δ = 1, Δ = 1 | δ = 1, Δ = z | δ = 2 | |
---|---|---|---|---|
γ = 0 | Σ0 | [Σ0, 1] | [Σ0, z ] | [Σ0, 1, − z ] |
γ = 1, Γ = 1 | [Σ0, − 1 ] | Σ1 | [Σ0, − 1, z ] | [Σ1, − z ] |
γ = 1, Γ = z | [Σ0, − z] | [Σ0, 1, − z] | Σ1 | [Σ1, − 1 ] |
γ = 2 | [Σ0, 1, − z] | [Σ1, z] | [Σ1, 1 ] | Σ2 |
Acknowledgments
This work is supported by the National Natural Science Foundation of China under Grant no. 61179026 and the Fundamental Research Funds for the Central Universities under Grant no. ZXH2012K003. The authors would like to thank the referee for his suggestions on simplifying the earlier version of the paper.