Math 2.0

K-theory Definition

Lambda-ring

Builds on Commutative ringElementary symmetric polynomialPolynomial ring

Definition

Let RR be a commutative ring with 11, and let λn ⁣:R→R\lambda^n \colon R \to R for n≥0n \ge 0 be maps. Write λt(x)=∑n≥0λn(x)tn∈R[ ⁣[t] ⁣]\lambda_t(x) = \sum_{n \ge 0} \lambda^n(x) t^n \in R[\![t]\!]. The pair (R,(λn))(R, (\lambda^n)) is a lambda-ring if for all x,y∈Rx, y \in R and m,n≥1m, n \ge 1:

  1. λ0(x)=1\lambda^0(x) = 1 and λ1(x)=x\lambda^1(x) = x.
  2. λt(x+y)=λt(x)λt(y)\lambda_t(x + y) = \lambda_t(x) \lambda_t(y), that is, λn(x+y)=∑i=0nλi(x)λn−i(y)\lambda^n(x + y) = \sum_{i=0}^{n} \lambda^i(x) \lambda^{n-i}(y).
  3. λt(1)=1+t\lambda_t(1) = 1 + t.
  4. λn(xy)=Pn(λ1(x),…,λn(x),λ1(y),…,λn(y))\lambda^n(xy) = P_n(\lambda^1(x), \ldots, \lambda^n(x), \lambda^1(y), \ldots, \lambda^n(y)).
  5. λm(λn(x))=Pm,n(λ1(x),…,λmn(x))\lambda^m(\lambda^n(x)) = P_{m,n}(\lambda^1(x), \ldots, \lambda^{mn}(x)).

Here PnP_n and Pm,nP_{m,n} are the universal polynomials with integer coefficients defined as follows. Take variables ξ1,…,ξN\xi_1, \ldots, \xi_N and η1,…,ηN\eta_1, \ldots, \eta_N with NN large, and let eke_k be the elementary symmetric polynomials. Then Pn(e1(ξ),…,en(ξ),e1(η),…,en(η))P_n(e_1(\xi), \ldots, e_n(\xi), e_1(\eta), \ldots, e_n(\eta)) is the coefficient of tnt^n in ∏i,j(1+ξiηjt)\prod_{i,j} (1 + \xi_i \eta_j t). And Pm,n(e1(ξ),…,emn(ξ))P_{m,n}(e_1(\xi), \ldots, e_{mn}(\xi)) is the coefficient of tmt^m in ∏i1<⋯<in(1+ξi1⋯ξint)\prod_{i_1 < \cdots < i_n} (1 + \xi_{i_1} \cdots \xi_{i_n} t).

A ring with maps satisfying only clauses 1 and 2 is a pre-lambda-ring.

Remarks

Example: ℤ\Z with λn(k)=(kn)\lambda^n(k) = \binom{k}{n} is a lambda-ring. Clause 2 is Vandermonde's identity (k+ln)=∑i(ki)(ln−i)\binom{k + l}{n} = \sum_i \binom{k}{i} \binom{l}{n-i}, and λt(k)=(1+t)k\lambda_t(k) = (1 + t)^k.

Example: for a scheme XX, the K-group K0(X)K_0(X) of vector bundles with λn[E]=[ΛnE]\lambda^n[E] = [\Lambda^n E] is a lambda-ring. The same holds for the representation ring of a group, with exterior powers of representations.

Non-example: ℤ\Z with λ0=1\lambda^0 = 1, λ1=id⁡\lambda^1 = \id and λn=0\lambda^n = 0 for n≥2n \ge 2 fails clause 2. Indeed clause 2 would force λ2(1+1)=λ1(1)λ1(1)=1\lambda^2(1 + 1) = \lambda^1(1) \lambda^1(1) = 1, not 00.

An element xx with λt(x)=1+xt\lambda_t(x) = 1 + xt is a line element; the class of a line bundle is one. Clauses 4 and 5 say that the λn\lambda^n behave on products and composites as they do on sums of line elements, by the splitting principle. Some authors call a pre-lambda-ring a lambda-ring, and a lambda-ring in the sense above a special lambda-ring.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Commutative ring concept
  2. Elementary symmetric polynomial concept
  3. Polynomial ring concept
  4. Lambda-ring definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Λ-ring
About this page
Tag4HJT57DSKX
URIm2://4HJT57DSKX
Kinddefinition
WritingW0 stub
MSC19L20, 13D15, 19E08
DefinesLambda-ring
UsesCommutative ring, Elementary symmetric polynomial, Polynomial ring
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.