← LibraryThe Degree of a Differential Operator | KEVOS® MathematicsProject Delivery · Project ManagementLesson 55/72← PrevNext →
ArticlePublished 9 Aug 202622 min readBy Kevin Jogin
Skip to content
KEVOS® Engineering · Mathematics Knowledge Library

EngineeringMathematicsCore

The Degree of a Differential Operator

Every operator DAn has a degree, read off from its canonical form. The two facts that make it useful are deg(DD)=deg(D)+deg(D) and deg[D,D]deg(D)+deg(D)2: multiplication behaves as in a polynomial ring, and the failure of commutativity is confined to strictly lower degree.

Collection Algebraic D-modulesTopic stream ideal-structureSource Ch. 2 §1Reading time 25 minPage ID KVS-ENG-MATH-0334

Overview

The whole of the ideal theory of the Weyl algebra rests on a single numerical invariant: the degree of an operator. Because every DAn has a unique canonical form D=cαβxαβ, we may define deg(D) to be the largest value of |α|+|β| over the monomials that actually occur. The definition is unambiguous exactly because the canonical monomials are a basis.

What makes the invariant powerful is not the definition but two estimates. First, degree is additive on products: deg(DD)=deg(D)+deg(D), exactly as for polynomials over a field. Second, and this is the genuinely noncommutative statement, the commutator loses two degrees: deg[D,D]deg(D)+deg(D)2.

Together these say that An is a polynomial ring to leading order. The failure of commutativity is real, but it is always hidden two degrees below the top. That single sentence is the engine behind almost everything in this chapter: additivity gives that P1 is a domain and that its only units are the non-zero scalars, while the commutator estimate lets you take an element of a two-sided ideal and manufacture a strictly smaller one, which is how simplicity is proved.

Later in the collection the same degree is rebranded as the Bernstein filtration, and the two estimates become the statements that grAn is a commutative polynomial ring in 2n variables and that the induced bracket on it is a Poisson bracket. This page proves the estimates from scratch; nothing beyond the canonical form is assumed.

Definition

Throughout, K is a field of characteristic zero and An=An(K) is the n-th Weyl algebra, generated by x1,,xn and 1,,n subject to [i,xj]=δij and [xi,xj]=[i,j]=0. We use multi-index notation: xα=x1α1xnαn, β=1β1nβn, and |α|=α1++αn.

Degree of an operatorCoutinho, Ch. 2 §1

Let DAn have canonical form D=α,βcαβxαβ with cαβK, only finitely many non-zero. The degree of D is

deg(D)=max{|α|+|β|:cαβ0},

with the convention deg(0)=. Equivalently, deg(D)m if and only if D lies in the span of the monomials xαβ with |α|+|β|m.

Why the pair (α,β) is one multi-index

A pair (α,β)n×n is itself a multi-index in 2n, and |α|+|β| is its length. So the degree treats the 2n generators x1,,xn,1,,n perfectly symmetrically, each contributing 1. This is the choice that distinguishes the degree from the order of an operator, which gives the xi weight 0 and the i weight 1.

A first computation

In A2, the operator D=x121+x1x2322 is already in canonical form. Its first summand has |α|+|β|=2+1=3 and its second has 4+2=6, so deg(D)=6. The convention deg(0)= is what makes the two estimates below hold without exceptions.

Core Concepts

Three ideas explain why the degree behaves as it does, and it is worth separating them before the proofs.

The canonical form is what makes the degree well defined

There is no such thing as "the degree of an expression". The operator xx looks like a difference of two degree-2 terms, but it equals 1 and has degree 0. The definition is only meaningful because the canonical monomials really are linearly independent; you must normalise before you read a degree off.

Reordering costs exactly two degrees

The single relation ixi=xii+1 replaces a degree-2 monomial by another degree-2 monomial plus a degree-0 correction. Every reordering in the Weyl algebra is built from repeated use of that relation, so every reordering produces a leading term of the same degree plus corrections of degree at least two lower. This is the whole content of the commutator estimate, and it is why the constant 2 appears rather than 1.

To leading order the algebra is commutative

Assign to each D of degree m its leading symbol: replace i by a commuting variable ξi and keep only the terms with |α|+|β|=m. The result is a non-zero homogeneous polynomial σm(D)K[x1,,xn,ξ1,,ξn]. The two estimates combine into the single statement σm+m(DD)=σm(D)σm(D): taking symbols is multiplicative, and multiplicativity of symbols plus the fact that a polynomial ring is a domain is precisely additivity of degree.

