Home Math Yoneda’s lemma as an identification of kind and performance: the case examine of polynomials

Yoneda’s lemma as an identification of kind and performance: the case examine of polynomials

Yoneda’s lemma as an identification of kind and performance: the case examine of polynomials

[ad_1]

As somebody who had a comparatively gentle graduate training in algebra, the import of Yoneda’s lemma in class idea has all the time eluded me considerably; the assertion and proof are easy sufficient, however undoubtedly have the “summary nonsense” taste that one typically ascribes to this a part of arithmetic, and I struggled to attach it to the extra grounded types of instinct, corresponding to these primarily based on concrete examples, that I used to be extra comfy with. There’s a standard MathOverflow submit dedicated to this query, with many solutions that have been useful to me, however I nonetheless felt vaguely dissatisfied. Nevertheless, not too long ago when pondering the very concrete idea of a polynomial, I managed to by chance bump into a particular case of Yoneda’s lemma in motion, which clarified this lemma conceptually for me. In the long run it was a quite simple commentary (and could be extraordinarily pedestrian to anybody who works in an algebraic discipline of arithmetic), however as I discovered this beneficial to a non-algebraist corresponding to myself, and I assumed I might share it right here in case others equally discover it useful.

In algebra we see a distinction between a polynomial kind (also referred to as a formal polynomial), and a polynomial operate, though this distinction is commonly elided in additional concrete purposes. A polynomial kind in, say, one variable with integer coefficients, is a proper expression {P} of the shape

displaystyle  P = a_d {mathrm n}^d + dots + a_1 {mathrm n} + a_0      (1)

the place {a_0,dots,a_d} are coefficients within the integers, and {{mathrm n}} is an indeterminate: a logo that’s typically supposed to be interpreted as an integer, actual quantity, complicated quantity, or component of some extra common ring {R}, however is for now a purely formal object. The gathering of such polynomial varieties is denoted {{bf Z}[{mathrm n}]}, and is a commutative ring.

A polynomial kind {P} might be interpreted in any ring {R} (even non-commutative ones) to create a polynomial operate {P_R : R rightarrow R}, outlined by the system

displaystyle  P_R(n) := a_d n^d + dots + a_1 n + a_0      (2)

for any {n in R}. This definition (2) appears to be like so just like the definition (1) that we often abuse notation and conflate {P} with {P_R}. This conflation is supported by the identification theorem for polynomials, that asserts that if two polynomial varieties {P, Q} agree at an infinite variety of (say) complicated numbers, thus {P_{bf C}(z) = Q_{bf C}(z)} for infinitely many {z}, then they agree {P=Q} as polynomial varieties (i.e., their coefficients match). However this conflation is typically harmful, notably when working in finite attribute. As an example:

The above examples present that if one solely interprets polynomial varieties in a particular ring {R}, then some details about the polynomial might be misplaced (and a few options of the polynomial, corresponding to roots, could also be “invisible” to that interpretation). However this seems to not be the case if one considers interpretations in all rings concurrently, as we will now talk about.

If {R, S} are two completely different rings, then the polynomial capabilities {P_R: R rightarrow R} and {P_S: S rightarrow S} arising from deciphering a polynomial kind {P} in these two rings are, strictly talking, completely different capabilities. Nevertheless, they’re typically carefully associated to one another. As an example, if {R} is a subring of {S}, then {P_R} agrees with the restriction of {P_S} to {R}. Extra typically, if there’s a ring homomorphism {phi: R rightarrow S} from {R} to {S}, then {P_R} and {P_S} are intertwined by the relation

displaystyle  phi circ P_R = P_S circ phi,      (3)

which mainly asserts that ring homomorphism respect polynomial operations. Observe that the earlier commentary corresponded to the case when {phi} was an inclusion homomorphism. One other instance comes from the complicated conjugation automorphism {z mapsto overline{z}} on the complicated numbers, by which case (3) asserts the identification

displaystyle  overline{P_{bf C}(z)} = P_{bf C}(overline{z})

for any polynomial operate {P_{bf C}} on the complicated numbers, and any complicated quantity {z}.

What was stunning to me (as somebody who had not internalized the Yoneda lemma) was that the converse assertion was true: if one had a operate {F_R: R rightarrow R} related to each ring {R} that obeyed the intertwining relation

displaystyle  phi circ F_R = F_S circ phi      (4)

for each ring homomorphism {phi: R rightarrow S}, then there was a novel polynomial kind {P in {bf Z}[mathrm{n}]} such that {F_R = P_R} for all rings {R}. This appeared stunning to me as a result of the capabilities {F} have been a priori arbitrary capabilities, and as an analyst I might not anticipate them to have polynomial construction. However the truth that (4) holds for all rings {R,S} and all homomorphisms {phi} is in reality somewhat highly effective. As an analyst, I’m tempted to proceed by first working with the ring {{bf C}} of complicated numbers and profiting from the aforementioned identification theorem, however this seems to be difficult as a result of {{bf C}} doesn’t “discuss” to all the opposite rings {R} sufficient, within the sense that there usually are not all the time as many ring homomorphisms from {{bf C}} to {R} as one would really like. However there may be in reality a extra elementary argument that takes benefit of a very related (and “talkative”) ring to the speculation of polynomials, particularly the ring {{bf Z}[mathrm{n}]} of polynomials themselves. Given every other ring {R}, and any component {n} of that ring, there’s a distinctive ring homomorphism {phi_{R,n}: {bf Z}[mathrm{n}] rightarrow R} from {{bf Z}[mathrm{n}]} to {R} that maps {mathrm{n}} to {n}, particularly the analysis map

