Introduces a two-sided difference quotient D(q; f, g) that satisfies an exact Leibniz rule, computes it on the affine tuple entries and, by induction on word length, on products along words; setting f = g = 1 and extending linearly gives the chain rule.
Each result cited is universally quantified over the data in its own statement.
Throughout, is the tuple of , so that by Affine Data and Affine Substitutions of Noncommutative Polynomials §substitution, and for the polynomial is the product along ; in particular and for the one-letter word , . For a word (in either alphabet) we write for its length, with , and for the words and are those of the preamble of The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law, as is the symbol . A sum over an empty range of indices is . We fix for the whole proof.
Step 1 (A two-sided difference quotient). For and put
which is when . By Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension, part (a), for fixed there is exactly one linear map with for every , and it is given by and for . We record three properties.
(i) By Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials, for every , so for the number is the value at prescribed for in The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law §difference-quotient (with , , ), while and . Thus and are linear maps that agree on every monomial, and by the uniqueness in Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension, part (a), for every .
(ii) For fixed the number is linear in for fixed and linear in for fixed : each is, because the product of is bilinear by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra and is linear, and is either or a linear combination, with coefficients not depending on , of the numbers .
(iii) . For the variable is the monomial of the one-letter word , whose only position is with ; hence, using and , .
Step 2 (Leibniz rule). We claim that for all
First let and with . Then by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials. The word has length , and its positions split into two ranges: for one has , and ; for with one has , and (either range is empty when , respectively , is empty). By Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §monomials and the associativity in Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra, and . Splitting the sum defining along the two ranges therefore gives
which is (L) for , . Now fix and , and put . Both sides of (L) are linear in : the left side because is linear by Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra and is linear; the right side because is linear and is linear by (ii) and Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra. They agree on monomials , so they agree for every by the uniqueness in Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension, part (a). Finally fix an arbitrary . Both sides of (L) are linear in : the left side as before; on the right, is linear by (ii) and Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §algebra, and is linear by definition. They agree on every monomial by what was just shown, so (L) holds for all by the same uniqueness.
Step 3 (The entries of the affine tuple). Let . By Affine Data and Affine Substitutions of Noncommutative Polynomials §tuple, , so by linearity of and (iii), for all ,
Step 4 (Products along words). We prove by induction on the statement : for every of length and all ,
For we have , , and by (iii), which is the empty sum. Assume and let have length . Let (so if ) and , so that . By Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values, . By (L) with and ,
By applied to with in place of , the first term equals , and by (A) the second term equals . For we have , and , so by Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values and by associativity; for we have , , and . Hence the two terms add up to the right side of (W) for , which proves .
Step 5 (Conclusion). For every , by Substitution is the Unique Unital Homomorphism with Prescribed Values on the Variables: Monomials, Products, Adjoints and Composition §values, so . Let . By (i), , (W) with , and ,
the last step because, for each , the only index with is . If , the inner sum is by The Free Difference Quotient and the Conjugate Variables of a Noncommutative Law §difference-quotient (with and ); if , both sides are , since the sum over is empty and . Thus the identity of the lemma holds for , for every . Both and are linear maps (a composite of linear maps, and a linear combination of linear maps), and they agree on every monomial; by the uniqueness in Noncommutative Polynomials Form a Unital Complex Algebra with Involution: Linear Extension from Monomials, Products, Adjoints and Self-Adjoint Parts §linear-extension, part (a), they are equal, which is the asserted identity for every .
Loading…