- #1
Euler2718
- 90
- 3
- TL;DR Summary
- Under a metric defined on the set of single variable real valued coefficient polynomials, find a non-convergent Cauchy sequence.
Define a metric on ##\mathbb{R}[x]## for distinct polynomials ##f(x),g(x)## as ##d(f(x),g(x)) = \frac{1}{2^{n}}##, where ##n## is the largest positive integer such that ##x^{n}## divides ##f(x)-g(x)##. Equivalently, ##n## is the multiplicity of the root ##x=0## of ##f(x)-g(x)##. Set ##d(f(x),f(x))=0##.
Goal: Show ##(\mathbb{R}[x],d)## is not complete via counter-example.
Divisbility has never been my strong suit. Most of my thinking has been based off of the assumption that the value of ##n## is proportional to the degree of ##f(x)-g(x)##. I first considered a sequence ##(\mathcal{F}_{k})_{k=0}^{\infty}## where ##\deg(\mathcal{F}_{0})=0## and ##\deg(\mathcal{F}_{k+1})=\deg(\mathcal{F}_{k})+1## . Based on my assumption of how ##n## behaves though, this seems to converge as ##n## gets larger and larger. I then considered a sequence where the degrees are the same throughout, but this would not be Cauchy as the ##n## would be the same for all ##\mathcal{F}_{k}##. Then I thought about sequences where the degree decreases, but since the degree is a non-negative integer, it would eventually just turn into a sequence of zero-degree polynomials, which wouldn't work.
So I'm starting to think I've made an error in my assumption about how ##n## works, or that maybe looking at the multiplicity route may be more fruitful (though I cannot see at the moment how). Any input would be appreciated.
Goal: Show ##(\mathbb{R}[x],d)## is not complete via counter-example.
Divisbility has never been my strong suit. Most of my thinking has been based off of the assumption that the value of ##n## is proportional to the degree of ##f(x)-g(x)##. I first considered a sequence ##(\mathcal{F}_{k})_{k=0}^{\infty}## where ##\deg(\mathcal{F}_{0})=0## and ##\deg(\mathcal{F}_{k+1})=\deg(\mathcal{F}_{k})+1## . Based on my assumption of how ##n## behaves though, this seems to converge as ##n## gets larger and larger. I then considered a sequence where the degrees are the same throughout, but this would not be Cauchy as the ##n## would be the same for all ##\mathcal{F}_{k}##. Then I thought about sequences where the degree decreases, but since the degree is a non-negative integer, it would eventually just turn into a sequence of zero-degree polynomials, which wouldn't work.
So I'm starting to think I've made an error in my assumption about how ##n## works, or that maybe looking at the multiplicity route may be more fruitful (though I cannot see at the moment how). Any input would be appreciated.