displaystyle  phi_{R,n} colon a_d {mathrm n}^d + dots + a_1 {mathrm n} + a_0 mapsto a_d n^d + dots + a_1 n + a_0

that sends a polynomial kind to its analysis at {n}. Making use of (4) to this ring homomorphism, and specializing to the component {mathrm{n}} of {{bf Z}[mathrm{n}]}, we conclude that

displaystyle  phi_{R,n}( F_{{bf Z}[mathrm{n}]}(mathrm{n}) ) = F_R( n )

for any ring {R} and any {n in R}. If we then outline {P in {bf Z}[mathrm{n}]} to be the formal polynomial

displaystyle  P := F_{{bf Z}[mathrm{n}]}(mathrm{n}),

then this identification might be rewritten as

displaystyle  F_R = P_R

and so we’ve got certainly proven that the household {F_R} arises from a polynomial kind {P}. Conversely, from the identification

displaystyle  P = P_{{bf Z}[mathrm{n}]}(mathrm{n})

legitimate for any polynomial kind {P}, we see that two polynomial varieties {P,Q} can solely generate the identical polynomial capabilities {P_R, Q_R} for all rings {R} if they’re an identical as polynomial varieties. So the polynomial kind {P} related to the household {F_R} is exclusive.

We’ve got thus created an identification of kind and performance: polynomial varieties {P} are in one-to-one correspondence with households of capabilities {F_R} obeying the intertwining relation (4). However this identification might be interpreted as a particular case of the Yoneda lemma, as follows. There are two classes in play right here: the class {mathbf{Ring}} of rings (the place the morphisms are ring homomorphisms), and the class {mathrm{Set}} of units (the place the morphisms are arbitrary capabilities). There may be an apparent forgetful functor {mathrm{Forget}: mathbf{Ring} rightarrow mathbf{Set}} between these two classes that takes a hoop and removes all the algebraic construction, abandoning simply the underlying set. A group {F_R: R rightarrow R} of capabilities (i.e., {mathbf{Set}}-morphisms) for every {R} in {mathbf{Ring}} that obeys the intertwining relation (4) is exactly the identical factor as a pure transformation from the forgetful functor {mathrm{Forget}} to itself. So we’ve got recognized formal polynomials in {{bf Z}[mathbf{n}]} as a set with pure endomorphisms of the forgetful functor:

displaystyle  mathrm{Forget}({bf Z}[mathbf{n}]) equiv mathrm{Hom}( mathrm{Forget}, mathrm{Forget} ).      (5)

Informally: polynomial varieties are exactly these operations on rings which can be revered by ring homomorphisms.

What does this need to do with Yoneda’s lemma? Effectively, keep in mind that each component {n} of a hoop {R} got here with an analysis homomorphism {phi_{R,n}: {bf Z}[mathrm{n}] rightarrow R}. Conversely, each homomorphism from {{bf Z}[mathrm{n}]} to {R} will probably be of the shape {phi_{R,n}} for a novel {n} – certainly, {n} will simply be the picture of {mathrm{n}} underneath this homomorphism. So the analysis homomorphism supplies a one-to-one correspondence between components of {R}, and ring homomorphisms in {mathrm{Hom}({bf Z}[mathrm{n}], R)}. This correspondence is on the degree of units, so this provides the identification

displaystyle  mathrm{Forget} equiv mathrm{Hom}({bf Z}[mathrm{n}], -).

Thus our identification might be written as

displaystyle  mathrm{Forget}({bf Z}[mathbf{n}]) equiv mathrm{Hom}( mathrm{Hom}({bf Z}[mathrm{n}], -), mathrm{Forget} )

which is now clearly a particular case of the Yoneda lemma

displaystyle  F(A) equiv mathrm{Hom}( mathrm{Hom}(A, -), F )

that applies to any functor {F: {mathcal C} rightarrow mathbf{Set}} from a (domestically small) class {{mathcal C}} and any object {A} in {{mathcal C}}. And certainly if one inspects the usual proof of this lemma, it’s basically the identical argument because the argument we used above to determine the identification (5). Extra typically, it appears to me that the Yoneda lemma is commonly used to establish “formal” objects with their “purposeful” interpretations, so long as one concurrently considers interpretations throughout a whole class (such because the class of rings), versus only a single interpretation in a single object of the class by which there could also be some lack of info because of the peculiarities of that particular object. Grothendieck’s “functor of factors” interpretation of a scheme, mentioned in this earlier weblog submit, is one typical instance of this.

[ad_2]

LEAVE A REPLY

Please enter your comment!
Please enter your name here