Construction and Proof

Statement (2.1) is immediate: adding two canonical forms is adding coefficients, so no new monomial can appear, and if the two degrees differ the top monomials of the larger one survive untouched. The real work is (2.2) and (2.3), and they are proved together.

The commutator identities

In any ring, [ab,c]=a[b,c]+[a,c]b and [a,bc]=[a,b]c+b[a,c]. Both are one-line expansions: a(bccb)+(acca)b=abccab=[ab,c].

Reordering estimateCoutinho (2.1.1), proof

For all multi-indices α,βn, deg[β,xα]|α|+|β|2. Consequently deg(βxα)=|α|+|β|.

Proof of the reordering estimate

Induct on |α|+|β|. If α=0 or β=0 the commutator is zero and there is nothing to prove. Otherwise pick i with βi1 and write β=iβei. The first commutator identity gives

[β,xα]=i[βei,xα]+[i,xα]βei.

For the second summand, [i,xα]=xα/xi is a polynomial of degree |α|1 (or zero), so that summand has degree at most (|α|1)+(|β|1)=|α|+|β|2.

For the first summand, the inductive hypothesis bounds deg[βei,xα] by |α|+|β|3, and left multiplication by i raises degree by at most 1 - which needs only the trivial half of (2.2), that a product of a degree-1 and a degree-d element lies in degree d+1, and that is clear from writing out the canonical form. So this summand has degree at most |α|+|β|2 as well.

Now βxα=xαβ+[β,xα]. The first term is a canonical monomial of degree exactly |α|+|β| and the second has strictly smaller degree, so by the equality case of (2.1) the sum has degree exactly |α|+|β|.

Degree of a product and of a commutatorCoutinho (2.1.1)

For all D,DAn: deg(DD)=deg(D)+deg(D) and deg[D,D]deg(D)+deg(D)2.

Proof

First take monomials D=xαβ and D=xγδ. Substituting (2.4) for βxγ,

DD=xαβxγδ=xα+γβ+δ+xαPδ,deg(P)|β|+|γ|2.

The correction term xαPδ has degree at most |α|+|β|+|γ|+|δ|2=deg(D)+deg(D)2, so the canonical monomial xα+γβ+δ is the unique top-degree contribution and deg(DD)=deg(D)+deg(D).

For general D,D, write D=Dk+R and D=Dl+R, where Dk collects the terms of top degree k=deg(D), Dl those of top degree l=deg(D), and deg(R)<k, deg(R)<l. Expanding, every product except DkDl has degree <k+l. By the monomial case, the degree-(k+l) part of DkDl is obtained by multiplying the symbols: it is the image of σk(D)σl(D) under ξii. Since K[x,ξ] is a polynomial ring over a field, hence a domain, that product is non-zero. Therefore deg(DD)=k+l.

The same expansion applied to DD produces the same top-degree part, because σl(D)σk(D)=σk(D)σl(D) in the commutative ring K[x,ξ]. Subtracting, the top-degree parts of DD and DD cancel, leaving

[D,D]=(DDx-ξtoppart)(DDx-ξtoppart),

a difference of two operators of degree at most k+l2. Hence deg[D,D]deg(D)+deg(D)2.

Where the exponent 2 comes from

Coutinho proves (2.2) and (2.3) by a single simultaneous induction on deg(D)+deg(D). The route above splits the induction off into the reordering lemma and then finishes with the symbol map, which is the same argument reorganised so that the role of the polynomial ring K[x,ξ] is visible. Either way the drop of exactly 2 traces back to [i,xi]=1: two degree-1 generators produce a degree-0 commutator.

Key Equations

The three properties of the degree, in the form in which they are used:

deg(D+D)max{deg(D),deg(D)},
(2.1)

with equality whenever deg(D)deg(D).

deg(DD)=deg(D)+deg(D),
(2.2)
deg[D,D]deg(D)+deg(D)2.
(2.3)

The computational heart of the proof is the commutation of a pure derivative past a pure monomial:

βxα=xαβ+P,deg(P)|α|+|β|2.
(2.4)

In the one-variable case (2.4) can be made completely explicit by the Leibniz rule; for fK[x],

