I am not sure what to do? I would simply say that i have a differential equation if the condition that f is from ring of power series. Its in the context of generating funktions.
2026-03-26 16:10:13.1774541413
Bumbble Comm
On
Show that $ f(x)=c*e^x$ if $f'=f$ , but f is from a ring of power series over Complex Numbers, Context: generating Functions
45 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
0
Bumbble Comm
On
If $f(x)=\sum_{n\geq 0} a_n x^n/n!$, then term by term differentiation implies that $f'(x)=\sum_{n\geq 0}a_{n+1} x^n/n!$. In particular if $f'=f$, then comparing coefficients of $x^n$ yields that $$ a_n=a_{n+1} $$ for all $n\geq 0$ i.e. $a_n=a_0=f(0)$ for $n\ge 0$. Thus $$ f(x)=\sum_{n\geq 0}f(0)\frac{x^n}{n!}=f(0)e^x $$ as desired.
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in ORDINARY-DIFFERENTIAL-EQUATIONS
- The Runge-Kutta method for a system of equations
- Analytical solution of a nonlinear ordinary differential equation
- Stability of system of ordinary nonlinear differential equations
- Maximal interval of existence of the IVP
- Power series solution of $y''+e^xy' - y=0$
- Change of variables in a differential equation
- Dimension of solution space of homogeneous differential equation, proof
- Solve the initial value problem $x^2y'+y(x-y)=0$
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Derive an equation with Faraday's law
Related Questions in DISCRETE-MATHEMATICS
- What is (mathematically) minimal computer architecture to run any software
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Given a function, prove that it's injective
- Surjective function proof
- How to find image of a function
- Find the truth value of... empty set?
- Solving discrete recursion equations with min in the equation
- Determine the marginal distributions of $(T_1, T_2)$
Related Questions in GENERATING-FUNCTIONS
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- How to multiply generating functions with $x^n$ and $x^{5n}$ and $x^{2n}$
- Relationship between the generating functions of sequences $(a_n),(b_n)$ given $b_n=\sum^n_{i=1}a_i$.
- Double-exponential sum (maybe it telescopes?)
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- Want to use Herbert Wilf's snake oil method to show $\sum_k \binom{2n+1}{2k}\binom{m+k}{2n} = \binom{2m+1}{2n}$
- Young Tableaux generating function
- Generating function of the sequence $\binom{2n}{n}^3H_n$
- Expansion of fibonacci generating function
- Partial fraction of $A(x)=\frac{x^2+x+1}{(1-x)^3}$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It appears I, having tackled this one on only my first sip of coffee for the day, got things slightly mixed up and solved a slight generalization of the requested result, that is, I showed that $f'(x) = cf(x)$ implies $f(x) = f(x_0) e^{cx}$. Rather than go back and massively edit this answer, I hereby post it as is and go back to my coffee! The requested answer should be evident from what follows. Thank your for your patience. Slurp!
Without going into the rigamarole about why and when this series and the series of derivatives of the $a_i x^i$ properly converges, one calculates as follows:
$f(x) = \displaystyle \sum_0^\infty a_i x^i; \tag 1$
$f'(x) = \displaystyle \sum_1^\infty a_i i x^{i - 1}; \tag 2$
then if
$f'(x) = c f(x) \tag 3$
we obtain
$f'(x) = \displaystyle \sum_1^\infty a_i i x^{i - 1} = c \sum_0^\infty a_i x^i = \sum_0^\infty c a_i x^i; \tag 4$
comparing coefficients of like powers of $x$ we see that
$a_1 = ca_0, \tag 5$
$2a_2 = ca_1 = c^2 a_0 \Longrightarrow a_2 = \dfrac{1}{2}c^2 a_0, \tag 6$
$3a_3 = ca_2 \Longrightarrow a_3 = \dfrac{1}{2 \cdot 3}c^3 a_0, \tag 7$
$4a_4 = ca_3 \Longrightarrow a_4 = \dfrac{1}{2 \cdot 3 \cdot 4}c^4 a_0, \tag 7$
$5a_5 = ca_4 \Longrightarrow a_5 = \dfrac{1}{2 \cdot 3 \cdot 4 \cdot 5}c^5 a_0, \tag 8$
$\vdots \tag 9$
and in general, with $n \ge 1$,
$n a_n = ca_{n - 1} \Longrightarrow a_n = \dfrac{1}{2 \cdot 3 \cdot 4 \cdot \ldots \cdot n}c^n a_0 = \dfrac{1}{n!} c^n a_0; \tag{10}$
we may in fact deploy induction to prove (10), to wit:
$(n + 1)a_{n + 1} = ca_n \Longrightarrow a_{n + 1} = \dfrac{1}{n! \cdot (n + 1)} c^{n + 1} a_0 = \dfrac{1}{(n + 1)!} c^{n + 1} a_0; \tag{11}$
inserting (10) into (1) we find
$f(x) = \displaystyle \sum_0^\infty a_i x^i = a_0 + \sum_1^\infty \dfrac{1}{n!} c^n a_0 x^n = a_0 + a_0 \displaystyle \sum_1^\infty \dfrac{1}{n!} (cx)^n$ $= a_0 \left ( 1 + \displaystyle \sum_1^\infty \dfrac{1}{n!}(cx)^n \right ) = a_0 \displaystyle \sum_0^\infty \dfrac{1}{n!}(cx)^n = a_0 e^{cx}; \tag{12}$
the coefficient $a_0$, not being determined via (5)-(11), may be freely selected; if we take a differential equations point of view, it is determined by an as yet unsupplied initial condition, viz. $f(x_0)$; then
$f(x_0) = a_0 e^{c x_0}, \tag{13}$
or
$a_0 = f(x_0) e^{-cx_0}, \tag{14}$
whence
$f(x) = a_0 e^{cx} = f(x_0) e^{-c x_0} e^{c x} = f(x_0) e^{c(x - x_0)}; \tag{15}$
we often select $x_0 = 0$; then
$f(x) = f(x_0) e^{cx}. \tag{16}$
As for the precise question as asked, taking $c = 1$ in the above addresses that issue.
Recursion before breakfast--meh!