Previously, we have explored methods to compute the essence of power functions Ȣxn which involves solving a large system of linear equations. This method is equivalent to solving for the inverse of a large n×n matrix where entries are values of pascal's triangle. Though the matrix method allow us to solve for large number of essences at once, it does not extend easily to solve for next iterations of essence coefficients. Rather than reusing the values we have already solved for, we will have to solve for inverse of a separate larger matrix again. Here we will introduce an iterative method for solving for these coefficients. Chapter 0: Recap Let us first remind ourselves of the definition of essence. For a function f(x), we want to find the transformation Ȣf(x) such that we are able to 'smooth out' its series: b∑i=af(i)=∫ba−1Ȣf(x)dx For example, we can solve for the following functions: $$\begin{align*}Ȣ1 &= 1 \\ Ȣx &= x +...
In my last post I introduced my goals of Ȣf(x), a transformation that produces a new function that fits the definition ∑mi=nf(i)=∫mn−1Ȣf(x)dx. In this article, we will explore few basic properties we can find of Ȣ Transformation without even needing to know how to transform works!
ddxȢf(x)=Ȣddxf(x)∫Ȣf(x)dx=Ȣ∫f(x)dx
We will come back to proofs of these after we cover Formal Definition of Essence.
This leaves us with this List of Properties
Ȣc∗f(x)=c∗Ȣf(x),c is a constantȢf(x)+Ȣg(x)=Ȣ(f(x)+g(x))Ȣf(x+c)=Ȣf(y),y=x+cddxȢf(x)=Ȣddxf(x)∫Ȣf(x)dx=Ȣ∫f(x)dx
Being able to utilize these properties freely will help us understand and explore Sequence Curve with more ease!
Sum Rule of Essence
Ȣ(f(x)+g(x))=Ȣf(x)+Ȣg(x) This property becomes very obvious when we consider that Essence is related to Series.
Let's consider Ȣ(f(x)+g(x)). By definition of Essence, we find that
m∑i=n(f(i)+g(i))=∫mn−1Ȣ(f(x)+g(x))dx
We can modify the Summation on the left-hand side as such
m∑i=n(f(i)+g(i))=m∑i=nf(i)+m∑i=ng(i)
Using Essence, we can represent each sub-summations as integrals
m∑i=n(f(i)+g(i))=m∑i=nf(i)+m∑i=ng(i)=∫mn−1Ȣf(x)dx+∫mn−1Ȣg(x)dx=∫mn−1Ȣf(x)+Ȣg(x)dx
This leads to that m∑i=n(f(i)+g(i))=∫mn−1Ȣ(f(x)+g(x))dx=∫mn−1Ȣf(x)+Ȣg(x)dx∴Ȣ(f(x)+g(x))=Ȣf(x)+Ȣg(x)◼
m∑i=n(f(i)+g(i))=∫mn−1Ȣ(f(x)+g(x))dx
We can modify the Summation on the left-hand side as such
m∑i=n(f(i)+g(i))=m∑i=nf(i)+m∑i=ng(i)
Using Essence, we can represent each sub-summations as integrals
m∑i=n(f(i)+g(i))=m∑i=nf(i)+m∑i=ng(i)=∫mn−1Ȣf(x)dx+∫mn−1Ȣg(x)dx=∫mn−1Ȣf(x)+Ȣg(x)dx
This leads to that m∑i=n(f(i)+g(i))=∫mn−1Ȣ(f(x)+g(x))dx=∫mn−1Ȣf(x)+Ȣg(x)dx∴Ȣ(f(x)+g(x))=Ȣf(x)+Ȣg(x)◼
Constant Multiple Rule of Essence
Ȣ(c∗f(x))=c∗Ȣf(x), c is a constant
Let's start with the left hand side, utilizing definition of Essence as
m∑i=nc∗f(i)=∫mn−1Ȣ(c∗f(x))dx
We can modify the Summation such that it leads to
m∑i=nc∗f(i)=c∗m∑i=nf(i)=c∗∫mn−1Ȣf(x)dx=∫mn−1c∗Ȣf(x)dx
This leads to
m∑i=nc∗f(i)=∫mn−1Ȣ(c∗f(x))dx=∫mn−1c∗Ȣf(x)dx∴Ȣ(c∗f(x))=c∗Ȣf(x)◼
m∑i=nc∗f(i)=∫mn−1Ȣ(c∗f(x))dx
We can modify the Summation such that it leads to
m∑i=nc∗f(i)=c∗m∑i=nf(i)=c∗∫mn−1Ȣf(x)dx=∫mn−1c∗Ȣf(x)dx
This leads to
m∑i=nc∗f(i)=∫mn−1Ȣ(c∗f(x))dx=∫mn−1c∗Ȣf(x)dx∴Ȣ(c∗f(x))=c∗Ȣf(x)◼
Index Shifting of Essence
Ȣf(x+c)=Ȣ(y),y=x+c This is to say that given Ȣf(x+c)=g(x) we can rightly say that Ȣf(x)=g(x−c) This is obvious and may seem unnecessary to include in this list, but the ability to utilize this 'shifting' will become extremely useful later on.Derivative and Integral Rule of Essence
After we cover in more depth a Formal Definition of Essence Transformation, we will be able to cover more unintuitive properties such asddxȢf(x)=Ȣddxf(x)∫Ȣf(x)dx=Ȣ∫f(x)dx
We will come back to proofs of these after we cover Formal Definition of Essence.
This leaves us with this List of Properties
Ȣc∗f(x)=c∗Ȣf(x),c is a constantȢf(x)+Ȣg(x)=Ȣ(f(x)+g(x))Ȣf(x+c)=Ȣf(y),y=x+cddxȢf(x)=Ȣddxf(x)∫Ȣf(x)dx=Ȣ∫f(x)dx
Being able to utilize these properties freely will help us understand and explore Sequence Curve with more ease!
Comments
Post a Comment