kf=j=0k(kj)djfdxjkj,
(2.5)

in which the j=0 term is fk and every later term has dropped j in derivative order while dropping at least j in polynomial degree - a loss of at least 2 once j1.

Counting the canonical monomials of degree at most m gives the dimension of the corresponding filtration piece:

dimK{DAn:deg(D)m}=(2n+m2n).
(2.6)

Variable Definitions

K
the ground field, of characteristic zero
An
the n-th Weyl algebra over K
xi,i
the generators of An, satisfying [i,xj]=δij
α,β
multi-indices in n, with |α|=α1++αn
xαβ
a canonical monomial; the set of all of them is a K-basis of An
deg(D)
the degree of D: the largest |α|+|β| occurring in its canonical form
ei
the multi-index with 1 in position i and 0 elsewhere
[D,D]
the commutator DDDD
σm(D)
the leading symbol: the degree-m part of D with i replaced by a commuting variable ξi
Bm
the space of operators of degree at most m, the m-th piece of the Bernstein filtration

Properties and Behaviour

The consequences below are all immediate from (2.2), and they are the reason the degree is introduced at this point in the theory rather than later.

The Weyl algebra is a domainCoutinho (2.1.2)

If D,D0 then deg(D),deg(D)0, so deg(DD)=deg(D)+deg(D)0> and DD0. The details, including what fails in characteristic p, are on the domain page.

The units of An are the non-zero scalars

If DD=1 then deg(D)+deg(D)=0; since neither degree is negative for a non-zero operator, both are 0, so DK×. In particular every non-constant operator generates a proper non-zero left ideal, so An is very far from a division ring even though it has no proper non-zero two-sided ideals.

Lowering degree inside a two-sided ideal

Let DAn with deg(D)=k>0. Then at least one of the 2n commutators [xi,D], [i,D] is non-zero, and every non-zero one among them has degree at most k1. Indeed, if all of them vanished, D would lie in the centre of An, which is K, forcing k=0. This is exactly the step that drives the proof of simplicity: from a minimal-degree element of a non-zero two-sided ideal you produce a smaller one.

The degree defines a filtration

Writing Bm={D:deg(D)m}, the estimates say BiBjBi+j and [Bi,Bj]Bi+j2, with mBm=An and dimKBm=(2n+m2n)<. This is the Bernstein filtration, and the second inclusion is precisely the statement that the associated graded algebra grAnK[x1,,xn,ξ1,,ξn] is commutative.

Worked Example

Product and commutator of two cubics in A1

  1. Step 1 - put both operators in canonical form

    Take D=x2 and E=2x. The first is already canonical, with deg(D)=3. The second is not. Using [2,x]=[,x]+[,x]=2,

    E=2x=x2+2,

    so deg(E)=3 as well. Sanity check on a test function: 2(xf)=xf+2f, which is exactly (x2+2)(f).

  2. Step 2 - compute the product DE

    Only one reordering is needed, x=x+1:

    DE=x2(x2+2)=x2(x+1)2+2x22=x33+3x22.

    The top term is x33, of degree 6=3+3, confirming (2.2).

  3. Step 3 - compute the product ED

    Here two reorderings are needed. From 2(x2f)=x2f+4xf+2f we get 2x2=x22+4x+2, and x2=x2+2x. Hence

    ED=x2x2+2x2=x(x22+4x+2)+2(x2+2x),
    ED=x33+4x22+2x+2x22+4x=x33+6x22+6x.

    Again the degree is 6, and the top term x33 is identical to the one in DE, exactly as the proof predicts.

  4. Step 4 - subtract and read the commutator degree

    Subtracting the two canonical forms term by term:

    [D,E]=(x33+3x22)(x33+6x22+6x)=3x226x.

    So deg[D,E]=4=3+32. The bound (2.3) is attained, not merely satisfied.

  5. Step 5 - cross-check with the symbol calculus

    The leading symbols are σ3(D)=x2ξ and σ3(E)=xξ2. The bracket induced on symbols by the commutator is the Poisson bracket {f,g}=i(f/ξi)(g/xi)(f/xi)(g/ξi). Here

    {x2ξ,xξ2}=x2ξ22xξ2xξ=3x2ξ2,

    and the degree-4 part of [D,E] computed in Step 4 is 3x22, whose symbol is 3x2ξ2. The two agree, which is a genuine independent check on the arithmetic of Steps 2 and 3.

