<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Felix&#039; Math Place &#187; partial Hasse derivatives</title>
	<atom:link href="http://math.fontein.de/tag/partial-hasse-derivatives/feed/" rel="self" type="application/rss+xml" />
	<link>http://math.fontein.de</link>
	<description>Focussed on, but not limited to Computational Number Theory</description>
	<lastBuildDate>Sat, 30 Jul 2011 12:35:49 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
		<item>
		<title>The Hasse derivative, part II: Multivariate partial Hasse derivatives.</title>
		<link>http://math.fontein.de/2009/10/02/the-hasse-derivative-part-ii-multivariate-partial-hasse-derivatives/</link>
		<comments>http://math.fontein.de/2009/10/02/the-hasse-derivative-part-ii-multivariate-partial-hasse-derivatives/#comments</comments>
		<pubDate>Fri, 02 Oct 2009 19:47:27 +0000</pubDate>
		<dc:creator>Felix Fontein</dc:creator>
				<category><![CDATA[Algebra]]></category>
		<category><![CDATA[Analysis]]></category>
		<category><![CDATA[Hasse derivative]]></category>
		<category><![CDATA[Identity Theorem]]></category>
		<category><![CDATA[Leibniz rule]]></category>
		<category><![CDATA[partial derivatives]]></category>
		<category><![CDATA[partial Hasse derivatives]]></category>
		<category><![CDATA[Taylor's formula]]></category>

		<guid isPermaLink="false">http://math.fontein.de/?p=474</guid>
		<description><![CDATA[Following a <a href="http://math.fontein.de/2009/08/12/the-hasse-derivative/comment-page-1/#comment-57">suggestion</a> by A. Maevskiy, we show how the Hasse derivative can be extended to partial Hasse derivative in arbitrary multivariate polynomial rings. We show multivariate versions of Taylor's Formula, of the Identity Theorem, and of the Generalized Leibnitz Rule.]]></description>
			<content:encoded><![CDATA[<p>Let <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' /> be a commutative unitary ring, and let <img src='http://math.fontein.de/wp-content/latex/ffb/ffb269941821deca3084d23b1814e263-T-000000-0.png' alt='x_i, i \in I' title='x_i, i \in I' class='latex-inline' /> be a family of indeterminates over <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' />. We consider the polynomial ring <img src='http://math.fontein.de/wp-content/latex/95c/95cbce21c74e0324c449d2de39ae62d6-T-000000-0.png' alt='S = R[\{ x_i \mid i \in I \}]' title='S = R[\{ x_i \mid i \in I \}]' class='latex-inline' />, obtained from <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' /> by adjoining all indeterminates <img src='http://math.fontein.de/wp-content/latex/ffb/ffb269941821deca3084d23b1814e263-T-000000-0.png' alt='x_i, i \in I' title='x_i, i \in I' class='latex-inline' />. The two most used examples are <img src='http://math.fontein.de/wp-content/latex/21f/21fe457379b805871ad062b18c2a9a6a-T-000000-0.png' alt='I = \{ \bullet \}' title='I = \{ \bullet \}' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/889/88988dee5afc10ec6322a90bb19020ea-T-000000-0.png' alt='S = R[x]' title='S = R[x]' class='latex-inline' />, and <img src='http://math.fontein.de/wp-content/latex/734/734444acb9e9851ad2f6edee214d925e-T-000000-0.png' alt='I = \{ 1, \dots, n \}' title='I = \{ 1, \dots, n \}' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/a34/a344ea0a84595e039f00d74f029ee37c-T-000000-0.png' alt='S = R[x_1, \dots, x_n]' title='S = R[x_1, \dots, x_n]' class='latex-inline' />. (Note that if we use finitely many polynomials <img src='http://math.fontein.de/wp-content/latex/c4f/c4f4fc5c4bc4445f01f7c8bc75fe9c3c-T-000000-0.png' alt='f_1, \dots, f_r' title='f_1, \dots, f_r' class='latex-inline' />, there exist a finite subset <img src='http://math.fontein.de/wp-content/latex/c9e/c9e8bceea88e4423dfc41fd1b1d4780c-T-000000-0.png' alt='J \subset I' title='J \subset I' class='latex-inline' /> such that <img src='http://math.fontein.de/wp-content/latex/d70/d70882ffb97ee0c71654fb8ed69d848c-T-000000-0.png' alt='f_1, \dots, f_r \in R[\{ x_j \mid j \in J \}]' title='f_1, \dots, f_r \in R[\{ x_j \mid j \in J \}]' class='latex-inline' />, i.e. it suffices to consider finitely many variables.)</p>

<p>In classical analysis, one defines the partial derivative by fixing all variables but one, and then using the classical one-dimensional derivative. This can be done similarly in the case of <a href="http://math.fontein.de/forward.php?r=http://math.fontein.de/2009/08/12/the-hasse-derivative/">Hasse derivatives</a>. Given <img src='http://math.fontein.de/wp-content/latex/048/0480c7ca01d301a310b5963cdcaef5e3-T-000000-0.png' alt='f \in S' title='f \in S' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/6fa/6fa78e29473bdce53401e1c2158c3eca-T-000000-0.png' alt='i \in I' title='i \in I' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/3d7/3d7874217e6e86d23f3676fd9e3b3d41-T-000000-0.png' alt='s \in R^I' title='s \in R^I' class='latex-inline' />, we can define <img src='http://math.fontein.de/wp-content/latex/6ad/6ad76dc1b8aa52a42d2d8437c74468d9-T-000000-0.png' alt='f_i(s) = f|_{x_j = s(j) \text{ for } j \neq i}' title='f_i(s) = f|_{x_j = s(j) \text{ for } j \neq i}' class='latex-inline' />, which is an element of <img src='http://math.fontein.de/wp-content/latex/fa4/fa438a0cd821faf8022ef96378e98910-T-000000-0.png' alt='R[x_i]' title='R[x_i]' class='latex-inline' />. Then <img src='http://math.fontein.de/wp-content/latex/97d/97dfcaea2e84f0f31c55123227ea3658-T-000000-0.png' alt='D^{(k)} f_i(s)' title='D^{(k)} f_i(s)' class='latex-inline' /> is another element of <img src='http://math.fontein.de/wp-content/latex/fa4/fa438a0cd821faf8022ef96378e98910-T-000000-0.png' alt='R[x_i]' title='R[x_i]' class='latex-inline' />, whence we can define <img src='http://math.fontein.de/wp-content/latex/51d/51d5d581311f7012d50644a5b54027db-T-000000-0.png' alt='D^{(k)}_{x_i} f(s) := (D^{(k)} f_i(s))|_{x_i = s(i)} = (D^{(k)} f_i(s))(s(i))' title='D^{(k)}_{x_i} f(s) := (D^{(k)} f_i(s))|_{x_i = s(i)} = (D^{(k)} f_i(s))(s(i))' class='latex-inline' />. This gives a function <img src='http://math.fontein.de/wp-content/latex/47b/47b1f244f0eac4fb1239ef1f54447dcf-T-000000-0.png' alt='\displaystyle  D^{(k)}_{x_i} f : R^I \to R, \quad s \mapsto D^{(k)}_{x_i} f(s), ' title='\displaystyle  D^{(k)}_{x_i} f : R^I \to R, \quad s \mapsto D^{(k)}_{x_i} f(s), ' class='latex-displaystyle' /> which can be considered as the <i><img src='http://math.fontein.de/wp-content/latex/8ce/8ce4b16b22b58894aa86c421e8759df3-T-000000-0.png' alt='k' title='k' class='latex-inline' />-th partial Hasse derivative of <img src='http://math.fontein.de/wp-content/latex/8fa/8fa14cdd754f91cc6554c9e71929cce7-T-000000-0.png' alt='f' title='f' class='latex-inline' /> with respect to <img src='http://math.fontein.de/wp-content/latex/1ba/1ba8aaab47179b3d3e24b0ccea9f4e30-T-000000-0.png' alt='x_i' title='x_i' class='latex-inline' /></i>. Now we would like the derivative to be another element of <img src='http://math.fontein.de/wp-content/latex/5db/5dbc98dcc983a70728bd082d1a47546e-T-000000-0.png' alt='S' title='S' class='latex-inline' />. In classical analysis, polynomial functions are in bijection to polynomials, and one can show using certain rules that the partial derivative of a polynomial is again a polynomial. In case <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' /> is an arbitrary ring, one has in general no longer the bijection between polynomials and polynomial functions.</p>

<p>In the case of derivatives over arbitrary rings, we have the advantage that we can naturally identify <img src='http://math.fontein.de/wp-content/latex/5db/5dbc98dcc983a70728bd082d1a47546e-T-000000-0.png' alt='S' title='S' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/956/9564247c943b8f42a3e09e131e83e6bd-T-000000-0.png' alt='R_i[x_i]' title='R_i[x_i]' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/563/563838097dca12d0871581e3193bd83d-T-000000-0.png' alt='R_i := R[\{ x_j \mid j \in I, j \neq i \}]' title='R_i := R[\{ x_j \mid j \in I, j \neq i \}]' class='latex-inline' />; here, <img src='http://math.fontein.de/wp-content/latex/c42/c42952440ffcf8129a1bedeac4773415-T-000000-0.png' alt='R_i' title='R_i' class='latex-inline' /> is another commutative unitary ring. Now <img src='http://math.fontein.de/wp-content/latex/956/9564247c943b8f42a3e09e131e83e6bd-T-000000-0.png' alt='R_i[x_i]' title='R_i[x_i]' class='latex-inline' /> is a univariate polynomial ring, whence we have the <a href="http://math.fontein.de/forward.php?r=http://math.fontein.de/2009/08/12/the-hasse-derivative/">usual Hasse derivative</a>. Denote the <img src='http://math.fontein.de/wp-content/latex/8ce/8ce4b16b22b58894aa86c421e8759df3-T-000000-0.png' alt='k' title='k' class='latex-inline' />-th Hasse derivative <img src='http://math.fontein.de/wp-content/latex/45a/45a0dd277dad675a4a347bfd68ce3026-T-000000-0.png' alt='D^{(k)} : R_i[x_i] \to R_i[x_i]' title='D^{(k)} : R_i[x_i] \to R_i[x_i]' class='latex-inline' /> by <img src='http://math.fontein.de/wp-content/latex/94f/94f0097ebb2ef93560907c9521ac432b-T-000000-0.png' alt='D^{(k)}_{x_i}' title='D^{(k)}_{x_i}' class='latex-inline' />; then we obtain an <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' />-linear (in fact, <img src='http://math.fontein.de/wp-content/latex/c42/c42952440ffcf8129a1bedeac4773415-T-000000-0.png' alt='R_i' title='R_i' class='latex-inline' />-linear) operator <img src='http://math.fontein.de/wp-content/latex/f0d/f0d5a1cd667da95a46522519414af723-T-000000-0.png' alt='D^{(k)}_{x_i} : S \to S' title='D^{(k)}_{x_i} : S \to S' class='latex-inline' />. In fact, if we evaluate <img src='http://math.fontein.de/wp-content/latex/d20/d202464c3db3add6412a73eb1b1021af-T-000000-0.png' alt='D^{(k)} f' title='D^{(k)} f' class='latex-inline' /> at a point <img src='http://math.fontein.de/wp-content/latex/3d7/3d7874217e6e86d23f3676fd9e3b3d41-T-000000-0.png' alt='s \in R^I' title='s \in R^I' class='latex-inline' />, we obtain the same value as <img src='http://math.fontein.de/wp-content/latex/a8f/a8f60e2e4583ebaf7cbdb8248c9da067-T-000000-0.png' alt='D^{(k)} f(s)' title='D^{(k)} f(s)' class='latex-inline' /> defined above. We will prove this in a minute; before that we will prove a more general result on <img src='http://math.fontein.de/wp-content/latex/94f/94f0097ebb2ef93560907c9521ac432b-T-000000-0.png' alt='D^{(k)}_{x_i}' title='D^{(k)}_{x_i}' class='latex-inline' />.</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
Let <img src='http://math.fontein.de/wp-content/latex/fd4/fd4938ff93de8ea21969b019944314c6-T-000000-0.png' alt='\varphi : R \to R&#039;' title='\varphi : R \to R&#039;' class='latex-inline' /> be a homomorphism of unitary commutative rings <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/e7d/e7df32a1c68b30bea84a21f5867910b5-T-000000-0.png' alt='R&#039;' title='R&#039;' class='latex-inline' /> (i.e. it additionally satisfies <img src='http://math.fontein.de/wp-content/latex/129/129b1df0aa68f7cdab5e685eb4bc5b29-T-000000-0.png' alt='\varphi(1_R) = 1_{R&#039;}' title='\varphi(1_R) = 1_{R&#039;}' class='latex-inline' />). If <img src='http://math.fontein.de/wp-content/latex/9dd/9dd4e461268c8034f5c8564e155c67a6-T-000000-0.png' alt='x' title='x' class='latex-inline' /> is an indeterminate over <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/e7d/e7df32a1c68b30bea84a21f5867910b5-T-000000-0.png' alt='R&#039;' title='R&#039;' class='latex-inline' />, and <img src='http://math.fontein.de/wp-content/latex/3ac/3ac9ee75348b18c4c61823f3fc5e2398-T-000000-0.png' alt='\varphi^* : R[x] \to R&#039;[x]' title='\varphi^* : R[x] \to R&#039;[x]' class='latex-inline' /> the natural continuation of <img src='http://math.fontein.de/wp-content/latex/875/87567e37a1fe699fe1c5d3a79325da6f-T-000000-0.png' alt='\varphi' title='\varphi' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/f94/f9495f18fc59a2c7d6c2b08169d97169-T-000000-0.png' alt='\varphi^*(x) = x' title='\varphi^*(x) = x' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/49b/49b907b01dd6abcf90f40040a9e6301d-T-000000-0.png' alt='\varphi^*(r) = \varphi(r)' title='\varphi^*(r) = \varphi(r)' class='latex-inline' /> for all <img src='http://math.fontein.de/wp-content/latex/b9b/b9b92c1571fae89040982523167bdcae-T-000000-0.png' alt='r \in R' title='r \in R' class='latex-inline' />, then for <img src='http://math.fontein.de/wp-content/latex/672/67272ed7a06957da1ac0041d2ace19cb-T-000000-0.png' alt='f \in R[x]' title='f \in R[x]' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/719/719aa88873cf73831268a53a2015962b-T-000000-0.png' alt='\displaystyle  D^{(k)} \varphi^*(f) = \varphi^*(D^{(k)} f). ' title='\displaystyle  D^{(k)} \varphi^*(f) = \varphi^*(D^{(k)} f). ' class='latex-displaystyle' />
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
This follows directly from the definition of the Hasse derivative: if <img src='http://math.fontein.de/wp-content/latex/8e7/8e75156e4c5b3b4abcab16bb8afafac7-T-000000-0.png' alt='f = \sum_{i=0}^n a_i x^i \in R[x]' title='f = \sum_{i=0}^n a_i x^i \in R[x]' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/791/79179570fc2a8bc07d8f0ee1a9c32747-T-000000-0.png' alt='k \in \N' title='k \in \N' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/161/16175f8c94ca9263b08bb3dc30b83090-T-000000-0.png' alt='\varphi^*(D^{(k)} f) ={} &amp; \varphi^*\biggl( \sum_{i=k}^n \binom{i}{k} a_i x^{i - k} \biggr) \\ {}={} &amp; \sum_{i=k}^n \binom{i}{k} \varphi(a_i) x^{i - k} = D^{(k)} \varphi^*(f).' title='\varphi^*(D^{(k)} f) ={} &amp; \varphi^*\biggl( \sum_{i=k}^n \binom{i}{k} a_i x^{i - k} \biggr) \\ {}={} &amp; \sum_{i=k}^n \binom{i}{k} \varphi(a_i) x^{i - k} = D^{(k)} \varphi^*(f).' class='latex-displaystyle' />
</div><div class='proofqed'>□</div></blockquote>

<blockquote class='theorem'><div class='theoremtitle'>Corollary.</div> <div class='theoremmain'>
For all <img src='http://math.fontein.de/wp-content/latex/048/0480c7ca01d301a310b5963cdcaef5e3-T-000000-0.png' alt='f \in S' title='f \in S' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/3d7/3d7874217e6e86d23f3676fd9e3b3d41-T-000000-0.png' alt='s \in R^I' title='s \in R^I' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/150/150b3775fbd1d08522072490113fd02b-T-000000-0.png' alt='(D^{(k)}_{x_i} f)(s) = D^{(k)} f(s)' title='(D^{(k)}_{x_i} f)(s) = D^{(k)} f(s)' class='latex-inline' />.
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Let <img src='http://math.fontein.de/wp-content/latex/698/69813184485ac146ff210c4adb856637-T-000000-0.png' alt='\varphi : R_i \to R' title='\varphi : R_i \to R' class='latex-inline' /> be the substitution homomorphism <img src='http://math.fontein.de/wp-content/latex/df3/df3f37000571b22e639c81ca18d999c7-T-000000-0.png' alt='f \mapsto f|_{x_j = s(j) \text{ for } j \neq i}' title='f \mapsto f|_{x_j = s(j) \text{ for } j \neq i}' class='latex-inline' />. We interpret <img src='http://math.fontein.de/wp-content/latex/8fa/8fa14cdd754f91cc6554c9e71929cce7-T-000000-0.png' alt='f' title='f' class='latex-inline' /> as an element of <img src='http://math.fontein.de/wp-content/latex/956/9564247c943b8f42a3e09e131e83e6bd-T-000000-0.png' alt='R_i[x_i]' title='R_i[x_i]' class='latex-inline' />; note that the above defined <img src='http://math.fontein.de/wp-content/latex/59b/59bdf0ba696e13164c5a926386f23cb0-T-000000-0.png' alt='f_i' title='f_i' class='latex-inline' /> equals <img src='http://math.fontein.de/wp-content/latex/01b/01bd3576838d356ad673a5423a7ca2bf-T-000000-0.png' alt='\varphi^*(f)' title='\varphi^*(f)' class='latex-inline' />. Then, by the proposition, <img src='http://math.fontein.de/wp-content/latex/39f/39f9ba8189417db9d279ddc1ed3f9f85-T-000000-0.png' alt='\displaystyle  D^{(k) }\varphi^*(f) = \varphi^*(D^{(k)} f) = \varphi^*(D^{(k)}_{x_i} f). ' title='\displaystyle  D^{(k) }\varphi^*(f) = \varphi^*(D^{(k)} f) = \varphi^*(D^{(k)}_{x_i} f). ' class='latex-displaystyle' /> Now <img src='http://math.fontein.de/wp-content/latex/6bf/6bf6e63961cd76b893ca35d5cae1d1f7-T-000000-0.png' alt='\varphi^*(D^{(k)}_{x_i} f)|_{x_i = s(i)} = (D^{(k)}_{x_i} f)(s)' title='\varphi^*(D^{(k)}_{x_i} f)|_{x_i = s(i)} = (D^{(k)}_{x_i} f)(s)' class='latex-inline' />, whence <img src='http://math.fontein.de/wp-content/latex/223/2238f710880178ab1bc4be7de2035b97-T-000000-0.png' alt='\displaystyle  (D^{(k)}_{x_i} f)(s) = (D^{(k)} \varphi^*(f))|_{x_i = s(i)} = (D^{(k)} f_i)|_{x_i = s(i)} = D^{(k)}_{x_i} f(s) ' title='\displaystyle  (D^{(k)}_{x_i} f)(s) = (D^{(k)} \varphi^*(f))|_{x_i = s(i)} = (D^{(k)} f_i)|_{x_i = s(i)} = D^{(k)}_{x_i} f(s) ' class='latex-displaystyle' /> by definition of <img src='http://math.fontein.de/wp-content/latex/624/624a57a092cc06e7180daddf2025b8ea-T-000000-0.png' alt='D^{(k)}_{x_i} f(s)' title='D^{(k)}_{x_i} f(s)' class='latex-inline' />.
</div><div class='proofqed'>□</div></blockquote>

<p>Hence, the following definition makes sense:</p>

<blockquote class='theorem'><div class='theoremtitle'>Definition.</div> <div class='theoremmain'>
The <img src='http://math.fontein.de/wp-content/latex/c42/c42952440ffcf8129a1bedeac4773415-T-000000-0.png' alt='R_i' title='R_i' class='latex-inline' />-linear opeator <img src='http://math.fontein.de/wp-content/latex/f0d/f0d5a1cd667da95a46522519414af723-T-000000-0.png' alt='D^{(k)}_{x_i} : S \to S' title='D^{(k)}_{x_i} : S \to S' class='latex-inline' /> is called the <i><img src='http://math.fontein.de/wp-content/latex/8ce/8ce4b16b22b58894aa86c421e8759df3-T-000000-0.png' alt='k' title='k' class='latex-inline' />-th partial Hasse derivative with respect to <img src='http://math.fontein.de/wp-content/latex/1ba/1ba8aaab47179b3d3e24b0ccea9f4e30-T-000000-0.png' alt='x_i' title='x_i' class='latex-inline' /></i>.
</div></blockquote>

<p>As in the case of usual partial derivatives (in the case of &ldquo;nice&rdquo; functions, i.e. the partial derivatives are continuous in a neighborhood of the point we are interested in), the Hasse derivatives commute:</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
Let <img src='http://math.fontein.de/wp-content/latex/cd1/cd1f249233b49224703fdaaca05b92f9-T-000000-0.png' alt='i, j \in I' title='i, j \in I' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/b70/b7097d3de61c33f634bd3490f5a1c052-T-000000-0.png' alt='k, \ell \in \N' title='k, \ell \in \N' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/048/0480c7ca01d301a310b5963cdcaef5e3-T-000000-0.png' alt='f \in S' title='f \in S' class='latex-inline' />. Then <img src='http://math.fontein.de/wp-content/latex/921/921c230388d2e24f0f38f4eb624c5a69-T-000000-0.png' alt='D^{(k)}_{x_i} D^{(\ell)}_{x_j} f = D^{(\ell)}_{x_j} D^{(k)}_{x_i} f' title='D^{(k)}_{x_i} D^{(\ell)}_{x_j} f = D^{(\ell)}_{x_j} D^{(k)}_{x_i} f' class='latex-inline' />.
</div></blockquote>

<p>For this, consider the notation <img src='http://math.fontein.de/wp-content/latex/0b9/0b92ec2692307424738f442b9997de3f-T-000000-0.png' alt='R_{i,j} = R[\{ t \in I \mid t \neq i, j \}]' title='R_{i,j} = R[\{ t \in I \mid t \neq i, j \}]' class='latex-inline' />; then <img src='http://math.fontein.de/wp-content/latex/36b/36b1b1873a8679a3b6bdd70c1178656c-T-000000-0.png' alt='S = R_{i,j}[x_i, x_j] = R_{i,j}[x_j][x_i] = R_{i,j}[x_i][x_j]' title='S = R_{i,j}[x_i, x_j] = R_{i,j}[x_j][x_i] = R_{i,j}[x_i][x_j]' class='latex-inline' />.</p>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
By <img src='http://math.fontein.de/wp-content/latex/d71/d71e09b1238cd7dca7f3e9457509a9ea-T-000000-0.png' alt='R_{i,j}' title='R_{i,j}' class='latex-inline' />-linearity of <img src='http://math.fontein.de/wp-content/latex/94f/94f0097ebb2ef93560907c9521ac432b-T-000000-0.png' alt='D^{(k)}_{x_i}' title='D^{(k)}_{x_i}' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/522/522cf8759d4445855891f7608265eead-T-000000-0.png' alt='D^{(\ell)}_{x_j}' title='D^{(\ell)}_{x_j}' class='latex-inline' />, it suffices to show the result for <img src='http://math.fontein.de/wp-content/latex/1fd/1fd698b48982def14eab1da3bb9eb746-T-000000-0.png' alt='f = x_i^s x_j^t' title='f = x_i^s x_j^t' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/a05/a051d27fba46800152af128be3c4d06c-T-000000-0.png' alt='s, t \in \N' title='s, t \in \N' class='latex-inline' />. Now <img src='http://math.fontein.de/wp-content/latex/17b/17be72615c80d81b9b1870df144f6de1-T-000000-0.png' alt='D^{(k)}_{x_i} D^{(\ell)}_{x_j} f ={} &amp; D^{(k)}_{x_i} \binom{t}{\ell} x_i^s x_j^{t - \ell} = \binom{s}{k} \binom{t}{\ell} x_i^{s - k} x_j^{t - \ell} \\ {}={} &amp; D^{(\ell)}_{x_j} \binom{s}{k} x_i^{s - k} x_j^t = D^{(\ell)}_{x_j} D^{(k)}_{x_i} f.' title='D^{(k)}_{x_i} D^{(\ell)}_{x_j} f ={} &amp; D^{(k)}_{x_i} \binom{t}{\ell} x_i^s x_j^{t - \ell} = \binom{s}{k} \binom{t}{\ell} x_i^{s - k} x_j^{t - \ell} \\ {}={} &amp; D^{(\ell)}_{x_j} \binom{s}{k} x_i^{s - k} x_j^t = D^{(\ell)}_{x_j} D^{(k)}_{x_i} f.' class='latex-displaystyle' />
</div><div class='proofqed'>□</div></blockquote>

<p>Now, let us define the following notation. We let <img src='http://math.fontein.de/wp-content/latex/fe1/fe1f70b8f09dae602ce5b8f7c35fe107-T-000000-0.png' alt='\N^{(I)}' title='\N^{(I)}' class='latex-inline' /> be the set of functions <img src='http://math.fontein.de/wp-content/latex/af2/af2185daa9fd9a8b6c58e329ddd3e148-T-000000-0.png' alt='I \to \N' title='I \to \N' class='latex-inline' /> which are zero for all but finitely many elements of <img src='http://math.fontein.de/wp-content/latex/dd7/dd7536794b63bf90eccfd37f9b147d7f-T-000000-0.png' alt='I' title='I' class='latex-inline' />. In case <img src='http://math.fontein.de/wp-content/latex/dd7/dd7536794b63bf90eccfd37f9b147d7f-T-000000-0.png' alt='I' title='I' class='latex-inline' /> is finite, <img src='http://math.fontein.de/wp-content/latex/f6c/f6c3a45b7edd9cbb27442743af81cb61-T-000000-0.png' alt='\N^{(I)} = \N^I' title='\N^{(I)} = \N^I' class='latex-inline' /> in the usual sense. The set <img src='http://math.fontein.de/wp-content/latex/fe1/fe1f70b8f09dae602ce5b8f7c35fe107-T-000000-0.png' alt='\N^{(I)}' title='\N^{(I)}' class='latex-inline' /> will be the set of multiindices we use. For <img src='http://math.fontein.de/wp-content/latex/e0f/e0f3fc48516104d53cb85003af0bf4b8-T-000000-0.png' alt='s \in \N^{(I)}' title='s \in \N^{(I)}' class='latex-inline' />, define <img src='http://math.fontein.de/wp-content/latex/1a0/1a0ccc9a6d3d8fa9a3906850fe245651-T-000000-0.png' alt='D^{(s)} : S \to S' title='D^{(s)} : S \to S' class='latex-inline' /> by <img src='http://math.fontein.de/wp-content/latex/e15/e15288485a07d327fa5b40db70ef8bce-T-000000-0.png' alt='D^{(s)} := D^{(s(i_1))}_{x_{i_1}} \circ \dots \circ D^{(s(i_t))}_{x_{i_t}}' title='D^{(s)} := D^{(s(i_1))}_{x_{i_1}} \circ \dots \circ D^{(s(i_t))}_{x_{i_t}}' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/13e/13e66a00aff22b205c78c87a38cf6040-T-000000-0.png' alt='\{ i_1, \dots, i_t \} \subseteq I' title='\{ i_1, \dots, i_t \} \subseteq I' class='latex-inline' /> is the support of <img src='http://math.fontein.de/wp-content/latex/03c/03c7c0ace395d80182db07ae2c30f034-T-000000-0.png' alt='s' title='s' class='latex-inline' />. By the above proposition, <img src='http://math.fontein.de/wp-content/latex/09b/09b43f491b952c167d32ed9501ac6c9a-T-000000-0.png' alt='D^{(s)}' title='D^{(s)}' class='latex-inline' /> is independent of the order of <img src='http://math.fontein.de/wp-content/latex/4c5/4c57c1ab469948c085b1bd841dc2c58c-T-000000-0.png' alt='i_1, \dots, i_t' title='i_1, \dots, i_t' class='latex-inline' />, and as <img src='http://math.fontein.de/wp-content/latex/ec5/ec59657d860b1d18f093d41e572349be-T-000000-0.png' alt='D^{(0)}_{x_i} = \id_S' title='D^{(0)}_{x_i} = \id_S' class='latex-inline' />, we can also include elements outside the support. We sometimes use the more suggestive notation <img src='http://math.fontein.de/wp-content/latex/979/979b59707a9f0d4c3512151844892221-T-000000-0.png' alt='\displaystyle  D^{(s)} = \prod_{i \in I} D^{(s(i))}_{x_i}, ' title='\displaystyle  D^{(s)} = \prod_{i \in I} D^{(s(i))}_{x_i}, ' class='latex-displaystyle' /> which is hence also justified. Moreover, for <img src='http://math.fontein.de/wp-content/latex/e0f/e0f3fc48516104d53cb85003af0bf4b8-T-000000-0.png' alt='s \in \N^{(I)}' title='s \in \N^{(I)}' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/183/1834a6bbc51f9ea03711fe6e2b560cb9-T-000000-0.png' alt='\lambda \in R^I' title='\lambda \in R^I' class='latex-inline' />, define <img src='http://math.fontein.de/wp-content/latex/134/134b152b60192b711c10494f6fbc78e4-T-000000-0.png' alt='(x - \lambda)^s := \prod_{j=1}^t (x_j - \lambda(j))^{s(j)} \in S' title='(x - \lambda)^s := \prod_{j=1}^t (x_j - \lambda(j))^{s(j)} \in S' class='latex-inline' />. Again, this is well-defined. Using this notation, we obtain Taylor&#8217;s formula:</p>

<blockquote class='theorem'><div class='theoremtitle'>Theorem (Taylor formula).</div> <div class='theoremmain'>
For <img src='http://math.fontein.de/wp-content/latex/048/0480c7ca01d301a310b5963cdcaef5e3-T-000000-0.png' alt='f \in S' title='f \in S' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/183/1834a6bbc51f9ea03711fe6e2b560cb9-T-000000-0.png' alt='\lambda \in R^I' title='\lambda \in R^I' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/4ce/4ce39bec6e948f6162c4b96f47babf3c-T-000000-0.png' alt='\displaystyle  f = \sum_{s \in \N^{(I)}} (D^{(s)} f)(\lambda) (x - \lambda)^s. ' title='\displaystyle  f = \sum_{s \in \N^{(I)}} (D^{(s)} f)(\lambda) (x - \lambda)^s. ' class='latex-displaystyle' />
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
By the <img src='http://math.fontein.de/wp-content/latex/e1e/e1e1d3d40573127e9ee0480caf1283d6-T-000000-0.png' alt='R' title='R' class='latex-inline' />-linearity of the equality, it suffices to consider <img src='http://math.fontein.de/wp-content/latex/215/215f3d859e235b25b105dd6317cce634-T-000000-0.png' alt='f = x_{i_1}^{e_1} \cdots x_{i_t}^{e_t}' title='f = x_{i_1}^{e_1} \cdots x_{i_t}^{e_t}' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/e04/e04a3ca5623af5348124d765032320db-T-000000-0.png' alt='i_1, \dots, i_t \in I' title='i_1, \dots, i_t \in I' class='latex-inline' /> pairwise distinct and <img src='http://math.fontein.de/wp-content/latex/d89/d892603ec48cc7c83ef9ef46a28838da-T-000000-0.png' alt='e_1, \dots, e_t \in \N' title='e_1, \dots, e_t \in \N' class='latex-inline' />. Define <img src='http://math.fontein.de/wp-content/latex/bba/bba1431ca0491a29bc39fd86409fe48b-T-000000-0.png' alt='I&#039; := \{ i_1, \dots, i_t \}' title='I&#039; := \{ i_1, \dots, i_t \}' class='latex-inline' />. If <img src='http://math.fontein.de/wp-content/latex/e0f/e0f3fc48516104d53cb85003af0bf4b8-T-000000-0.png' alt='s \in \N^{(I)}' title='s \in \N^{(I)}' class='latex-inline' /> satisfies <img src='http://math.fontein.de/wp-content/latex/204/204509d9af5c6cb9354fbca46098dbaa-T-000000-0.png' alt='s(i) \neq 0' title='s(i) \neq 0' class='latex-inline' /> for <img src='http://math.fontein.de/wp-content/latex/693/6933ca1fb9b6efac29e10604698a625e-T-000000-0.png' alt='i \not\in I&#039;' title='i \not\in I&#039;' class='latex-inline' />, then <img src='http://math.fontein.de/wp-content/latex/6b3/6b36dd77b93fffe88d22b6c865dddaaf-T-000000-0.png' alt='D^{(s)} f = 0' title='D^{(s)} f = 0' class='latex-inline' />. Hence, <img src='http://math.fontein.de/wp-content/latex/564/56474ef459de6c927c2cc99ce787a035-T-000000-0.png' alt='\displaystyle  \sum_{s \in \N^{(I)}} (D^{(s)} f)(\lambda) (x - \lambda)^s = \sum_{s \in \N^{(I&#039;)}} (D^{(s)} f)(\lambda) (x - \lambda)^s; ' title='\displaystyle  \sum_{s \in \N^{(I)}} (D^{(s)} f)(\lambda) (x - \lambda)^s = \sum_{s \in \N^{(I&#039;)}} (D^{(s)} f)(\lambda) (x - \lambda)^s; ' class='latex-displaystyle' /> moreover, one can restrict to the subring <img src='http://math.fontein.de/wp-content/latex/742/7420ae310bd511bac567254f496cc799-T-000000-0.png' alt='S&#039; = R[x_{i_1}, \dots, x_{i_t}]' title='S&#039; = R[x_{i_1}, \dots, x_{i_t}]' class='latex-inline' />, as every appearing object lies in that ring. Hence, it suffices to show the result for <img src='http://math.fontein.de/wp-content/latex/a72/a725559cd4a3f6d3140417b5a19710c9-T-000000-0.png' alt='I = I&#039;' title='I = I&#039;' class='latex-inline' />, i.e. for a finite index set <img src='http://math.fontein.de/wp-content/latex/dd7/dd7536794b63bf90eccfd37f9b147d7f-T-000000-0.png' alt='I' title='I' class='latex-inline' />. We can assume <img src='http://math.fontein.de/wp-content/latex/734/734444acb9e9851ad2f6edee214d925e-T-000000-0.png' alt='I = \{ 1, \dots, n \}' title='I = \{ 1, \dots, n \}' class='latex-inline' />.
<br />
But now we can prove this by induction on <img src='http://math.fontein.de/wp-content/latex/7b8/7b8b965ad4bca0e41ab51de7b31363a1-T-000000-0.png' alt='n' title='n' class='latex-inline' />. If we write <img src='http://math.fontein.de/wp-content/latex/638/6381f9a1f306bb90d11fff044f1f71d0-T-000000-0.png' alt='s = (s&#039;, s_n)' title='s = (s&#039;, s_n)' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/20a/20a80cbaf314c0af7e347f3302e726cb-T-000000-0.png' alt='s&#039; \in \N^{n-1}' title='s&#039; \in \N^{n-1}' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/178/178b5b74357dcb11ef5a7c4ac7fff153-T-000000-0.png' alt='s_n \in \N' title='s_n \in \N' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/535/5355b0adf27d6649278e7343b5bf24d6-T-000000-0.png' alt='\lambda = (\lambda&#039;, \lambda_n)' title='\lambda = (\lambda&#039;, \lambda_n)' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/91a/91a1e03a8d3449dda82f61137718df84-T-000000-0.png' alt='\lambda&#039; \in R^{n-1}' title='\lambda&#039; \in R^{n-1}' class='latex-inline' />, <img src='http://math.fontein.de/wp-content/latex/e77/e77e894fe7f6022823762c6209ccc0e6-T-000000-0.png' alt='\lambda_n \in R' title='\lambda_n \in R' class='latex-inline' /> for <img src='http://math.fontein.de/wp-content/latex/d98/d9829bc2eccaa0303b0b9dffd8e7dbc4-T-000000-0.png' alt='s \in \N^n' title='s \in \N^n' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/835/835b4ff2d3cead59ffa0b3deb113f972-T-000000-0.png' alt='\lambda \in R^n' title='\lambda \in R^n' class='latex-inline' />, then <img src='http://math.fontein.de/wp-content/latex/4ff/4ff430d22d71cc1189734083de747e2c-T-000000-0.png' alt='\displaystyle  D^{(s)} f = D^{(s_n)} D^{(s&#039;)} f \quad \text{and} \quad (x - \lambda)^s = (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n}. ' title='\displaystyle  D^{(s)} f = D^{(s_n)} D^{(s&#039;)} f \quad \text{and} \quad (x - \lambda)^s = (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n}. ' class='latex-displaystyle' /> Hence, <img src='http://math.fontein.de/wp-content/latex/4ca/4ca0107465037e27271dcb5e0c7b7780-T-000000-0.png' alt=' &amp; \sum_{s \in \N^n} (D^{(s)} f)(\lambda) (x - \lambda)^s \\ {}={} &amp; \sum_{s \in \N^n} (D^{(s_n)} D^{(s&#039;)} f)(\lambda) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} \sum_{s&#039; \in \N^{n-1}} (D^{(s_n)} D^{(s&#039;)} f)(\lambda) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} \sum_{s&#039; \in \N^{n-1}} \bigl(D^{(s_n)} (D^{(s&#039;)} f)(\lambda&#039;) \bigr)(\lambda_n) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} D^{(s_n)} \biggl( \sum_{s&#039; \in \N^{n-1}} (D^{(s&#039;)} f)(\lambda&#039;) (x - \lambda&#039;)^{s&#039;} \biggr)(\lambda_n) (x_n - \lambda_n)^{s_n}.' title=' &amp; \sum_{s \in \N^n} (D^{(s)} f)(\lambda) (x - \lambda)^s \\ {}={} &amp; \sum_{s \in \N^n} (D^{(s_n)} D^{(s&#039;)} f)(\lambda) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} \sum_{s&#039; \in \N^{n-1}} (D^{(s_n)} D^{(s&#039;)} f)(\lambda) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} \sum_{s&#039; \in \N^{n-1}} \bigl(D^{(s_n)} (D^{(s&#039;)} f)(\lambda&#039;) \bigr)(\lambda_n) (x - \lambda&#039;)^{s&#039;} (x_n - \lambda_n)^{s_n} \\ {}={} &amp; \sum_{s_n \in \N} D^{(s_n)} \biggl( \sum_{s&#039; \in \N^{n-1}} (D^{(s&#039;)} f)(\lambda&#039;) (x - \lambda&#039;)^{s&#039;} \biggr)(\lambda_n) (x_n - \lambda_n)^{s_n}.' class='latex-displaystyle' /> Now, by induction hypothesis (<img src='http://math.fontein.de/wp-content/latex/f69/f69fdffb82267fca1be8c6913635b318-T-000000-0.png' alt='n - 1' title='n - 1' class='latex-inline' /> with the base ring <img src='http://math.fontein.de/wp-content/latex/1ba/1ba2735ee8b35c09ff20d2f3dbbe844f-T-000000-0.png' alt='R[x_n]' title='R[x_n]' class='latex-inline' />), <img src='http://math.fontein.de/wp-content/latex/8c5/8c510bcec30c223389b0f56a2348b79e-T-000000-0.png' alt='\displaystyle  \sum_{s&#039; \in \N^{n-1}} (D^{(s&#039;)} f)(\lambda&#039;) (x - \lambda&#039;)^{s&#039;} = f, ' title='\displaystyle  \sum_{s&#039; \in \N^{n-1}} (D^{(s&#039;)} f)(\lambda&#039;) (x - \lambda&#039;)^{s&#039;} = f, ' class='latex-displaystyle' /> whence <img src='http://math.fontein.de/wp-content/latex/1bd/1bda5a11f3283356d69c3c5319d036bd-T-000000-0.png' alt='\displaystyle  \sum_{s \in \N^n} (D^{(s)} f)(\lambda) (x - \lambda)^s = \sum_{s_n \in \N} D^{(s_n)} f(\lambda_n) (x_n - \lambda_n)^{s_n}. ' title='\displaystyle  \sum_{s \in \N^n} (D^{(s)} f)(\lambda) (x - \lambda)^s = \sum_{s_n \in \N} D^{(s_n)} f(\lambda_n) (x_n - \lambda_n)^{s_n}. ' class='latex-displaystyle' /> But by the classical univariate case which we <a href="http://math.fontein.de/forward.php?r=http://math.fontein.de/2009/08/12/the-hasse-derivative/">already proved</a>, this equals <img src='http://math.fontein.de/wp-content/latex/8fa/8fa14cdd754f91cc6554c9e71929cce7-T-000000-0.png' alt='f' title='f' class='latex-inline' /> itself.
</div><div class='proofqed'>□</div></blockquote>

<p>Again, we get the Identity Theorem as a direct corollary:</p>

<blockquote class='theorem'><div class='theoremtitle'>Corollary (Identity Theorem).</div> <div class='theoremmain'>
Let <img src='http://math.fontein.de/wp-content/latex/048/0480c7ca01d301a310b5963cdcaef5e3-T-000000-0.png' alt='f \in S' title='f \in S' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/183/1834a6bbc51f9ea03711fe6e2b560cb9-T-000000-0.png' alt='\lambda \in R^I' title='\lambda \in R^I' class='latex-inline' />. If <img src='http://math.fontein.de/wp-content/latex/16e/16ed037181bf669a426175d0c0a488f4-T-000000-0.png' alt='D^{(s)} f(\lambda) = 0' title='D^{(s)} f(\lambda) = 0' class='latex-inline' /> for all <img src='http://math.fontein.de/wp-content/latex/e0f/e0f3fc48516104d53cb85003af0bf4b8-T-000000-0.png' alt='s \in \N^{(I)}' title='s \in \N^{(I)}' class='latex-inline' />, then <img src='http://math.fontein.de/wp-content/latex/abe/abec0ce35b551758bc6d5d1a8a869f88-T-000000-0.png' alt='f = 0' title='f = 0' class='latex-inline' />.
</div><div class='theoremqed'>□</div></blockquote>

<p>In a similar manner as Taylor&#8217;s formula, we can also adapt other one-dimensional results to the multivariate case.</p>

<p>For example, for <img src='http://math.fontein.de/wp-content/latex/2b8/2b802ac8e543d71acc2282ce93405f45-T-000000-0.png' alt='s, t \in \N^{(I)}' title='s, t \in \N^{(I)}' class='latex-inline' />, let us define <img src='http://math.fontein.de/wp-content/latex/c18/c18c34edaa465416fe926eb88c701653-T-000000-0.png' alt='\binom{s + t}{s} := \prod_{j=1}^u \binom{s(i_j) + t(i_j)}{s(i_j)}' title='\binom{s + t}{s} := \prod_{j=1}^u \binom{s(i_j) + t(i_j)}{s(i_j)}' class='latex-inline' /> if both <img src='http://math.fontein.de/wp-content/latex/03c/03c7c0ace395d80182db07ae2c30f034-T-000000-0.png' alt='s' title='s' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/e35/e358efa489f58062f10dd7316b65649e-T-000000-0.png' alt='t' title='t' class='latex-inline' /> have no non-zero values outside <img src='http://math.fontein.de/wp-content/latex/9a4/9a41da52e41759d21d8a53ff50858000-T-000000-0.png' alt='\{ i_1, \dots, i_u \}' title='\{ i_1, \dots, i_u \}' class='latex-inline' />. Note that <img src='http://math.fontein.de/wp-content/latex/41b/41b12d27ba83573717227134eea0098e-T-000000-0.png' alt='\binom{s + t}{s} = \binom{s + t}{t}' title='\binom{s + t}{s} = \binom{s + t}{t}' class='latex-inline' />. We now obtain the following:</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition.</div> <div class='theoremmain'>
For <img src='http://math.fontein.de/wp-content/latex/2b8/2b802ac8e543d71acc2282ce93405f45-T-000000-0.png' alt='s, t \in \N^{(I)}' title='s, t \in \N^{(I)}' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/88e/88e4268768c1a7f504fbe573407f6bb5-T-000000-0.png' alt='D^{(s)} \circ D^{(t)} = \binom{s + t}{s} D^{(s + t)}' title='D^{(s)} \circ D^{(t)} = \binom{s + t}{s} D^{(s + t)}' class='latex-inline' />. In particular, <img src='http://math.fontein.de/wp-content/latex/753/753f8bed9e5c2bf6616bfe77acf867e4-T-000000-0.png' alt='D^{(s)} \circ D^{(t)} = D^{(t)} \circ D^{(s)}' title='D^{(s)} \circ D^{(t)} = D^{(t)} \circ D^{(s)}' class='latex-inline' />.
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Let <img src='http://math.fontein.de/wp-content/latex/e7d/e7df32a1c68b30bea84a21f5867910b5-T-000000-0.png' alt='R&#039;' title='R&#039;' class='latex-inline' /> denote the ring <img src='http://math.fontein.de/wp-content/latex/5bf/5bf7f3cc45ff90be5f8bb86fa4740166-T-000000-0.png' alt='R[x_j \mid j \neq i_1, \dots, i_u\}]' title='R[x_j \mid j \neq i_1, \dots, i_u\}]' class='latex-inline' />, where <img src='http://math.fontein.de/wp-content/latex/03c/03c7c0ace395d80182db07ae2c30f034-T-000000-0.png' alt='s' title='s' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/e35/e358efa489f58062f10dd7316b65649e-T-000000-0.png' alt='t' title='t' class='latex-inline' /> have no non-zero values outside <img src='http://math.fontein.de/wp-content/latex/9a4/9a41da52e41759d21d8a53ff50858000-T-000000-0.png' alt='\{ i_1, \dots, i_u \}' title='\{ i_1, \dots, i_u \}' class='latex-inline' />; then we have reduced to the ring <img src='http://math.fontein.de/wp-content/latex/92a/92a7b598392759b640dcd9632de34acb-T-000000-0.png' alt='R&#039;[x_{i_1}, \dots, x_{i_u}]' title='R&#039;[x_{i_1}, \dots, x_{i_u}]' class='latex-inline' />, i.e. to the case of <img src='http://math.fontein.de/wp-content/latex/dd7/dd7536794b63bf90eccfd37f9b147d7f-T-000000-0.png' alt='I' title='I' class='latex-inline' /> being finite, say <img src='http://math.fontein.de/wp-content/latex/734/734444acb9e9851ad2f6edee214d925e-T-000000-0.png' alt='I = \{ 1, \dots, n \}' title='I = \{ 1, \dots, n \}' class='latex-inline' />. Write <img src='http://math.fontein.de/wp-content/latex/9cc/9cc2d30aa5ee0f1da8fad227413fe38d-T-000000-0.png' alt='s = (s_1, \dots, s_n)' title='s = (s_1, \dots, s_n)' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/9f6/9f6abeb6c7a4a0011d044ecc5ed53d76-T-000000-0.png' alt='t = (t_1, \dots, t_n)' title='t = (t_1, \dots, t_n)' class='latex-inline' />. As <img src='http://math.fontein.de/wp-content/latex/94f/94f0097ebb2ef93560907c9521ac432b-T-000000-0.png' alt='D^{(k)}_{x_i}' title='D^{(k)}_{x_i}' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/522/522cf8759d4445855891f7608265eead-T-000000-0.png' alt='D^{(\ell)}_{x_j}' title='D^{(\ell)}_{x_j}' class='latex-inline' /> commute for <img src='http://math.fontein.de/wp-content/latex/82c/82cb38cfb7b8f079dda70c6a96f37479-T-000000-0.png' alt='i \neq j' title='i \neq j' class='latex-inline' />, we obtain <img src='http://math.fontein.de/wp-content/latex/bce/bce41b46e621fd9e0032226b457f5178-T-000000-0.png' alt='\displaystyle  D^{(s)} \circ D^{(t)} = \prod_{i=1}^n (D^{(s_i)}_{x_i} \circ D^{(t_i)}_{x_i}). ' title='\displaystyle  D^{(s)} \circ D^{(t)} = \prod_{i=1}^n (D^{(s_i)}_{x_i} \circ D^{(t_i)}_{x_i}). ' class='latex-displaystyle' /> Using the corresponding univariate result, we have <img src='http://math.fontein.de/wp-content/latex/c2b/c2b017374c9965883bee8764da31cbe0-T-000000-0.png' alt='D^{(s_i)}_{x_i} \circ D^{(t_i)}_{x_i} = \binom{s_i + t_i}{s_i} D^{(s_i + t_i)}_{x_i}' title='D^{(s_i)}_{x_i} \circ D^{(t_i)}_{x_i} = \binom{s_i + t_i}{s_i} D^{(s_i + t_i)}_{x_i}' class='latex-inline' />. Hence, <img src='http://math.fontein.de/wp-content/latex/4bc/4bc0eb3f5cd4842a3ce3c30e11f7905b-T-000000-0.png' alt='\displaystyle  D^{(s)} \circ D^{(t)} = \prod_{i=1}^n \biggl( \binom{s_i + t_i}{s_i} D^{(s_i + t_i)}_{x_i} \biggr) = \binom{s + t}{s} D^{(s + t)}. ' title='\displaystyle  D^{(s)} \circ D^{(t)} = \prod_{i=1}^n \biggl( \binom{s_i + t_i}{s_i} D^{(s_i + t_i)}_{x_i} \biggr) = \binom{s + t}{s} D^{(s + t)}. ' class='latex-displaystyle' />
</div><div class='proofqed'>□</div></blockquote>

<p>We also obtain the Leibniz rule:</p>

<blockquote class='theorem'><div class='theoremtitle'>Proposition (Generalized Leibniz Rule).</div> <div class='theoremmain'>
For <img src='http://math.fontein.de/wp-content/latex/ed5/ed55fbc69e094cf29febd2f3302941e5-T-000000-0.png' alt='f_1, \dots, f_m \in S' title='f_1, \dots, f_m \in S' class='latex-inline' /> and <img src='http://math.fontein.de/wp-content/latex/e0f/e0f3fc48516104d53cb85003af0bf4b8-T-000000-0.png' alt='s \in \N^{(I)}' title='s \in \N^{(I)}' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/b2f/b2f60a33beb5948307c086987b1aea7b-T-000000-0.png' alt='\displaystyle  D^{(s)} \prod_{i=1}^m f_i = \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i; ' title='\displaystyle  D^{(s)} \prod_{i=1}^m f_i = \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i; ' class='latex-displaystyle' /> here, the sum ranges over all <img src='http://math.fontein.de/wp-content/latex/ee9/ee9f3b8071ede7018dfb9370fc06f8c6-T-000000-0.png' alt='(s_1, \dots, s_m) \in (\N^{(I)})^m' title='(s_1, \dots, s_m) \in (\N^{(I)})^m' class='latex-inline' /> with <img src='http://math.fontein.de/wp-content/latex/1f4/1f45a162dcb8d2855fc9a1f35dbfe943-T-000000-0.png' alt='s_1 + \dots + s_m = s' title='s_1 + \dots + s_m = s' class='latex-inline' />. As a special case, for <img src='http://math.fontein.de/wp-content/latex/c1c/c1c1f8de8689f58760826afd8ddc489d-T-000000-0.png' alt='f, g \in S' title='f, g \in S' class='latex-inline' />, we have <img src='http://math.fontein.de/wp-content/latex/19b/19bfab2dc5fe69038ddf9ac367dc0312-T-000000-0.png' alt='\displaystyle  D^{(s)}(f g) = \sum_{s&#039; + s&#039;&#039; = s} D^{(s&#039;)}(f) D^{(s&#039;&#039;)}(g). ' title='\displaystyle  D^{(s)}(f g) = \sum_{s&#039; + s&#039;&#039; = s} D^{(s&#039;)}(f) D^{(s&#039;&#039;)}(g). ' class='latex-displaystyle' />
</div></blockquote>

<blockquote class='proof'><div class='prooftitle'>Proof.</div> <div class='proofmain'>
Using the standard argument, we reduce to the case <img src='http://math.fontein.de/wp-content/latex/734/734444acb9e9851ad2f6edee214d925e-T-000000-0.png' alt='I = \{ 1, \dots, n \}' title='I = \{ 1, \dots, n \}' class='latex-inline' /> and we use the standard decomposition <img src='http://math.fontein.de/wp-content/latex/821/821d59e4e1564703e79e511066945d03-T-000000-0.png' alt='\N^n = \N^{n-1} \times \N' title='\N^n = \N^{n-1} \times \N' class='latex-inline' />. Hence, <img src='http://math.fontein.de/wp-content/latex/991/9917a34461d0c09bb7e58e18e25bb618-T-000000-0.png' alt='\displaystyle  \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i = \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_i&#039;)} D^{(s_{i,n})} f_i, ' title='\displaystyle  \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i = \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_i&#039;)} D^{(s_{i,n})} f_i, ' class='latex-displaystyle' /> where the second sum ranges over all <img src='http://math.fontein.de/wp-content/latex/a74/a742d0b332fd38dd28e2379563603cd9-T-000000-0.png' alt='(s&#039;_1, \dots, s_ m&#039;) \in (\N^{n-1})^m' title='(s&#039;_1, \dots, s_ m&#039;) \in (\N^{n-1})^m' class='latex-inline' /> and the third sum ranges over all <img src='http://math.fontein.de/wp-content/latex/595/595f992c366f5e90bfd2bec7736085e3-T-000000-0.png' alt='(s_{1,n}, \dots, s_{m,n}) \in \N^m' title='(s_{1,n}, \dots, s_{m,n}) \in \N^m' class='latex-inline' />. Now <img src='http://math.fontein.de/wp-content/latex/12f/12f5321ed3809d147c68e4baed9e72fe-T-000000-0.png' alt=' &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_i&#039;)} D^{(s_{i,n})} f_i \\ {}={} &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_{i,n})} f_i,' title=' &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_i&#039;)} D^{(s_{i,n})} f_i \\ {}={} &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} \sum_{s_{1,n} + \dots + s_{m,n} = s_n} \prod_{i=1}^m D^{(s_{i,n})} f_i,' class='latex-displaystyle' /> and applying the univariate result to the base ring <img src='http://math.fontein.de/wp-content/latex/f15/f15c7ed995d439c2959aa087b19fc4b0-T-000000-0.png' alt='R[x_1, \dots, x_{n-1}]' title='R[x_1, \dots, x_{n-1}]' class='latex-inline' />, we obtain <img src='http://math.fontein.de/wp-content/latex/88d/88dad2e23e6211815effaae337d43330-T-000000-0.png' alt=' \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i ={} &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} D^{(s_n)}_{x_n} \prod_{i=1}^m f_i \\ {}={} &amp; D^{(s_n)}_{x_n} \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} \prod_{i=1}^m f_i.' title=' \sum_{s_1 + \dots + s_m = s} \prod_{i=1}^m D^{(s_i)} f_i ={} &amp; \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} D^{(s_n)}_{x_n} \prod_{i=1}^m f_i \\ {}={} &amp; D^{(s_n)}_{x_n} \sum_{s&#039;_1 + \dots + s_m&#039; = s&#039;} D^{(s_i&#039;)} \prod_{i=1}^m f_i.' class='latex-displaystyle' /> By induction hypothesis, this equals <img src='http://math.fontein.de/wp-content/latex/85b/85bb9f472300655eb4e95a34345069c4-T-000000-0.png' alt='\displaystyle  D^{(s_n)}_{x_n} D^{(s&#039;)} \prod_{i=1}^m f_i = D^{(s)} \prod_{i=1}^m f_i. ' title='\displaystyle  D^{(s_n)}_{x_n} D^{(s&#039;)} \prod_{i=1}^m f_i = D^{(s)} \prod_{i=1}^m f_i. ' class='latex-displaystyle' />
</div><div class='proofqed'>□</div></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://math.fontein.de/2009/10/02/the-hasse-derivative-part-ii-multivariate-partial-hasse-derivatives/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

