This paper investigates the arithmetical properties of orders in quaternion algebras over DVRs, focusing on invariants like elasticity, distances, and catenary degrees, and provides characterizations of their finiteness.
Contribution
It characterizes when the elasticity of local quaternion orders is finite and establishes finiteness results for distances and catenary degrees in this setting.
Findings
01
Finiteness of elasticity is characterized.
02
Distances and catenary degrees are finite for these orders.
03
Results extend understanding beyond hereditary orders and specific examples.
Abstract
Let D be a DVR, let K be its quotient field, and let R be a D-order in a quaternion algebra A over K. The elasticity of R∙ is \rho(R^\bullet) = \sup\{\, k/l : u_1\cdots u_k = v_1 \cdots v_l \text{ with u_i,v_jatomsofR^\bulletandk,l \ge 1} \,\} and is one of the basic arithmetical invariants that is studied in factorization theory. We characterize finiteness of ρ(R∙) and show that the set of distances Δ(R∙) and all catenary degrees cd(R∙) are finite. In the setting of noncommutative orders in central simple algebras, such results have only been understood for hereditary orders and for a few individual examples.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Arithmetical invariants of local quaternion orders
Let D be a DVR, let K be its quotient field, and let R be a D-order in a quaternion algebra A over K.
The elasticity of R∙ is \rho(R^{\bullet})=\sup\{\,k/l:u_{1}\cdots u_{k}=v_{1}\cdots v_{l}\text{ with u_{i},v_{j}atomsofR^{\bullet}andk,l\geq 1}\,\} and is one of the basic arithmetical invariants that is studied in factorization theory.
We characterize finiteness of ρ(R∙) and show that the set of distances Δ(R∙) and all catenary degrees cd(R∙) are finite.
In the setting of noncommutative orders in central simple algebras, such results have only been understood for hereditary orders and for a few individual examples.
Much of this work was completed when the first author was employed at the University of Central Missouri. The second author was supported by the Austrian Science Fund (FWF) project P26036-N26.
1. Introduction
If R is a Noetherian ring, every non-zero-divisor a∈R∙ can be written as a (finite) product of atoms (irreducible elements).
In general, such a factorization is not unique, and arithmetical invariants are used to describe this non-uniqueness.
If L(a)={k∈N0:a=u1⋯uk with u1,…,uk atoms} is the set of lengths of a, then ρ(a)=supL(a)/minL(a)∈Q≥1∪{∞} is the elasticity of a (where we set ρ(a)=1 for a∈R×).
The elasticity of R∙ is then ρ(R∙)=sup{ρ(a):a∈R∙}∈R≥1∪{∞}.
The study of arithmetical invariants, such as sets of lengths and elasticities, is part of factorization theory, a field which has been well-developed in the commutative setting (see [And97, Cha05, GHK06, FHL13, CFGO16, Ger16] for recent monographs and surveys) and which has been recently extended to noncommutative settings (see [BBG14, BS15, Sme16, Sme17, BJ16, BHL17] for recent results).
In transfer Krull monoids of finite type (as defined in [Ger16]), arithmetical invariants are always finite and can be expressed in terms of certain combinatorial invariants of an (abelian) class group associated to R∙.
This holds in particular when R is a ring of algebraic integers in a number field, where the class group is the usual one.
More recently, these results have been extended to a noncommutative setting: If R is a hereditary order in a central simple algebra over a number field, then R∙ is a transfer Krull monoid as well (see [Sme17] or [Sme13, BS15] for the special case of maximal orders).
Here, the class group is isomorphic to a ray class group of the center.
The proofs of these results proceed via multiplicative ideal theory, respectively, a structure theory for finitely generated projective modules over such rings.
In the commutative setting, non-hereditary (or, what is in this case equivalent, non-maximal) orders have been studied as well.
In particular, if R is an order in a number field and R is its integral closure, then ρ(R∙)<∞ if and only if the map spec(R)→spec(R) given by p↦p∩R is bijective.
This can be proved by passing to localizations (using the notion of defining systems), and studying the local situation, where Rp∙ (for p∈spec(R)) turns out to be a finitely primary monoid.
(See [GHK06, Theorem 3.7.1] or see [Kai05] for a vast generalization.)
As orders in number fields have provided the nucleus for the development of the commutative theory, their natural noncommutative analogues, orders in central simple algebras over number fields, provide a good starting point and benchmark for the development of a noncommutative theory.
Since hereditary orders have been dealt with, the next step is to consider non-hereditary orders.
In this paper, we consider the simplest of these cases: Let D be a discrete valuation ring, let K be its quotient field, let A be a quaternion algebra over K, and let R be a D-order in A (in particular, we restrict to the local case).
The main result of the present paper is as follows.
The definitions of the arithmetical invariants can be found in Section 2.
For a discussion of the Structure Theorem for Unions of Sets of Lengths and the definition of almost arithmetical progressions (AAPs) see [Ger16, Theorem 2.6 and Definition 2.5].
See also [FGKT17], where Fan, Geroldinger, Kainrath, and Tringali characterize when the Structure Theorem for Unions of Sets of Lengths holds.
Theorem 1.1**.**
Let D be a discrete valuation ring, let K be its quotient field, and let A be a central simple K-algebra.
Let R be a D-order in A.
Suppose that the completion A≅A⊗KK is either a division ring or that A≅M2(K).
If R is hereditary, then ρ(R∙)=1, Δ(R∙)=∅, and cd(R∙)≤2 for any distance d on R∙.
If R is not hereditary, then
(1)
ρ(R∙)<∞* if and only if A is a division ring.*
2. (2)
∣Δ(R∙)∣<∞* and cd(R∙)<∞ for any distance d on R∙.*
3. (3)
The Structure Theorem for Unions of Sets of Lengths holds for R∙.
Thus, if Δ(R∙)=∅, there exist constants k∗ and M∗∈N such that for all k≥k∗, the union of sets of lengths Uk(R∙) is an AAP with difference minΔ(R∙) and bound M∗.
(If Δ(R∙)=∅, then Uk(R∙)={k}.)
If R is an Eichler order of level n≥2, then cd(R∙)≤n+6, minΔ(R∙)=1, and maxΔ(R∙)≤n+4.
In particular, Uk(R∙)=N≥2 for k≥2.
In this paper we deal with non-hereditary orders, as hereditary orders have been treated before.
If R is a hereditary D-order in a central simple algebra (where D is a DVR), then R is a semilocal hereditary Noetherian prime ring.
In this case stable isomorphism of finitely generated projective R-modules implies isomorphism, and R has trivial ideal class group (see [LR11, §40]).
As a consequence of [Sme17, Theorem 4.4], we then have ρ(R∙)=1, Δ(R∙)=∅, and cd(R∙)≤2.
Moreover, more precise information about unique factorization is available in the form of [Sme17, Proposition 4.12].
(In this case, ρ(R∙)=1 and Δ(R∙)=∅ can also be derived using [Est91].)
Together with the results on hereditary orders, Theorem 1.1 completely characterizes the finiteness of the stated arithmetical invariants for orders in quaternion algebras (dimKA=4) over the quotient field of a DVR.
In particular, if R is such an order, then ρ(R∙)<∞ if and only if R is hereditary or A is a division ring.
Remark 1.2**.**
We have noted in Theorem 1.1 that minΔ(R∙)=1 if R is an Eichler order. In fact, the authors know of no examples where minΔ(R∙)>1, even when R is not Eichler. It would be interesting to find such an example, if one exists.
In the proof we distinguish three separate cases: Where the completion A is a division ring, where A≅M2(K) and R is an Eichler order, and where A≅M2(K) and R is a non-Eichler order.
The first case is the simplest, running essentially parallel to the commutative one for finitely primary monoids of rank 1 (in fact, here it is not necessary to require dimKA=4).
The second case is dealt with by explicit computations (here we also have the most explicit bounds on the invariants and are able to provide a complete classification of the atoms).
In the third and final case we make use of a parametrization of quaternion orders by means of ternary quadratic forms (a special case of [Voi11]).
The paper is structured accordingly: After recalling some necessary background, we study the three cases as outlined above in Sections 3, 4 and 5.
In Sections 4 and 5 we assume at first that D is complete.
In the final section, Section 6, we tie everything together, culminating in the proof of Theorem 1.1.
The passage to the non-complete case is dealt with by constructing a transfer homomorphism to the completion.
This also allows us to apply the conclusions of Sections 4 and 5 to the case when D is not complete.
We thank the referee for a careful reading of a previous version of this manuscript and, in particular, for pointing out the questions in Remark 1.2 and Remark 3.2.
2. Background
By N0 we denote the set of nonnegative integers, and by N the set of positive integers.
If a, b∈Z we denote by [a,b]={x∈Z:a≤x≤b} a discrete interval.
The symbol ⊂ denotes an inclusion of sets that is not necessarily proper.
By a monoid we mean a cancellative semigroup with identity.
If H is a multiplicative semigroup with identity, we denote by H∙ its monoid of cancellative elements, and by H× its unit group.
A discrete valuation ring (DVR) is a commutative principal ideal domain with a unique non-zero prime ideal.
If D is a DVR, we will always write π∈D for a prime element.
2.1. Factorizations and arithmetical invariants
Let H be a monoid.
An element u∈H is an atom if u=ab with a, b∈H implies a∈H× or b∈H×.
The set of atoms of H is denoted by A(H).
The monoid H is atomic if every non-unit can be expressed as a product of finitely many atoms.
Two elements a, b∈H are associated if there exist ε, δ∈H× such that a=εbδ, and right associated [left associated] if a=bε [a=εb].
Denote by F∗(A(H)) the free monoid with basis A(H).
On the cartesian product H××F∗(A(H)) we define the following operation:
If (ε,y), (ε′,y′)∈H××F∗(A(H)) with y=u1⋯uk and y′=v1⋯vl where u1, …, uk, v1, …, vl∈A(H), then
[TABLE]
With this product, H××F∗(A(H)) is a monoid.
On H××F∗(A(H)), we define a congruence ∼ by (ε,y)∼(ε′,y′) if all of the following hold:
•
k=l,
•
εu1⋯uk=ε′v1⋯vk as product in H,
•
either k=0, or there exist δ2, …, δk∈H× and δk+1=1 such that
[TABLE]
Definition 2.1**.**
Let H be a monoid.
The quotient Z∗(H)=H××F∗(A(H))/∼ is the monoid of (rigid) factorizations of H.
The class of (ε,u1⋯uk) in Z∗(H) is denoted by εu1∗⋯∗uk.
The symbol ∗ also denotes the operation on Z∗(H).
There is a natural homomorphism
[TABLE]
For a∈H, the set Z∗(a)=ZH∗(a)=π−1(a) is the set of (rigid) factorizations of a.
If z=εu1∗⋯∗uk, then ∣z∣=k is the length of z.
By construction, εu1∗⋯∗ui∗ui+1∗⋯∗uk=εu1∗⋯∗uiδ−1∗δui+1∗⋯∗uk for all δ∈H× and for all i∈[1,k−1].
Similarly, εu1∗⋯∗uk=1(εu1)∗⋯∗uk if k≥1.
In particular, as long as k≥1 (equivalently, π(z)∈H×), we may represent z as z=u1′∗⋯∗uk′ with atoms u1′, …, uk′ and omit the unit at the beginning.
We now define a number of arithmetical invariants, based on the lengths of factorizations alone.
More background on these arithmetical invariants can be found in the recent survey [Ger16].
Definition 2.2**.**
Let H be an atomic monoid and let a∈H.
(1)
L(a)=LH(a)={∣z∣:z∈ZH∗(a)}⊂N0 is the set of lengths of a.
2. (2)
H is half-factorial if ∣L(a)∣=1 for all a∈H.
3. (3)
A natural number d∈N is a distance of a if there exist k, l∈L(a) with l−k=d and L(a)∩[k,l]={k,l}.
By Δ(a)⊂N we denote the set of distances of a, and by
[TABLE]
the set of distances of H.
4. (4)
For k∈N we define
[TABLE]
the union of sets of lengths containing k.
5. (5)
For k∈N the k-th elasticity is ρk(H)=supUk(H)∈N∪{∞}.
6. (6)
The elasticity of a is
[TABLE]
if a∈H×, and ρ(a)=1 if a∈H×.
The elasticity of H is then ρ(H)=sup{ρ(a):a∈H}∈R≥1∪{∞}.
With these definitions, we have
[TABLE]
An almost arithmetical progression (AAP) with difference d∈N and bound M∈N0 is a subset L⊂N0 with L⊂minL+dZ and
[TABLE]
We say that the Structure Theorem for Unions of Sets of Lengths holds for H if there are constants d, k∗ and M such that for all k≥k∗ every Uk(H) is an AAP with distance d and bound M. Again, we refer to [Ger16] for additional background.
Often it is easier to study sets of lengths in an alternate monoid and then pull back arithmetical information via an appropriate monoid homomorphism. A transfer homomorphismφ:H→T of two monoids H, T is a homomorphism satisfying:
•
T=T×φ(H)T× and φ−1(T×)=H×.
•
If a∈H, s, t∈T and φ(a)=st, then there exist b, c∈H and ε∈T× such that a=bc, φ(a)=sε−1, and φ(b)=εt.
A transfer homomorphism φ is isoatomic if, whenever u, v∈A(H) are such that φ(u) and φ(v) are (two-sided) associated in T, then already u and v are associated in H.
Transfer homomorphisms allow one to lift many factorization theoretical properties from T to H.
In particular, LH(a)=LT(φ(a)) for all a∈H.
See [BS15].
To introduce a more refined invariant, namely the catenary degree, we first need the notion of a distance between two factorizations.
(Note that the term ‘distance’ in the following definition is unrelated to the one for the set of distances Δ(H).)
Definition 2.3**.**
Let H be a monoid.
Let D={(z,z′)∈Z∗(H)×Z∗(H):π(z)=π(z′)}.
A distance on H is a map d:D→N0 satisfying each of the following properties for all z, z′, z′′∈Z∗(H) with π(z)=π(z′)=π(z′′) and all x∈Z∗(H):
This notion of a distance was introduced in [BS15, §3], where several examples of distances can be found.
For any distance we can now define a corresponding catenary degree.
Definition 2.4** (Catenary degree).**
Let H be an atomic monoid and let d be a distance on H.
(1)
Let a∈H and z, z′∈Z∗(a).
A finite sequence of rigid factorizations z0, …, zn of a is called an N-chain (in distance d) between z and z′ if
[TABLE]
2. (2)
The catenary degree (in distance d) of a, denoted by cd(a), is the minimal N∈N0∪{∞} such that for any two factorizations z, z′∈Z∗(a), there exists an N-chain between z and z′.
3. (3)
The catenary degree (in distance d) of H is
[TABLE]
2.2. Orders in central simple algebras
We refer to [Rei75] for background on orders in central simple algebras.
Let D be a DVR with quotient field K and let A be a central simple K-algebra.
The algebra A is a quaternion algebra if dimKA=4.
A subring R⊂A is a (D-)order in A if D⊂R, the D-module R is finitely generated, and KR=A.
We denote by nr:A→K the reduced norm and by tr:A→K the reduced trace.
Every x∈A is a root of its reduced characteristic polynomial,
[TABLE]
If x∈R, then x is integral over D, and hence the coefficients of the reduced characteristic polynomial are all in D.
We recall that some basic multiplicative properties of an element x of R may be characterized in terms of nr(x).
Lemma 2.5**.**
Let x∈R.
(1)
x∈R×* if and only if nr(x)∈D×.*
2. (2)
x∈R∙* if and only if nr(x)=0.*
3. (3)
If nr(x)∈A(R∙) then x∈A(R∙).
Proof.
(1)
If xy=1 with y∈R, then nr(x)nr(y)=nr(xy)=1, and hence nr(x)∈D×.
If nr(x)∈D×, then Eq. 2.1 implies x∈R×.
(2)
As in (1), one shows x∈A× if and only if nr(x)=0.
Thus, if nr(x)=0 then x∈R∙.
If x∈R∙, then x is also cancellative in A.
Since A∙=A×, we have x∈A× and so nr(x)=0.
(3)
Suppose x is not an atom.
Then x=yz with y, z∈R∙∖R×.
But then nr(x)=nr(y)nr(z) with nr(y), nr(z)∈D∙∖D× by (1).
Thus nr(x) is not an atom.
∎
We now note two simple facts that hold for all orders that are also local rings. These observations will be used in later sections.
By J(R) we denote the Jacobson radical of R.
Lemma 2.6**.**
Suppose R is a local ring (that is, R/J(R) is a division ring).
(1)
A(R∙)=J(R)∙∖{ab:a,b∈J(R)}.
In particular, every element in J(R)∙∖J(R)2 is an atom.
2. (2)
There exists an N∈N0 such that any product of N atoms of R∙ is divisible by π.
In particular, every x∈R∙ can be represented in the form x=πmεu1⋯un with ε∈R×, m∈N0, u1, …, un∈A(R∙), and n<N.
Proof.
(1)
This is immediate from the definitions, since J(R)=R∖R×.
(2)
Since R=R/πR is a finite dimensional D/πD-algebra, it is Artinian.
Thus there exists N∈N0 such that J(R)N=0.
This implies J(R)N⊂πR.
Since every product of N or more atoms is contained in J(R)N, the result follows.
∎
Quaternion orders.
Suppose now that A is a quaternion algebra, that is dimKA=4.
Then there exists a standard involution ⋅:A→A, the conjugation.
Thus, ⋅ is a K-linear anti-automorphism of A with x=x and xx∈K for all x∈A. In particular, we have
[TABLE]
If x∈R, then x=tr(x)−x∈R.
Therefore, ⋅ restricts to an involution of R.
It is immediate from the definitions that A(R∙)=A((R∙)op).
Since conjugation provides an isomorphism R∙→(R∙)op, it follows that x∈R∙ is an atom if and only if x is an atom.
We denote by v=vK:K→Z∪{∞} the valuation on K.
For quaternion orders we are able to relate the k-th elasticities to the maximal valuation of the norm of an atom.
The following lemma runs parallel to [Ger16, Proposition 6.1].
Lemma 2.7**.**
Let M=sup{v(nr(u)):u∈A(R∙)}∈N∪{∞}, let m=min{v(nr(u)):u∈A(R∙)}, and let D=2M/m∈Q≥2∪{∞}.
(1)
If π∈A(R∙), then m=2 and otherwise m=1.
Moreover, L(π)={2/m} and D∈N∪{∞}.
2. (2)
For k∈N, ρ2k(R∙)=kD,
[TABLE]
and
[TABLE]
In particular, the following statements are equivalent:
(a)
ρ2(R∙)=∞.
2. (b)
ρk(R∙)=∞* for all k≥2.*
3. (c)
ρk(R∙)=∞* for some k≥2.*
4. (d)
ρ(R∙)=∞.
5. (e)
*For every m∈N, there exists an atom u∈A(R∙) such that v(nr(u))≥m *(that is, D=∞).
Proof.
(1)
Since R∙ is atomic, there exist u1, …, ul∈A(R∙) such that π=u1⋯ul.
Since nr(π)=π2, we must have l≤2 and v(nr(ui))≤2 for all i∈[1,l].
Thus, m≤2.
If π∈A(R∙), then l=2 and hence m=1.
Conversely, if m=1 and u∈A(R∙) with v(nr(u))=1, then uu=nr(u)=επ for some ε∈D× and so π∈A(R∙).
Note also that L(π)={2/m} and D∈N∪{∞}.
(2)
We first determine an upper bound for ρk(R∙).
Suppose k, l∈N with k≤l and that a=u1⋯uk=v1⋯vl with a∈R∙, u1, …, uk, v1, …, vl∈A(R∙).
Then lm≤v(nr(a))≤kM and hence l≤kM/m.
We can conclude that ρk(R∙)≤⌊kM/m⌋ and so ρ2k(R∙)≤kD and ρ2k+1(R∙)≤kD+⌊D/2⌋.
Let u∈A(R∙). Then nr(u)=επl for some l∈N with l≤M and ε∈D×.
Since (uu)k=nr(u)k=εkπlk, we find maxL((uu)k)≥klmaxL(π).
We can conclude that ρ2k(R∙)≥kMmaxL(π)=kD.
Similarly, (uu)ku=εkπlku shows that ρ2k+1(R∙)≥lkmaxL(π)+1 and hence ρ2k+1(R∙)≥kD+1.
Finally, ρ(R∙)=limk→∞2kρ2k(R∙)=D/2.
∎
3. Orders of A when A is a division ring
We begin by considering the case where D is a DVR and A is a finite dimensional division ring over the quotient field K of D, having the additional property that the completion A is also a division ring.
This case is particularly easy since the valuation on K extends to A.
Theorem 3.1**.**
Let D be a DVR, let K be its quotient field, and let A be a finite-dimensional central division ring over K.
Suppose, moreover, that the completion A≅A⊗KK is also a division ring.
If R is an order in A, then
(1)
ρ(R∙)<∞* and hence ρk(R∙)<∞ for all k∈N,*
2. (2)
cd(R∙)<∞* for any distance d on R∙,*
3. (3)
∣Δ(R∙)∣<∞,
4. (4)
there exists M∈N such that ρk(R∙)−ρk−1(R∙)≤M for all k∈N≥2,
5. (5)
the Structure Theorem for Unions of Sets of Lengths holds for R∙.
Proof.
We briefly summarize the essential properties of the extension of the valuation vK to A.
These results follow from [Rei75, §12 and §13] when A=A and descend to the non-complete case by [Rei75, §18].
Since A is a division ring and D is complete, there exists a valuation vA:A→Z∪{∞} such that vA(x)=mevK(nr(x)) where m2=dimKA=dimKA and e=e(A/K) is the ramification index.
This restricts to a valuation vA=vA∣A on A.
The ring
[TABLE]
is the unique maximal D-order in A.
Let γ∈S with vA(γ)=1.
Every element of A may be represented in the form γnε with n∈Z and ε∈S×.
Since S and R are equivalent orders, there exist a, b∈S such that aSb⊂R.
Writing a=γvA(a)ε and b=δγvA(b) with ε, δ∈S× and using γS=Sγ, we see γv(a)+v(b)S⊂R.
It follows that there exists a minimal n∈N0 such that γnS={x∈A:vA(x)≥n}⊂R.
In particular:
•
γn∈R, and
•
If a, b∈R∙ such that vA(b)+n≤vA(a), then there exists c∈R∙ with a=bc.
In particular, if u∈A(R∙), then vA(u)≤2n−1.
By Lemma 2.5(1), an element a∈R∙ is a unit if and only if vA(a)=0.
We are now able to prove the claims of the theorem.
(1)
Let k,l∈N with k≤l and let u1, …, uk, v1, …, vl∈A(R∙) be such that a=u1⋯uk=v1⋯vl.
Then l≤vA(a)≤k(2n−1), and hence kl≤2n−1.
It follows that ρ(R∙)≤2n−1.
(2)
Let d be a distance on R∙ and let a∈R∙.
If a∈R×, then cd(a)=0, and hence we may suppose a∈R×.
We claim cd(a)≤3n−1.
Suppose that z=u1∗⋯∗uk and z′=v1∗⋯∗vl with u1, …, uk, v1, …, vl∈A(R∙) are two factorizations of a.
We need to show that there exists a (3n−1)-chain between z and z′.
Since vA(vi)≥1 for all i∈[1,l] and v(u1)≤2n−1, there exists m∈[1,l] with m≤3n−1 such that v1⋯vm=u1c with c∈R∙.
Taking m minimal, we must have vA(v1⋯vm−1)<vA(u1)+n.
Since vA(vm)≤2n−1, it follows that vA(c)<3n−1.
Hence c=w1⋯wr with r∈[1,3n−2] and w1, …, wr∈A(R∙).
Thus
[TABLE]
Since w1⋯wrvm+1⋯vl=u2⋯uk, we can iterate this process to find a (3n−1)-chain between z and z′.
(4)
Let k, l∈N≥2 and u1, …, uk, v1, …, vl∈A(R∙) be such that u1⋯uk=v1⋯vl.
As in (2), there exists m≤3n−1 such that u1 left divides v1⋯vm, say v1⋯vm=u1c with c∈R∙.
If c∈R×, then m=1, and l−1≤ρk−1(R∙).
If c∈R×, then maxL(c)≥1, and u2⋯uk=cvm+1⋯vl implies
[TABLE]
Thus l≤ρk−1(R∙)+3n−2.
We conclude ρk(R∙)≤ρk−1(R∙)+3n−2.
(5)
Holds by [Ger16, Theorem 2.6] since Δ(R∙) is finite and (4) holds.
∎
Remark 3.2**.**
The proof of Theorem 3.1 runs completely parallel to the one for finitely primary monoids of as given in [GHK06, Theorem 3.1.5] and [GK10, Proposition 3.6]. The fundamental property is that every atom u∈A(R∙) left divides any product of at least 3n−1 elements. This can be viewed as a (very strong) variant of the ω-invariant being bounded by 3n−1. We leave as an open question whether or not there is a transfer homomorphism from R∙ to some finitely primary monoid of rank 1.
4. Eichler orders in M2(K)
Let D be a DVR (not necessarily complete) with prime element π and valuation v, and let K be the quotient field of D.
We now consider the case where R is an Eichler order in A=M2(K).
Thus, without restriction,
[TABLE]
for some n∈N0.
The number n is referred to as the level of the Eichler order R.
The reduced norm coincides with the determinant, and conjugation coincides with the adjugate.
In case n∈{0,1}, the ring R is a hereditary order, and hence the results of [Est91, Sme17] apply.
Before proceeding, we briefly summarize the known results in these cases.
If n=0, then R=M2(D) is a maximal order.
Since R is a principal ideal ring, R∙ is similarity factorial; that is, as a consequence of the Jordan-Hölder Theorem, factorizations are unique up to order and similarity of the atoms.
Moreover, since every A∈R has a Smith Normal Form, the determinant is a transfer homomorphism.
If n=1, then R is a non-maximal hereditary order.
The determinant is again a transfer homomorphism (see [Est91]).
Moreover, R∙ is composition series factorial, but not similarity factorial (see [Sme17, Proposition 4.12]).
In particular, if n∈{0,1}, then R∙ is half-factorial and so ρ(R∙)=1 and Δ(R∙)=∅.
It is also known that cd(R∙)≤2 for every distance d on R∙.
(This follows from [Sme17, Theorem 4.10] together with the fact that R∙ has trivial class group.)
In this section, we study the remaining cases, in which R is non-hereditary.
For the remainder of this section, we assume R is as in Eq. 4.1 and n≥2.
For A∈R, let vi,j(A) denote the valuation of the (i,j)-th entry of A.
We shall repeatedly make use of the fact that for 2×2 matrices, taking the adjugate, which we denote by adj, is the standard involution on M2(R).
This often allows us to treat cases involving v1,1(A) and v2,2(A) by symmetry.
Note that, by Lemma 2.5, we have R∙={A∈R:det(A)=0} and R×={A∈R:det(A)∈D×}.
The units can be described even more explicitly.
Lemma 4.1**.**
Let
[TABLE]
Then A∈R× if and only if a, d∈D×.
Proof.
We have det(A)=ad−bcπn and A is a unit if and only if det(A)∈D×, that is, v(det(A))=0.
Suppose A∈R×.
Since v(ad−bcπn)≥min{v(a)+v(d),v(b)+v(c)+n} we must have v(a)=v(d)=0. Thus a, d∈D×.
Conversely, if v(a)=v(d)=0, then 0=v(ad)<v(bcπn) and hence v(det(A))=min{v(ad),v(bcπn)}=0.
Thus det(A)∈D× and so A∈R×.
∎
Lemma 2.5(3) also implies that if A∈R∙ with det(A)∈A(D∙), then A∈A(R∙).
We now prove a partial converse.
Lemma 4.2**.**
Let
[TABLE]
with v(b)+v(c)>0.
Then A is an atom in R∙ if and only if det(A) is an atom in D∙.
Proof.
We have already noted that if det(A) is an atom of D∙, then A is an atom of R∙.
Suppose to the contrary that det(A)=ad−bcπn is reducible, that is v(ad)≥2.
Suppose that v(a)≥1.
If v(b)≥1, then
[TABLE]
is a factorization of A into two non-units.
If v(c)≥1, then
[TABLE]
If v(a)=0, then v(d)≥2, and by what we have already shown, adj(A) is reducible.
Thus A=adj(adj(A)) is also reducible.
∎
However, we now show that — completely contrary to the cases n∈{0,1} — there exist atoms whose determinant is not an atom, and thus the converse of Lemma 2.5(3) is false in general.
Lemma 4.3**.**
If
[TABLE]
with v(b)=v(c)=0 and v(a)>0, v(d)>0, then A is an atom in R∙.
Proof.
Suppose that A factors as
[TABLE]
a product of two non-units B and C of R∙.
Considering the upper-right and lower-left corners of A, we obtain
[TABLE]
and
[TABLE]
First suppose that v(e)+v(q)=0.
Then v(h)>0 since B is not a unit.
Thus v(g)+v(p)=0.
But then
[TABLE]
a contradiction to the assumption that v(a)>0.
In the case that v(f)+v(s)=0, we similarly find v(p)>0 and hence v(h)+v(r)=0, a contradiction to v(d)>0.
∎
We will soon classify all of the atoms of R∙.
Before doing so, we give a lemma that provides atoms of arbitrarily large valuation.
This, in turn, guarantees infinite elasticity as per Lemma 2.7(2).
Lemma 4.4**.**
For all a∈D∙∖D×, there exists an atom U∈A(R∙) with det(U)=a.
In particular, we have ρk(R∙)=∞ for all k≥2.
Proof.
If v(a)=1, then
[TABLE]
is an atom with det(U)=a.
If v(a)>1, then Lemma 4.3 implies that
[TABLE]
is an atom. Moreover, det(U)=a. The final statement now follows from Lemma 2.7(2).
∎
Unlike for the rings studied in Section 5, we are able to give a full classification of the atoms of Eichler orders. Before classifying the atoms of R, we take a closer look at the unit group R× and investigate how the valuations of entries of matrices in R behave with respect to products.
In general, the valuations of the individual entries of a matrix are not additive on products.
Moreover, they are not preserved under associativity.
However, as we shall observe, the valuations in the upper-left and the lower-right corners are preserved under products and associativity if they are small enough.
Lemma 4.6**.**
Let A=A1⋯Am with A, A1, …, Am∈R∙.
(1)
If v1,1(A)<n then v1,1(A)=v1,1(A1)+⋯+v1,1(Am).
2. (2)
If v2,2(A)<n then v2,2(A)=v2,2(A1)+⋯+v2,2(Am).
Proof.
It suffices to consider the case m=2; the general case follows by induction.
Let A=BC be as in Eq. 4.2.
Then v1,1(A)=v(a)=v(ep+frπn).
By assumption, v(a)<n and therefore v(a)=v(ep)=v1,1(B)+v1,1(C).
The second claim follows by symmetry.
∎
Lemma 4.7**.**
Let A, A′∈R∙ be associated.
(1)
If v1,1(A)<n, then v1,1(A′)=v1,1(A).
2. (2)
If v2,2(A)<n, then v2,2(A′)=v2,2(A).
Proof.
We prove (1) and (2) follows by symmetry.
By assumption A=BA′C with B, C∈R×.
Then Lemma 4.6 yields v1,1(A)≥v1,1(A′).
This implies v1,1(A′)<n, and applying Lemma 4.6 to A′=B−1AC−1 yields v1,1(A′)≥v1,1(A).
∎
We are now ready to give a characterization of all atoms of R∙.
Theorem 4.8**.**
Let D be a DVR with quotient field K, n∈N≥2, and
[TABLE]
an Eichler order of level n in M2(K).
An element
[TABLE]
is an atom of R∙ if and only if one of the following holds:
(I)
v(det(A))=1* *(equivalently, v(ad)=1).
2. (II)
v(b)=v(c)=0* and v(a)>0, v(d)>0.*
Proof.
From Lemma 2.5(3) and Lemma 4.3 we already know that A is an atom if it has either of the two stated forms.
Suppose now that A is an atom.
We assume v(det(A))≥2 and show that (2) holds.
By Lemma 4.2 we must have v(b)=v(c)=0.
It remains to show that v(a)>0 and v(d)>0.
Assume to the contrary that v(a)=0.
Then v(d)≥2 and
[TABLE]
Applying Lemma 4.2, we see that the matrix on the right hand side of the equation is not an atom since v(d−ca−1bπn)≥min{v(d),n}≥2.
Thus A, an associate of this matrix, is also not an atom.
The case v(d)=0 follows by symmetry. Thus v(a),v(d)>0.
∎
Note that the only atoms A with v(det(A))>n are those of type (2) with v(a)+v(d)=n.
For this type of atom, the determinant can have arbitrarily large valuation as we have already seen in Lemma 4.4.
The Jacobson radical of R is
[TABLE]
Thus the atoms of type (2) are precisely the ones contained in J(R).
Corollary 4.9**.**
For m∈N0, let R(m)⊂D be a system of representatives for D/πmD.
Every atom of R∙ is right associated to precisely one of the following atoms:
[επm1πnδπm′]*
with 1≤m,m′<n such that m+m′<n, ε∈D×∩R(m′), and δ∈D×∩R(m).*
4. (4)
[επm1πnδπm′]*
with 1≤m,m′<n such that m+m′>n, ε∈D×∩R(n−m), and δ∈D×∩R(n−m′).*
5. (5)
[επm1πn0]*
with 1≤m<n and ε∈D×∩R(n−m).*
6. (6)
[01πnδπm′]*
with 1≤m′<n and δ∈D×∩R(n−m′).*
7. (7)
[01πn0].**
8. (8)
[επm1πn(ε−1+πkδ)πm′]*
with 1≤m,m′<n such that n=m+m′, k∈N0, ε∈D×∩R(m′+k), and δ∈D×∩R(m).*
Proof.
From Lemma 4.7, we can immediately note that if A belongs to class (i) and B belongs to class (j) with i=j, then A is not associated to B.
Let
[TABLE]
be an atom of R∙.
Suppose that U is of type (1).
If v(a)=1 and v(d)=0, then
[TABLE]
Now v(a−bcd−1πn)=v(a)=1 and thus, by dividing the first column by a suitable unit of D×, we see that U is right associated to
[TABLE]
If λ∈R(1) with λ≡bd−1modπD and x∈D with λ=bd−1+πx, then
[TABLE]
so that U is right associated to an atom in class LABEL:*c-atomr:1.
We now show that no two atoms in class LABEL:*c-atomr:1 are right associated to each other.
Let λ∈R(1), e, h∈D× and f, g∈D.
Then
[TABLE]
For this to have the same form as a matrix in class LABEL:*c-atomr:1, we must have g=0, h=1, and subsequently e=1.
Finally, since fπ+λ≡λmodπD, the condition fπ+λ∈R(1) forces f=0.
If v(a)=0 and v(d)=1, then one shows analogously that U is right associated to precisely one atom in class LABEL:*c-atomr:2.
Suppose now that U is an atom of type (2).
That is, v(b)=v(c)=0 and v(a)>0, v(d)>0.
Dividing the columns by suitable units we may, without restriction, assume
[TABLE]
Now let e, h∈D× and f, g∈D.
Then
[TABLE]
This right associate again has the same form as U if and only if 1=e+dg=af+h.
Then ae+gπn=a+g(πn−ad) and fπn+dh=d+f(πn−ad).
Note that πn−ad=−det(U).
Thus,
[TABLE]
with a′, d′∈D is a right associate of U if and only if a′≡amodπv(det(U))D and d′≡dmodπv(det(U))D.
If v(a)+v(d)<n, then v(det(U))=v(a)+v(d), and U is right associated to precisely one of the atoms in class LABEL:*c-atomr:3.
If v(a)+v(d)>n, then v(det(U))=n, and U is right associated to precisely one of the atoms in one of the classes LABEL:*c-atomr:4,c-atomr:5,c-atomr:6,c-atomr:7, depending on whether or not v(a)<n or v(d)<n.
Finally, suppose that n=v(a)+v(d).
Let m=v(a), m′=v(d), and k=v(det(U))−n∈N0.
Then a=επm and d=ε′πm′ with ε, ε′∈D×.
Note that k=v(1−εε′)=v(ε−1−ε′).
Hence ε′=ε−1+πkδ for some δ∈D×.
Since a and d are determined up to congruence modulo πn+k, we can pick ε∈R(n+k−m)=R(m′+k) and δ∈R(n−m′)=R(m).
Thus U is right associated to an atom in class LABEL:*c-atomr:8.
The congruence condition also guarantees that no two atoms listed above are right associated.
∎
Corollary 4.10**.**
Any atom of R∙ is (two-sided) associated to precisely one of
[TABLE]
*or one of the atoms in one of the classes LABEL:c-atomr:3,c-atomr:4,c-atomr:5,c-atomr:6,c-atomr:7,c-atomr:8 of Corollary 4.9.
Proof.
As we have already noted in the proof of Corollary 4.9, atoms listed in the different classes of Corollary 4.9 are not associated.
It is easy to see that all the atoms listed in class LABEL:*c-atomr:1 are left associated.
The same is true for the atoms listed in class LABEL:*c-atomr:2.
For the remaining classes, it can be verified as in the proof of 4.9 that none of the atoms listed are left associated.
Alternatively, one may argue by symmetry using the involution:
If two such atoms U and V are left associated, then −adj(U) and −adj(V) are right associated, and replacing the system of representatives R(m) by −R(m), again of a form as listed.
Thus we conclude U=V.
∎
We now work towards a result on sets of lengths.
For this we need two more preparatory lemmas.
The first technical lemma says that A′∈R∙ is always associated to a matrix in which either all components v2,1(A′), v1,1(A′), v1,2(A′) are of roughly the same magnitude, or all components v2,1(A′), v2,2(A′), v1,2(A′) are of roughly the same magnitude.
Lemma 4.11**.**
Every A′∈R∙ is associated to an element
[TABLE]
satisfying
[TABLE]
Proof.
By Proposition 4.5, beginning with a matrix B∈R∙, we can add a multiple of the second column to the first column, we can add a πn-multiple of the first column to the second column, we can add a multiple of the first row to the second row, and we can add a πn-multiple of the second row to the first row, resulting in a matrix B′∈R∙ that is associated to B.
Since v1,2(A)=v(b)+n, we need to show that A′ can be transformed into A such that
[TABLE]
We proceed to transform A′ as follows.
First, if v1,1(A′)>v1,2(A′), we add the second column to the first one.
Similarly, if v2,2(A′)>v1,2(A′), we add the first row to the second one.
This yields a matrix A1 with v1,1(A1)≤v1,2(A1) and v2,2(A1)≤v1,2(A1).
Now, if v2,1(A1)>min{v1,1(A1),v2,2(A1)}, then, adding either the first row to the second row, or the second column to the first column (depending on which of v1,1(A1) and v2,2(A1) is minimal), yields a matrix A2 with v2,1(A2)≤min{v1,1(A1),v2,2(A1)}≤v1,2(A1).
(If v2,1(A1)≤min{v1,1(A1),v2,2(A1)} we simply set A2=A1.)
Note that min{v1,1(A2),v2,2(A2)}=min{v1,1(A1),v2,2(A1)}, since the minimal value remains unchanged.
Thus A2 satisfies the first two inequalities, that is,
[TABLE]
Now, if v1,1(A2)>v2,1(A2)+n, we add πn times the second row to the first.
Similarly, if v2,2(A2)>v2,1(A2)+n, we add πn times the first column to the second.
The resulting matrix A3 satisfies v1,1(A3)≤v2,1(A3)+n and v2,2(A3)≤v2,1(A3)+n by construction.
Thus A3 satisfies the last inequality.
Since the valuations in the upper-left and the lower-right corner cannot have increased, we have min{v1,1(A3),v2,2(A3)}≤min{v1,1(A2),v2,2(A2)}.
Thus
[TABLE]
Now
[TABLE]
and thus A3 still satisfies the first two inequalities.
If v1,2(A3)≤min{v1,1(A3),v2,2(A3)}+n we are done.
Otherwise, suppose v1,1(A3)=min{v1,1(A3),v2,2(A3)} and v1,1(A3)+n<v1,2(A3). The other case is handled analogously.
We then add πn times the first column to the second column to obtain a matrix A4, which now satisfies all inequalities.
∎
Before considering sets of lengths, we need one final result about the associativity of atoms.
Lemma 4.12**.**
Let U, V∈R∙ be atoms that are not right associated.
Then UR∩VR⊂J(R).
Proof.
If U (respectively V) is an atom of type (2), then U∈J(R) (respectively V∈J(R)) and we are done.
We may now assume that U and V are atoms of type (1).
If two elements U, U′∈R∙ are right associated, then UR=U′R, so it suffices to consider U and V of the form listed in (1) and (2) of Corollary 4.9.
For λ∈D, let
[TABLE]
We have
[TABLE]
and conclude
[TABLE]
Similarly,
[TABLE]
Clearly W1(λ)R∩W2(μ)R⊂J(R) for all λ, μ∈D.
Due to the congruence condition, W1(λ)R∩W1(μ)R⊂J(R) as well as W2(λ)R∩W2(μ)R⊂J(R) for λ, μ∈D with λ≡μmodπD.
∎
Theorem 4.13**.**
Let D be a DVR with quotient field K, n∈N≥2, and
[TABLE]
an Eichler order of level n in M2(K). Let
[TABLE]
(1)
*If v(a)=0 or v(d)=0 *(that is, A∈J(R)), then L(A)={v(det(A))} and ∣Z∗(A)∣=1.
2. (2)
*If v(a)>0 and v(d)>0 *(that is, A∈J(R)), then minL(A)≤n+5.
Proof.
(1)
Suppose v(a)=0; the case v(d)=0 follows by symmetry.
Let A=U1⋯Um with m≥1 and U1, …, Um∈A(R∙).
By Lemma 4.6(1) we have v1,1(Ui)=0 for all i∈[1,m].
Thus each Ui is an atom of type (1), which implies v(det(Ui))=1.
Thus m=v(det(U1))+⋯+v(det(Um))=v(det(A)).
We show ∣Z∗(A)∣=1 by induction on m, the length of the factorization A=U1⋯Um.
For m=0 this is trivially true since A∈R×.
Suppose now m>0 and that the claim has been established for m−1.
Let
[TABLE]
Since A⊂U1R∩V1R and A∈J(R), Lemma 4.12 implies that U1 and V1 are right associated.
Let E1∈R× be such that V1=U1E1.
Then U2⋯Um=(E1V2)V3⋯Vm.
By Lemma 4.6(1), we have v1,1(U2⋯Um)=0.
The induction hypothesis therefore implies U2∗⋯∗Um=E1V2∗V3∗⋯∗Vm.
Moreover,
[TABLE]
(2)
By Lemma 4.11 we may, without restriction, assume
[TABLE]
In particular, we have v(a)≥max{v(b),v(c)} and v(d)≥max{v(b),v(c)}.
Choose m=min{v(c),v(b),v(a)−1,v(d)−1} and consider
[TABLE]
First note that minL(πm)≤2:
The case m=0 is trivial.
For m≥1, Lemma 4.4 implies that there exists an atom U with det(U)=πm.
Then adj(U) is also an atom and πm=Uadj(U).
Now we show that A′ has a factorization of length at most n+3.
Since v(a)≥max{v(b),v(c)} and v(d)≥max{v(b),v(c)}, we have that v(c′)≤1 or v(b′)≤1.
If v(b′)≤1, then v(c′)≤v(b′)+n=n+1.
If v(c′)≤1, then v(b′)≤v(c′)+n=n+1.
Thus, in either case v(b′)+v(c′)+1≤n+3 and it suffices to show that A′ has a factorization of length at most v(b′)+v(c′)+1.
Our choice of m also ensures that v(a′)≥1 and v(d′)≥1.
Since v(b′)≤1 or v(c′)≤1 and both of these two values are bounded by min{v(a′),v(d′)}, we have v(b′)+v(c′)≤min{v(a′),v(d′)}+1≤v(a′)+v(d′).
Suppose first that v(b′)+v(c′)≥v(a′)+v(d′)−1 and set l=min{v(a′),v(b′)}.
Since v(a′)≤v(b′)+v(c′), we have v(a′)−l≤v(c′), and hence
[TABLE]
Now L(B)={v(d′)} by (1).
Thus, A′ has a factorization of length at most v(a′)+v(d′)≤v(b′)+v(c′)+1.
If v(b′)+v(c′)≤v(a′)+v(d′)−2, we can factor out v(b′)+v(c′) atoms of type (1), in a way that ensures that the upper-left and lower-right corners of the remaining matrix still have positive valuations, and also so that the upper-right and lower-left corners have valuation [math].
What remains is therefore an atom of type (2).
This again gives a factorization of A′ of length at most v(b′)+v(c′)+1.
∎
Lemma 4.14**.**
minΔ(R∙)=1.**
Proof.
With
[TABLE]
we have
[TABLE]
where both factors are atoms.
Also,
[TABLE]
where the second factor is an atom, and the first factor has the unique factorization length 2 by Theorem 4.13(1).
Thus L(A)={2,3} and so 1∈Δ(A)⊂Δ(R∙).
∎
From the last two results, it is easy to deduce the factorization-theoretic properties for Eichler orders in M2(K) that we claim in the introduction.
We do so in Section 6 in a more general setting.
5. Non-Eichler orders in M2(K)
In this section we consider the case where D is a DVR, K is its quotient field, and R is a non-Eichler D-order in M2(K).
The main work lies in showing that J(R)∖J(R)2 contains an element z with nr(z)=0 (see Theorem 5.8); from this result the factorization theoretic properties then follow easily.
To show the existence of such an element z, we make use of the fact that every such order R arises as the even Clifford algebra C0(M,q) of a ternary quadratic module (M,q) over D.
A good reference for this result is Chapter 22 of Voight’s book [Voi18].
A correspondence between primitive ternary quadratic forms and Gorenstein orders was established by Brzeziński in [Brz82].
The specific correspondence used here appears in [GL09] and [Voi11].
Let D be a commutative ring and let M be a D-module.
A quadratic form is a map q:M→D satisfying the following:
(i)
q(dx)=d2q(x) for all m∈M, d∈D.
2. (ii)
The map B:M×M→D defined by
[TABLE]
is symmetric and D-bilinear.
The pair (M,q) is referred to as a quadratic module (over D).
Let M be free of rank 3 with basis e1, e2, e3, and equipped with the quadratic form
[TABLE]
where a, b, c, u, v, w∈D.
We refer to (M,q) as a ternary quadratic module.
Its (half-)discriminant is
[TABLE]
The quadratic module (M,q) is nondegenerate if d′(q)=0.
The Clifford algebraC(M,q) of (M,q) is the quotient of the tensor algebra T(M) by the ideal generated by x⊗x−q(x) for x∈M.
It has a basis consisting of elements ei1⋯eir with r∈[0,3] and 1≤i1<⋯<ir≤3.
The Clifford algebra has a Z/2Z-grading and the basis elements ei1⋯eir have degrees corresponding to the parity of their length.
The set of elements with even grading form a subalgebra C0(M,q), the even Clifford algebra of (M,q).
The algebra C0(M,q) is an (associative, unital) D-algebra with basis
[TABLE]
and relations
[TABLE]
This algebra has a standard involution given by i=u−i, j=v−j, and k=w−k.
The reduced norm is nr(x)=xx=xx and the reduced trace is tr(x)=x+x for x∈C0(M,q).
The reduced norm is a quadratic form on C0(M,q).
Its associated bilinear form is B(x,y)=nr(x+y)−nr(x)−nr(y)=tr(xy)=tr(yx) for x, y∈C0(M,q).
In particular, the reduced norm and trace are given by
[TABLE]
and
[TABLE]
We also note that for any x∈C0(M,q),
[TABLE]
We now gather several results in this setting, many of which are well-known at least in some restricted settings.
Lemma 5.1**.**
Let (M,q) be a ternary quadratic module over a commutative domain D.
For x∈C0(M,q) the following statements are equivalent.
(c)⇒(a):
Since x is a zero-divisor in C0(M,q) and C0(M,q) is a torsion-free D-module, we must have xx=xx=nr(x)=0∈D.
It follows that x2=tr(x)x and hence xn=tr(x)n−1x for all n≥1.
Since x is nilpotent, there exists an n≥1 such that tr(x)n−1x=0.
Since C0(M,q) is a torsion-free D-module, this implies tr(x)=0 or x=0, which also implies tr(x)=0.
∎
If (M,q) is a quadratic module and B is the bilinear form associated to q, then M⊥={x∈M:B(x,y)=0}, and the quadratic radical of (M,q) is
[TABLE]
If 2∈D∙, then 2nr(x)=B(x,x) implies radM=M⊥.
Lemma 5.2**.**
Let (V,q) be a ternary quadratic module over a field K.
For A=C0(V,q) we have
[TABLE]
If charK=2, then J(A)=A⊥.
Proof.
Since A is a 4-dimensional K-algebra, it is Artinian and hence the Jacobson radical J(A) is nilpotent.
Let x∈J(A).
Then xy∈J(A) is nilpotent for all y∈A, and hence B(x,y)=tr(xy)=0.
Thus x∈A⊥.
Moreover, since x is nilpotent, nr(x)=0.
Let x∈A⊥ with nr(x)=0.
We show that xA is a nil right ideal, that is, that xy is nilpotent for all y∈A.
Let y∈A.
Then nr(xy)=0 and tr(xy)=tr(xy)=B(x,y)=0.
We conclude that xy is nilpotent.
If charK=2, then A⊥=rad(A,nr).
∎
If (V1,q1) and (V2,q2) are quadratic modules, then (V1⊥V2)⊥=V1⊥⊥V2⊥.
Using this fact along with the following basic result (Lemma 5.3), V⊥ of a quadratic module over a field K can easily be computed from an orthogonal decomposition of V.
We use this in Proposition 5.4.
Lemma 5.3**.**
Let (V,q) be a quadratic module over a field K.
(1)
Let V=Ke1 be 1-dimensional and q(xe1)=ax2 for some a∈K.
Then
[TABLE]
2. (2)
If charK=2, V=Ke1⊕Ke2, and q(xe1+ye2)=ax2+uxy+by2 with a, u, b∈K, then V⊥=0 if u∈K× and V⊥=V if u=0.
Proposition 5.4**.**
Let (V,q) be a ternary quadratic module over a field K, and let e1, e2, e3 be a basis of V.
Let A=C0(V,q).
(1)
Suppose q(xe1+ye2+ze3)=ax2+by2+cz2 with a, b, c∈K×.
(i)
If charK=2, then q is nondegenerate, J(A)=J(A)2=0, and A=A/J(A) is a quaternion algebra over K.
2. (ii)
Suppose charK=2.
Then q is degenerate.
(A)
If bc=y02 and ac=z02 with y0, z0∈K×, then
[TABLE]
2. (B)
If ac, bc are not both squares in K and there exist y0, y1, y2∈K with bcy12+acy22=y02 and (y1,y2)=(0,0)(equivalently, q is isotropic), then
[TABLE]
and J(A)2=0.
3. (C)
If there exist no y0, y1, y2∈K with bcy12+acy22=y02 and (y1,y2)=(0,0)(equivalently, q is anisotropic), then J(A)=0.
In each of these three cases, A/J(A)≅K(bc,bac).
2. (2)
Suppose q(xe1+ye2+ze3)=ax2+by2 with a, b∈K×.
Then q is degenerate.
(i)
If charK=2, then J(A)=⟨i,j⟩K and J(A)2=0.
We have
[TABLE]
Thus A/J(A)≅K⊕K if −ab∈(K×)2 and A/J(A)≅K(−ab) otherwise.
2. (ii)
Suppose charK=2.
(A)
If ab=y02 with y0∈K×, then J(A)=⟨i,j,y0+k⟩K and J(A)2=⟨y0i+bj⟩K=⟨ai+y0j⟩K.
Finally, J(A)3=0.
2. (B)
If ab∈K×∖(K×)2, then J(A)=⟨i,j⟩K and J(A)2=0.
In both cases, A/J(A)≅K(ab)=K(−ab).
3. (3)
Suppose q(xe1+ye2+ze3)=ax2 with a∈K.
Then q is degenerate, J(A)=⟨i,j,k⟩K, and A/J(A)≅K.
We have J(A)2=⟨i⟩K if a∈K× and J(A)2=0 if a=0.
In either case, J(A)3=0.
4. (4)
Suppose charK=2 and q(xe1+ye2+ze3)=ax2+by2+cz2+uyz with a, u∈K× and b, c∈K.
Then q is nondegenerate, J(A)=0, and A=A/J(A) is a quaternion algebra.
5. (5)
Suppose charK=2 and q(xe1+ye2+ze3)=by2+cz2+uyz with u∈K× and b, c∈K.
Then q is degenerate, J(A)=⟨j,k⟩K, and J(A)2=0.
We have
[TABLE]
Thus A/J(A)≅K⊕K if bc=y02+uy0 for some y0∈K, and A/J(A) is a quadratic separable field extension of K otherwise.
Proof.
We first consider LABEL:*p-radres:abc,p-radres:ab,p-radres:a in case charK=2.
Here q(xe1+ye2+ze3)=ax2+by2+cz2 with a, b, c∈K and nr(x0+x1i+x2j+x3k)=x02+bcx12+acx22+abx32.
Since charK=2, Lemma 5.2 implies J(A)=rad(A,nr)=A⊥, which is straightforward to compute.
The claims about J(A)2 and A/J(A) then follow using Eq. 5.1.
Now suppose charK=2.
We again first consider LABEL:*p-radres:abc,p-radres:ab,p-radres:a, that is, q(xe1+ye2+ze3)=ax2+by2+cz2 with a, b, c∈K is diagonal.
Inspection of Eq. 5.1 shows that, due to charK=2, the algebra A is commutative.
(1):
If abc=0, the homomorphism K[X,Y]→A that maps X↦i and Y↦j induces an isomorphism
[TABLE]
(1)((ii))(A):
If bc=y02 and ac=z02 with (y0,z0)∈K, then K[X]/⟨X2+bc⟩≅K[X]/⟨X+y0⟩2 and K[Y]/⟨Y2+ac⟩≅K[Y]/⟨Y+z0⟩2.
Thus
[TABLE]
Since A is commutative and Artinian, J(A) is equal to the nilradical of A.
Thus J(A) is generated by i+y0 and j+z0.
It has a K-basis given by i+y0, j+z0 and (i+y0)(j+z0)=y0z0+z0i+y0j+ck, which can easily be transformed into the claimed basis.
The claims about J(A)2 and J(A)3 follow by direct computation.
LABEL:*p-radres:abc:2,p-radres:abc:3:
Note first that the condition in (1)((ii))(C) implies that ab and bc are non-squares in K.
Moreover, note that, if bc is a non-square, then bcy12+acy22=y02 has a solution with (y1,y2)=(0,0) if and only if ac is a square in K(bc).
(This follows because the squares of K(bc) are precisely the elements of the form z02+bcz12=(z0+bcz1)2 with z0, z1∈K.)
Analogously, if ac is a non-square, then bcy12+acy22=y02 has a solution with (y1,y2)=(0,0) if and only if bc is a square in K(ac).
Suppose now that bc is not a square in K.
Then K[X]/⟨X2+bc⟩≅K(bc) is a (purely inseparable) quadratic field extension of K and
[TABLE]
In case (1)((ii))(B), the element ac is a square in K(bc); explicitly
[TABLE]
Thus, J\big{(}K(\sqrt{bc})[Y]/\langle Y^{2}+ac\rangle\big{)} is generated by the residue class of Y+y2−1y0+y2−1y1bc.
It follows that J(A) is generated by y=y0+y1i+y2j; a K-basis is given by y, iy.
We also note that y2=0, hence J(A)2=0.
In case (1)((ii))(C), the ring A is a biquadratic field extension of K and J(A)=0.
(2):
In this case nr(x0+x1i+x2j+x3k)=x02+abx32 and hence A⊥=A.
Since J(A)={x∈A⊥:nr(x)=0} we have ⟨i,j⟩K=⟨i,j⟩A⊂J(A).
Eq. 5.1 imply
[TABLE]
where k is mapped to X.
The claims follows similarly to the case abc=0.
(3):
Here we have nr(x0+x1i+x2j+x3k)=x02 and hence J(A)=⟨i,j,k⟩K and A/J(A)≅K.
Finally we consider LABEL:*p-radres:abcu,p-radres:bcu where nr(x0+x1i+x2j+x3k)=(x02+ux0x1+bcx12)+a(cx22−ux2x3+bx32).
LABEL:*p-radres:abcu:
If a∈K×, then d′(q)=−au2=0.
Thus q is nondegenerate.
The form q is similar to x2+b′y2+c′z2+yz, and hence A is easily recognized as a quaternion algebra from Eq. 5.1.
It follows that J(A)=0.
LABEL:*p-radres:bcu:
Since a=0, we have A⊥=⟨j,k⟩K.
Since nr vanishes on all of A⊥, it follows that J(A)=⟨j,k⟩K.
From Eq. 5.1 one deduces J(A)2=0 as well as the stated form of A/J(A).
∎
Remark 5.5**.**
If charK=2 and K is perfect, then every element in K is a square, and hence the dyadic case simplifies considerably.
In our later applications, this will correspond to the assumption that all residue fields of characteristic 2 are perfect.
Let D be a DVR, let K be its quotient field, and let R be an order in a quaternion algebra over K.
Let M be a free D-module of rank 3 with basis e1, e2, e3.
There exists a quadratic form q:M→D with d′(q)=0 such that R≅C0(M,q).
(This follows from [Voi11, Theorem B] by specializing to the case of DVRs; alternative see [Voi18, Main Theorem 22.4.1 or Proposition 22.4.2].)
Since similar forms, and thus in particular isometric forms, give rise to isomorphic orders, we may assume that either
[TABLE]
with v(a)≤v(b)≤v(c) and 4abc=0, or charD/πD=2 and
[TABLE]
with a(4bc−u2)=0 and v(u)<v(2b)≤v(2c).
(See [Voi13, Proposition 3.10] or [Kne02, (15.1)].)
Using this and the previous proposition, we make some preliminary structural observations about quaternion orders.
Corollary 5.6**.**
Let D be a DVR, let K be its quotient field, and let R be an order in a quaternion algebra over K.
(1)
R/J(R)* is a finite-dimensional D/πD-algebra and dimD/πDR/J(R)∈{1,2,4}.*
2. (2)
*If dimD/πDR/J(R)=4 *(equivalently, J(R/πR)=0), then R is a maximal order.
3. (3)
If R is not a maximal order, then R/J(R) is commutative.
In particular, J(R/J(R))=R/J(R).
4. (4)
If R is not an Eichler order, then R is a local ring (that is, R/J(R) is a division ring).
Proof.
Let k=D/πD and let B=R/πR.
Then πR⊂J(R) and R/J(R)≅B/J(B) (see [Rei75, Theorem 6.15]).
In particular, R/J(R) is a finite-dimensional k-algebra.
Since R≅C0(M,q) we find that B≅C0(M/πM,q), where q is the reduction of the quadratic form q modulo πD.
Thus we can apply the results of Proposition 5.4 to the k-algebra B.
(1)
The claim about the dimensions follows by inspection of the cases in Proposition 5.4.
(2)
The inclusion πR⊂J(R) together with dimkR/J(R)=dimkR/πR=4 implies J(R)=πR.
Therefore J(R) is invertible and hence R is hereditary by [Rei75, Theorem 39.1].
The only non-maximal hereditary orders are the non-maximal Eichler orders, where R/J(R)≅k⊕k.
Thus R must be maximal.
(3)
If R is not maximal, we must have dimkR/J(R)∈{1,2} by (1) and (2).
Thus R/J(R) is commutative.
(Alternatively, this also follows by inspection from Proposition 5.4.)
Since R/J(R) is commutative and Artinian, the Jacobson radical and the nilradical coincide.
(4)
If R is not an Eichler order, it is in particular not maximal, and hence dimkR/J(R)∈{1,2}.
Thus R/J(R) is isomorphic to k, to k[X]/⟨X2⟩, to k⊕k, or to a quadratic field extension of k.
But R/J(R)≅k[X]/⟨X2⟩ is impossible since R/J(R)=0, and R/J(R)≅k⊕k would imply that R is an Eichler order (see [Brz83, Proposition 2.1]).
Thus R/J(R) is a field.
∎
Proposition 5.7**.**
Let (M,q) be a ternary quadratic module over a commutative domain D.
Suppose d′(q)=0, let R=C0(M,q), and let A=K⊗DC0(M,q) be its quotient ring.
The following statements are equivalent:
(a)
A≅M2(K).
2. (b)
(R,nr)* is isotropic.*
3. (c)
(R0,nr∣R0)* is isotropic, where R0={x∈R:tr(x)=0}=⟨1⟩⊥.*
4. (d)
(M,q)* is isotropic.*
Proof.
Since q is nondegenerate, the ring R is a quaternion order in the quaternion algebra A (see [Voi18, Theorem 22.3.1]).
(a)\ \Rightarrow\(c)\ \Rightarrow\(b) is clear since nr(x)=det(x) for x∈A (a consequence of the uniqueness of the standard involution).
(b)\ \Rightarrow\(a):
Since A is a quaternion algebra, it must be either a division ring or isomorphic to M2(K).
It cannot be the former, because any element x∈R with nr(x)=0 is a zero-divisor.
(c)\ \Leftrightarrow\(d) holds since (R0,d′(q)nr∣R0) and (M,q) are isometric by [Kne02, (6.20)].
∎
With all necessary preliminary results laid out, we now arrive at the main result of this section.
Theorem 5.8**.**
Let D be a DVR with quotient field K, and R a quaternion D-order in M2(K).
(1)
There exists z∈J(R)∖J(R)2 with nr(z)=0.
2. (2)
If R is not an Eichler order 111If R is a non-maximal Eichler order, then the same holds by Lemma 4.4. If R is a maximal order, then R≅M2(D). In this case z=[00π0] satisfies z∈J(R)∖J(R)2.,
then there exists an N∈N0, such that for every n≥N, there exists an atom u∈R∙ with v(nr(u))=2n.
Proof.
(1)
Let M be a free D-module of rank 3 with basis e1, e2, e3.
There exists a quadratic form q:M→D with d′(q)=0 such that R=C0(M,q).
Since isometric forms give rise to isomorphic orders, we may again assume that either
[TABLE]
with v(a)≤v(b)≤v(c) and 4abc=0, or charD/πD=2 and
[TABLE]
with a(4bc−u2)=0 and v(u)<v(2b)≤v(2c).
By assumption, K⊗DR≅M2(K), and thus the quadratic module (M⊗DK,q) is isotropic.
By clearing denominators, we see that also (M,q) is isotropic.
We write q as q(xe1+ye2+ze3)=ax2+by2+cz2+uyz (possibly with u=0).
Since q is isotropic, the same is true for aq(xe1+ye2+ze3)=(ax)2+a(by2+cz2+uyz).
Thus there exist z0, z2, z3∈D such that z02+a(bz32+cz22+uz2z3)=0.
We may also assume min{v(z0),v(z2),v(z3)}=0.
Since v(z0)=0 and v(z2), v(z3)>0 would lead to a contradiction, we must have min{v(z2),v(z3)}=0.
Set z=z0+z2j−z3k∈R, so that nr(z)=0.
This implies that z is a zero-divisor in R.
Since R is not an Eichler order, it is a local ring, and hence z∈J(R).
Note that R/πR≅C0(M/πM,q) where q:M/πM→D/πD is the reduction of q modulo πD.
Since the i-coordinate of z is zero while min{v(z2),v(z3)}=0, inspection of the individual cases for q in Proposition 5.4 shows z+πR∈J(R/πR)2.
Hence z∈J(R)2.
(2)
The classification of orders above implies that any non-Eichler order is a local ring.
It follows that J(R)∙∖J(R)2⊂A(R∙).
Let z be as in (1).
Then nr(πk+z)=nr(πk)+nr(z)+tr(πkz)=π2k+πktr(z) for all k∈N0.
For k≥2, we have πk∈J(R)2 and hence πk+z∈J(R)∖J(R)2.
Therefore πk+z is an atom of R∙.
If tr(z)=0, then v(nr(πk+z))=2k.
Otherwise, v(tr(z)) is constant, and, for large enough k, we find v(nr(πk+z))=k+v(tr(z)).
In particular, by suitable choice of k, we can realize any sufficiently large even value for v(nr(πk+z)).
∎
Corollary 5.9**.**
If R⊂M2(K) is a non-Eichler order and a∈R∙, there exists an M∈N0 such that minL(a)≤M for all a∈R∙.
Proof.
By Lemma 2.6(2), there exists an N1∈N0 such that every x∈R∙ can be written in the form a=π2m+dεu1⋯un with n<N1, m∈N0, d∈{0,1}, ε∈R×, and u1, …, un∈A(R∙).
Let N2∈N0 be the constant from Theorem 5.8(2).
If m≥N2, then there exists u∈A(R∙) such that v(nr(u))=2m, and hence π2m=uuδ for some δ∈D×.
Then
[TABLE]
shows minL(a)≤2+n<2+N1.
If m<N2, then minL(π)≤2 implies minL(a)≤2(2m+d)+n<4N2+2+N1.
Thus the claim holds with M=4N2+1+N1.
∎
From Theorem 5.8 and Corollary 5.9 it is now easy to deduce the factorization-theoretic properties for non-Eichler orders in M2(K) that we claim in the introduction.
We do so in a more general setting in the next section.
6. Putting everything together: Non-complete case
We have so far finished the proof of Theorem 1.1 in the case of orders for which A is a division ring (in Section 3).
We have also treated all non-hereditary orders in M2(K) in Sections 4 and 5 (but not yet derived the final results in these cases).
What is missing is the case where A is a division ring, but A≅M2(K).
To wrap everything up, and to cover this last case, we will first show in this section that the properties in Theorems 4.13, 4.14 and 5.9 carry over from R to R.
In particular, we show that there is a transfer homomorphism from R∙ to R∙.
We then show how to derive Theorem 1.1 from these properties.
We begin with a more general result about isoatomic transfer homomorphisms.
Proposition 6.1**.**
Let H, T be monoids and let φ:H→T be a homomorphism such that
•
φ* is a left divisor homomorphism *(that is, whenever a, b∈H are such that φ(b)∈φ(a)T, then b∈aH),
•
φ(H)T×=T.
Then:
(1)
φ* is an isoatomic transfer homomorphism.*
2. (2)
There exists a unique homomorphism φ∗:Z∗(H)→Z∗(T) satisfying
[TABLE]
for all u∈A(H) and ε∈H×.
We have a commutative diagram
[TABLE]
3. (3)
For every a∈H, the map φ∗∣ZH∗(a):ZH∗(a)→ZT∗(φ(a)) is a bijection and φ∗(Z∗(H))=Z∗(T)T×.
Proof.
(1)
We must show the following:
•
φ−1(T×)⊂H×.
•
If a∈H and if there are s, t∈T such that φ(a)=st, then there exist b, c∈H and ε∈T× such that a=bc, φ(b)=sε−1, and φ(c)=εt.
•
If u, v∈A(H) are such that φ(u) and φ(v) are associated in T, then u and v are associated in H.
Let a∈H with φ(a)∈T×.
Then 1∈φ(a)T, and hence 1∈aH, and a is right invertible.
Since H is cancellative, a∈H×.
Now let a∈H and let s, t∈T be such that φ(a)=st.
By assumption, there exist b∈H and ε∈T× such that s=φ(b)ε.
Then φ(a)∈φ(b)T and so a∈bH.
Let c∈H be such that a=bc.
Then φ(a)=φ(b)φ(c)=sε−1φ(c).
Cancellativity in T implies φ(c)=εt.
If u, v∈A(H) with φ(u)=φ(v) then φ(u)∈φ(v)T and φ(v)∈φ(u)T.
Thus u∈vT and v∈uT, so that u≃v.
(We do not use that u, v are atoms.)
(2)
Since φ is a transfer homomorphism, we have φ(u)∈A(T) for all u∈A(H).
The claims are now straightforward to check using the construction of the monoid of factorizations.
(3)
Let z=εu1∗⋯∗uk, z′=ε′v1∗⋯∗vl∈ZH∗(a) with φ∗(z)=φ∗(z′).
Then k=l and a=εu1⋯uk=ε′v1⋯vk.
If k=0, then ε=ε′ and hence z=z′.
Suppose k>1.
Then there exist δ2, …, δk∈T× and δk+1=1 such that
[TABLE]
Since φ(ε′v1)∈φ(εu1)T, our assumptions also imply ε′v1∈εu1H.
Thus there exists η2∈H× with ε′v1=εu1η2−1.
Note that δ2=φ(η2).
We now define η3, …, ηk inductively so that vi=ηiuiηi+1−1 and φ(ηi)=δi.
This is possible since φ(ηi−1vi)=φ(ui)δi+1−1 implies that there exists ηi+1 as claimed.
Finally, since εu1⋯uk=ε′v1⋯vk=εu1⋯uk−1ηk−1vk, we see vk=ηkuk.
Thus, putting everything together, z=z′.
Now let y=ηv1∗⋯∗vk∈ZT∗(φ(a)).
If k=0, then necessarily, a∈H× and φ∗(a)=φ(a)=η=y.
Suppose k>0.
By assumption, there exists δ2∈T× and u1∈A(H) such that ηv1=φ(u1)δ2−1.
Similarly, for i∈[2,k−1] we inductively choose δi+1∈T× and ui∈A(H) such that δi−1vi=φ(ui)δi+1−1.
It follows that φ(a)=ηv1⋯vk−1vk=φ(u1⋯uk−1)δk−1vk.
Since a∈H and u1⋯uk−1∈H, our assumptions imply that there exists uk∈H with a=u1⋯uk−1uk.
Then, necessarily, φ(uk)=δk−1vk and so uk∈A(H) and φ∗(u1∗⋯∗uk)=y.
To show the final claim, that φ(Z∗(H))T×=Z∗(T), let y∈Z∗(T).
Then πT(y)∈T and hence there exist a∈H and ε∈T× such that πT(y)=φ(a)ε.
Then y∗ε−1∈ZT∗(φ(a)).
By what we have already shown, there exists z∈ZH∗(a) such that φ∗(z)=y∗ε−1.
∎
We now give one final result before concluding with the proof of Theorem 1.1.
Proposition 6.2**.**
Let H be an atomic monoid.
Suppose that there exists an ideal J⊂H(that is, HJ⊂J and JH⊂J) and an N∈N such that:
(1)
If a∈H∖J, then ∣Z∗(a)∣=1.
2. (2)
If k≥N+1, u1, …, uk∈A(H), and u1⋯uk∈J, then there exist l∈[1,N+1] and i∈[1,k−l+1] such that uiui+1⋯ui+l−1∈J.
3. (3)
If a∈J, then minL(a)≤N.
Then cd(H)≤N+1 for any distance d on H and maxΔ(H)≤N−1.
If, in addition, J∩H∖H×=∅, then ρ(H)=∞.
Proof.
Replacing J by J∩H∖H×, we may without restriction assume J⊂H∖H×, since ∣Z∗(a)∣=1 for any a∈H×.
We first show cd(H)≤N+1.
If a∈H∖J, then cd(a)=0 is immediate since a has only one factorization.
We now need to consider a∈J. We first prove the following auxiliary claim.
**Claim : **
If a∈J and z∈Z∗(a), then there exist rigid factorizations z=z0, z1, …, zn∈Z∗(a) with d(zi−1,zi)≤N+1 for all i∈[1,n] and ∣zn∣≤N.
Suppose z∈Z∗(a) and ∣z∣>N.
Then z=u1∗⋯∗uk with atoms ui∈A(H) and k>N.
By (2) there exist l∈[1,N+1] and i∈[1,k−l+1] such that uiui+1⋯ui+l−1∈J.
Since J is an ideal, we may take a longer subproduct if necessary, and assume without restriction l=N+1.
By assumption (3), the product ui⋯ui+N has a factorization of length at most N, that is, there exist m∈[2,N] and v1, …, vm∈A(H) such that ui⋯ui+N=v1⋯vm.
Let
[TABLE]
Then z′ is a factorization of a with d(z,z′)≤N+1 and ∣z′∣<∣z∣.
Iteration proves the claim.
If z1, z2∈Z∗(a), then there exist z1′, z2′∈Z∗(a) with ∣z1′∣≤N, ∣z2′∣≤N and such that there are (N+1)-chains between zi and zi′ for i∈{1,2}.
Since d(z1′,z2′)≤max{∣z1′∣,∣z2′∣}≤N, these two chains can be concatenated to an (N+1)-chain between z1 and z2.
Thus cd(a)≤N+1.
We now show maxΔ(H)≤n−1.
If a∈H∖J, then Δ(a)=∅.
Suppose a∈J and z∈Z∗(H).
If ∣z∣>N we may argue as before and replace N+1 atoms in z by m∈[2,N] new ones.
For the resulting factorization z′, we have ∣z∣−(N−1)≤∣z′∣<∣z∣.
It follows that maxΔ(a)≤N−1.
Finally, we show ρ(H)=∞.
Let a∈J∩H∖H×.
Then minL(ak)≤N while maxL(ak)≥k for any k∈N.
It follows that ρ(ak)≥k/N for any k∈N, and so ρ(H)≥∞.
∎
Remark 6.3**.**
In an atomic monoid H, condition LABEL:*p-shortcat:reqsub with the stronger requirement N=0 is equivalent to J being completely prime.
For commutative monoids, this requirement may be compared to the ω-invariant of J.
Indeed, if H is commutative, we may replace LABEL:*p-shortcat:reqsub by the (weaker but similar) assumption ω(J)≤N+1.
We conclude this manuscript with a proof of Theorem 1.1.
We first show that the natural inclusion homomorphism R∙↪R∙ satisfies the conditions of Proposition 6.1.
Recall that there is a bijection
[TABLE]
Moreover, if I, J are right R-ideals, then I≅J as R-modules if and only if IR∙≅IR∙ as R∙-modules.
(See [CR81, Corollary (30.10) and Proposition (30.17)].)
Let a∈R∙.
Then I=aR∩R is a right R-ideal.
Since IR=aR≅R, we conclude I≅R.
Thus I is a principal right R-ideal and hence there exists a0∈R∙ such that I=a0R.
It follows that aR∙=a0R∙ and thus there exists ε∈R× such that a=a0ε.
Now let a, b∈R∙ and d∈R∙ such that ad=b.
Then d=a−1b∈A×∩R∙=R∙.
In the case that A is a division ring, all claims of Theorem 1.1 have been shown in Theorem 3.1.
We may from now on assume A≅M2(K).
For R∙ we have established in Theorems 4.13 and 5.9 that there exists an N∈N0 (with N=n+5 where n is the level of R if R is an Eichler order), such that:
•
∣Z∗(a)∣=1 for all a∈R∙∖J(R).
•
minL(a)≤N for all a∈J(R).
These properties carry over to R by Proposition 6.1 (note J(R)=J(R) and J(R)∩R=J(R)).
We now show that since R/J(R)≅R/J(R) is either a field or isomorphic to k⊕k with k=D/πD, condition (2) of Proposition 6.2 is also satisfied for N≥1.
First note that u∈R× if and only if u+J(R) is a unit of R/J(R). Indeed, the canonical surjection R→R/J(R) is a ring homomorphism and if uv≡1modJ(R), then 1−uv∈J(R).
Hence uv=1−(1−uv)∈R× and this implies that u∈R×.
We must now show the following: For u1⋯uk∈J(R) with each ui∈A(R), there exists i∈[1,k] such that either ui∈J(R) or uiui+1∈J(R). In the case of interest, R/J(R)≅k⊕k. Let ui denote the image of ui in k⊕k. Since each ui is a non-unit, at least one of the coordinates of each ui is zero. If ui=(0,0) for some i we are done. If not, note that
since u1⋯uk∈J(R) it must be the case that u1⋯uk=(0,0). This means that there exists at least one
um with the first coordinate zero, and at least one un with second coordinate zero. Since each ui must have some coordinate equal to zero, we may assume that either n=m+1 or m=n+1. This proves that condition (2) of Proposition 6.2 is satisfied.
Thus Proposition 6.2 implies claims (1) and (2) of the theorem.
Since Δ(R∙) is finite and ρk(R∙)=∞ for k≥2, the Structure Theorem for Unions of Sets of Lengths holds by [Ger16, Theorem 2.6].
If, in addition, R is an Eichler order, then minΔ(R∙)=1 by Lemma 4.14.
∎
Bibliography27
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[And 97] D. D. Anderson, editor. Factorization in integral domains , volume 189 of Lecture Notes in Pure and Applied Mathematics , New York, 1997. Marcel Dekker Inc.
2[BBG 14] D. Bachman, N. R. Baeth, and J. Gossell. Factorizations of upper triangular matrices. Linear Algebra Appl. , 450:138–157, 2014. URL: http://dx.doi.org/10.1016/j.laa.2014.02.038 , doi:10.1016/j.laa.2014.02.038 . · doi ↗
3[BHL 17] J. P. Bell, A. Heinle, and V. Levandovskyy. On noncommutative finite factorization domains. Trans. Amer. Math. Soc. , 369(4):2675–2695, 2017. doi:10.1090/tran/6727 . · doi ↗
4[BJ 16] N. R. Baeth and J. Jeffries. Factorizations of block triangular matrices. Linear Algebra Appl. , 511:403–420, 2016. doi:10.1016/j.laa.2016.09.012 . · doi ↗
5[Brz 82] J. Brzeziński. A characterization of Gorenstein orders in quaternion algebras. Math. Scand. , 50(1):19–24, 1982.
6[Brz 83] J. Brzeziński. On orders in quaternion algebras. Comm. Algebra , 11(5):501–522, 1983. doi:10.1080/00927878308822861 . · doi ↗
7[BS 15] N. R. Baeth and D. Smertnig. Factorization theory: From commutative to noncommutative settings. J. Algebra , 441:475–551, 2015. ar Xiv:1402.4397 , doi:10.1016/j.jalgebra.2015.06.007 . · doi ↗
8[CFGO 16] S. T. Chapman, M. Fontana, A. Geroldinger, and B. Olberding, editors. Multiplicative Ideal Theory and Factorization Theory . Springer International Publishing, 2016. Commutative and Non-commutative Perspectives. doi:10.1007/978-3-319-38855-7 . · doi ↗