Result

DE=x33+3x22 and ED=x33+6x22+6x, both of degree 6=deg(D)+deg(E); and [D,E]=3x226x of degree 4=deg(D)+deg(E)2. Both estimates hold, and both are sharp for this pair.

Applications and Industry Use

In a mathematics topic, this section covers downstream use inside mathematics, computing and engineering rather than a manufactured product.

Within this collection the degree is used, in order of appearance:

Outside the collection, degree bounds are the standard complexity measure for algorithms over the Weyl algebra. In creative telescoping and in Gröbner basis computation for D-ideals, the running time is controlled by the degree of the intermediate operators, and every practical implementation carries a degree bound as its main loop condition.

Computational Notes

Read this as the manufacturing section of the template: how the object is actually built by machine, at what cost, and where the computation stops being decidable.

Computing a degree is trivial once the canonical form is known; the cost is entirely in the normalisation. A dense operator of degree m in An has (2n+m2n) coefficients, so representations are usually sparse dictionaries keyed by the pair (α,β).

  1. Normalise. Rewrite the input as a linear combination of canonical monomials by repeatedly applying ixj=xji+δij, always moving x's left. Termination follows because each application strictly decreases the number of inversions of the word.
  2. Prune. Discard monomials whose coefficient has become zero. This step is essential: skipping it can only make the reported degree too large, and for exact rational coefficients the test is exact.
  3. Read off. Take the maximum of |α|+|β| over the surviving monomials.

In a computer algebra system the normalisation is done for you. Macaulay2's Dmodules package and Singular's dmod.lib both represent Weyl algebra elements in canonical form and expose the weight vector; setting all 2n weights to 1 recovers the degree of this page, while setting the x-weights to 0 recovers the order. Sage's DifferentialWeylAlgebra uses the same normal form. Gröbner basis computations in An are performed with respect to a chosen weight vector, so the choice made here is a genuine input to an algorithm and not merely a matter of exposition.

A practical note: because degree is additive, degree bounds propagate exactly through products but only weakly through sums and commutators. When bounding the degree of an expression built by repeated bracketing - as happens in the simplicity proof - the drop of 2 per bracket is what guarantees termination, and an implementation that only records the weak bound deg(D)+deg(D) will fail to terminate.

Limits of Validity

Two hypotheses are doing work here, and one apparent hypothesis is not.

  • The canonical form must exist. The degree is defined via the basis {xαβ}. Everything on this page therefore depends on the proof that this set is a basis, which is where the infinite-dimensionality of K[X] is used.
  • Additivity needs K[x,ξ] to be a domain, i.e. K must be a domain - a field is more than enough. But (2.2) does not need characteristic zero. In A1(p) presented by generators and relations, degree is still additive and the algebra is still a domain; what fails in characteristic p is simplicity, not the degree calculus. See the positive characteristic page.
  • Degree does not generalise to arbitrary rings of differential operators. For a general smooth affine variety X there is no canonical way to give the coordinate functions weight 1, so 𝒟(X) has an order filtration but no intrinsic Bernstein filtration. Statements about An proved using the degree must be re-proved, not merely restated, in that setting.

What (2.3) does not say

The estimate is an inequality and is often strict by a wide margin. For instance [x1k,x2k]=0, so the left side is while the right side is 2k2. Equality holds exactly when the Poisson bracket of the two leading symbols is non-zero, which is a computable condition but not an automatic one.

Failure Modes and Common Mistakes

Reading a degree off a non-canonical expression

The commonest error. xx presents as a difference of degree-2 terms but equals 1, of degree 0. Similarly 2xx2 presents as degree 3 but equals 2, of degree 1. A degree read before normalisation is only ever an upper bound. When an argument needs an exact degree - and the simplicity proof does - normalise first.

Confusing degree with order

The operator x100 has degree 101 and order 1. Statements such as "operators of degree 0 are the constants" are true for degree and false for order, where the order-zero operators are all of K[X]. If a source says "filtration" without qualification in this subject, check which weighting is meant before quoting a bound.

Expecting the commutator to drop by two in every filtration

