Proving sequence x_t is decreasing

  • Context: Graduate 
  • Thread starter Thread starter peter60185
  • Start date Start date
  • Tags Tags
    decreasing Sequence
Click For Summary
SUMMARY

The sequence x_t is definitively decreasing while y_t is increasing, as established through iterative equations. The equations are defined as y_(t+1) = bq x_t + b(1 - q) y_t and f[x_(t+1)] = bqf[x_t] + b(1 - q) f[y_t], with x_(t+1) expressed as x_(t+1) = f^(-1)[bqf[x_t] + b(1 - q) f[y_t]]. Key conditions include f[x] being decreasing and concave, with initial values x_0 = 1 and y_0 = 0, and constraints 0 < q < 1 and 0 < b < 1.

PREREQUISITES
  • Understanding of iterative sequences and their properties
  • Knowledge of concave functions and their implications
  • Familiarity with inverse functions and their calculations
  • Basic principles of mathematical induction
NEXT STEPS
  • Explore the properties of concave functions in detail
  • Study mathematical induction techniques for proving sequence behaviors
  • Investigate the implications of decreasing functions on iterative sequences
  • Learn about the behavior of functions under transformations, particularly inverse functions
USEFUL FOR

Mathematicians, students studying sequences and series, researchers in mathematical analysis, and anyone interested in the properties of iterative functions.

peter60185
Messages
1
Reaction score
0
Hi, I'm sure x_t is a decreasing sequence while y_t is an increasing one. It feels like it should be simple to prove, but I just can't do it. Any suggestions would be great!

Thanks,

Peter

x_t and y_t are defined iteratively by two equations:

1. y_(t+1) = bq x_t + b(1 - q) y _t

2. f[x_(t+1)] = bqf[x_t] + b(1 - q) f[y _t]

IE

2B. x_(t+1) = f^(-1)[bqf[x_t] + b(1 - q) f[y _t]]

Other conditions:

1. f[x] is decreasing and concave
2. x_0 = 1
3. y_0 = 0
4. 0 < q < 1
5. 0 < b < 1
6. f(0) = 1
7. f(1) = 0
 
Physics news on Phys.org
Welcome to PF;
You say:
##x_t## and ##y_t## are defined iteratively by two equations:

1. ##y_{t+1} = bq x_t + b(1 - q) y_t##

2. ##f(x_{t+1}) = bqf(x_t) + b(1 - q) f(y _t)##

i.e.

2b. ##x_{t+1} = f^{-1}(bqf(x_t) + b(1 - q) f(y_t))##

Other conditions:

1. ##f(x)## is decreasing and concave (in what sense "concave"?)
2. ##x_0 = 1##
3. ##y_0 = 0##
4. ##0 < q < 1##
5. ##0 < b < 1##
6. ##f(0) = 1##
7. ##f(1) = 0##

I'd start out by seeing how far I can walk through the iterations by hand.

##y_1=bq##

##f(x_1)=b(1-q)##

... and so on.
Can you rely on ##f(x_{t+1})<f(x_t)## ?
(meaning of "decreasing and concave" see?)

So ##f(x_{t>1})<b(1-q)## and we know ##b(1-q)<1## and ##bq<1## so anything multiplied by them gets smaller.

Perhaps a pattern will emerge?
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 21 ·
Replies
21
Views
4K