This answer says that any casual sequence of the kind $y_n = y_{n-1} + y_{n-2} + y_{n-3} + \ldots $ will stay constant-0 because $y_0$ is a sum of zeroes, so is $y_1$ and the rest of the sequence. I can also put it the way $Y(z) = z^{-1}Y(z)+z^{-2}Y(z)+z^{-3}Y(z) + \ldots$, which either means that $z^{-1}+z^{-2}+\ldots+z^{-n} = 1$, which is unlikely, or simply $Y(z) = 0$, which is more plausible. But, Fibonacci is also of this kind. Does it mean that it is non-casual or what?
2026-03-26 01:09:19.1774487359
Initial values appear from nothing
58 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
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}$
Related Questions in FIBONACCI-NUMBERS
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Fibonacci sequence and golden ratio
- Induction proof of Fibonacci numbers
- Fibonacci sequence and divisibility.
- Fibonacci numbers mod $p$
- A proof regarding the Fibonacci Sequence.
- Congruencies for Fibonacci numbers
- Is every $N$th Fibonacci number where $N$ is divisible by $5$ itself divisible by $5$
- Proof involving Fibonacci number and binomial coefficient
Related Questions in Z-TRANSFORM
- Inverse $z$-transform similar to convolution
- How do we compute higher order derivatives of a rational function?
- Inverse Z Transform with $2-z^{-2}$
- Final Value Theorem Z Transform
- Z-Transformed (Standardized) Data Retaining Its Skew?
- How does $ \sum \limits_{n=0}^\infty\left (\frac{1}{z^2}\right)^m = \frac{z^2}{z^2-1}$?
- z-transforms of a system of coupled difference equations
- Understanding the z-transform - complex value vs time delay
- Help with Algebra Manipulation
- Z Transform of n-varying function
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?
Fibonacci is defined as $$F_1 = 1, F_2 = 1\\F_{n+1} = F_n + F_{n-1}$$
and never hits zero since it is obviously increasing. If you would take $$G_1=0,G_2=0\\G_{n+1} = G_n + G_{n-1},$$
then of course the sequence will be constantly zero.
EDIT:
According to your link, a sequence is causal if $x_n=0$ for $n<0$, however, this means that the definition of causal sequences only applies to sequences where $x_n$ is defined both for positive and negative values of $n$. In the case of the Fibonacci sequence, however, $F_n$ is defined only for $n\geq 0$, so it is, by definition, not causal.