The drop of 2 in (2.3) is specific to the Bernstein weighting. With the order filtration the correct drop is 1, and with the mixed weightings used in Gröbner computations the drop can be 0, in which case the associated graded ring is not commutative. Do not import the constant 2 into a different filtration.

Assuming a degree-k operator has an inverse of degree k

There is no such thing. Degrees are non-negative on non-zero operators, so (2.2) forces the only invertible elements to be the non-zero constants. In particular x has no inverse in A1: to invert it you must pass to a localisation such as A1[x1], which is a strictly larger ring. This is the point at which intuition from K[x,x1] or from the ring Bn(K) of operators with rational function coefficients breaks down.

Historical Notes

The degree in this form is the elementary shadow of a much older idea. The estimate deg[D,D]deg(D)+deg(D)2 is the algebraic form of the fact, familiar from quantum mechanics since the 1920s, that the commutator of two operators corresponds to i times the Poisson bracket of their classical symbols: one power of is exactly the two degrees lost here. Hermann Weyl's 1928 book on group theory and quantum mechanics made the algebra generated by position and momentum a formal object, which is why it carries his name.

The systematic use of a total-degree filtration in which x and both have weight 1 is due to Joseph Bernstein, in his 1971 and 1972 papers on the analytic continuation of complex powers. It is now universally called the Bernstein filtration, and its decisive advantage over the classical order filtration is (2.6): each piece is finite dimensional over K, so Hilbert function arguments become available and lead to Bernstein's inequality.

That the two-sided ideal structure of An can be settled by degree bookkeeping alone was known much earlier - it appears in Dirac's and Littlewood's work on the algebra of quantum observables in the 1930s, and in a fully algebraic form in Dixmier's 1968 study of A1, which classified the automorphisms and posed what is now the Dixmier conjecture.

Comparison

The Weyl algebra carries two standard size measures and they are not interchangeable. Both are used in this collection; the pages state which one is in force.

Degree (Bernstein weighting) versus order (order weighting) on An.
Degree deg(D)Order ord(D)
Weight of xi10
Weight of i11
Value on x1001011
Filtration piecesfinite dimensional over Kinfinite dimensional over K, finitely generated over K[X]
dimK of the m-th piece(2n+m2n)infinite
Additive on productsyesyes
Commutator drop21
Associated graded ringK[x,ξ], 2n variablesK[x,ξ], 2n variables
Generalises to 𝒟(X)no (needs the grading of affine space)yes

The commutator drop is the sharpest difference. Under the order filtration [i,xi]=1 costs only one unit of order, so the estimate reads ord[D,D]ord(D)+ord(D)1. Proofs written for one filtration therefore do not transfer verbatim to the other; see the order filtration page.

Key Takeaways

Key takeaways

  • The degree of DAn is the largest |α|+|β| occurring in its canonical form, with deg(0)=. It is only defined after normalisation.
  • Degree is additive on products: deg(DD)=deg(D)+deg(D). This holds because leading symbols multiply in the polynomial ring K[x,ξ], which is a domain.
  • Commutators drop two degrees: deg[D,D]deg(D)+deg(D)2. The constant 2 comes from [i,xi]=1, a degree-0 bracket of two degree-1 generators.
  • Immediate consequences: An is a domain, and its only units are the non-zero elements of K.
  • The commutator estimate is the tool that shrinks elements of a two-sided ideal, and hence proves simplicity.
  • Degree is not order. Degree gives xi and i equal weight 1; order gives xi weight 0. Their filtration pieces, and their commutator drops, differ.
  • The sublevel sets Bm form the Bernstein filtration, with dimKBm=(2n+m2n) and commutative associated graded ring.

FAQs

Why is deg(0) set to rather than 0 or left undefined?

So that (2.1) and (2.2) hold with no case distinctions. With deg(0)= we get deg(0D)==+deg(D), and deg(D+(D))=max{degD,degD}. Setting deg(0)=0 would break additivity, and leaving it undefined would force an exception into every statement.

Does the degree depend on the order in which I write x's and 's in a monomial?

No, for a single monomial. The reordering lemma shows deg(βxα)=|α|+|β|=deg(xαβ), and the same holds for any interleaving. What does depend on the presentation is the degree of a sum, because cancellation of top terms can only be detected in canonical form.

Is the bound deg[D,D]deg(D)+deg(D)2 ever an equality?

Yes, often. The worked example above achieves it: [x2,2x]=3x226x has degree 4=3+32. The general criterion is that equality holds precisely when the Poisson bracket {σ(D),σ(D)} of the leading symbols is non-zero, since that bracket is the symbol of the top-degree part of the commutator.

Does additivity of degree require characteristic zero?

No. The proof uses only that K[x,ξ] has no zero divisors, which holds over any field. The Weyl algebra defined by generators and relations over p is still a domain with additive degree. Characteristic zero is needed for simplicity and for the centre to be K, not for the degree calculus. The other presentation of An in positive characteristic, as operators on p[x], is a different and badly behaved ring.

How does the degree relate to the Bernstein filtration and to dimension theory?

They are the same object seen twice. Bm is the set of operators of degree at most m; (2.2) says BiBjBi+j and (2.3) says the associated graded ring is commutative. Once modules are filtered compatibly, dimK of the pieces becomes a Hilbert function, its degree is d(M) and Bernstein's inequality bounds it below by n.

Why can I not just define the degree as the smallest m with DBm?

You can - that is an equivalent definition, and it is arguably the better one because it makes no reference to a presentation. The two agree exactly because the canonical monomials form a basis, so the span of those with |α|+|β|m contains D if and only if all higher coefficients of D vanish.

Does every operator of degree k generate a left ideal that meets every degree below k?

No, and this is a useful check on intuition. The left ideal A1 contains no non-zero operator of degree 0, since a non-zero constant in A1 would make invertible. What is true is the two-sided statement used for simplicity: a non-zero two-sided ideal contains elements of every sufficiently large degree and, by iterated bracketing, a non-zero constant.

References

  1. S. C. Coutinho, A Primer of Algebraic D-modules, London Mathematical Society Student Texts 33, Cambridge University Press, 1995 - Ch. 2 §1, Theorem (2.1.1) and Corollary (2.1.2).
  2. S. C. Coutinho, A Primer of Algebraic D-modules, Ch. 1 §2, Proposition (1.2.1) - the canonical basis, on which the definition of degree depends.
  3. I. N. Bernstein, Modules over a ring of differential operators. Study of the fundamental solutions of equations with constant coefficients, Functional Analysis and Its Applications 5 (1971), 89-101 - introduces the total-degree filtration used here.
  4. J. Dixmier, Sur les algèbres de Weyl, Bulletin de la Société Mathématique de France 96 (1968), 209-242 - degree arguments for A1, units and automorphisms.
  5. J.-E. Björk, Rings of Differential Operators, North-Holland Mathematical Library 21, 1979 - Ch. 1, filtrations and symbol calculus on An.
  6. J. C. McConnell and J. C. Robson, Noncommutative Noetherian Rings, revised edition, American Mathematical Society, 2001 - Ch. 1 and Ch. 8, filtered and graded rings, the Weyl algebra as the model example.
  7. S. P. Smith, Differential operators on commutative algebras, in Ring Theory (Antwerp 1985), Lecture Notes in Mathematics 1197, Springer, 1986 - the positive characteristic picture.
  8. ISO 80000-2:2019, Quantities and units - Part 2: Mathematics - notation for multi-indices, factorials and binomial coefficients.
  9. Macaulay2 Dmodules package documentation, and Singular dmod.lib - weight vectors and normal forms for elements of An.

AI Suggested Questions

  • Show me the full simultaneous induction that Coutinho uses to prove additivity of degree and the commutator estimate at the same time.
  • Work out the canonical form and degree of (x)k in A1 for small k.
  • Give an example of two operators in A2 for which the commutator estimate is strict rather than sharp, and explain why.
  • How does the degree filtration compare with the order filtration on the ring of differential operators of a smooth affine curve?
  • Prove that the centre of An is K using only the degree and the commutator estimate.
  • What degree bounds control the cost of a Gröbner basis computation in An?
  • Explain the relation between the two-degree drop in the commutator and the appearance of in the semiclassical limit.

Continue learning

A Roadmap Through Algebraic D-module Theory | KEVOS® MathematicsArticle · Project ManagementAutomorphisms of the Weyl Algebra | KEVOS® MathematicsArticle · Project ManagementBernstein's Inequality | KEVOS® MathematicsArticle · Project ManagementCanonical Form of an Element of the Weyl Algebra | KEVOS® MathematicsArticle · Project Management