Questions tagged [fixed-point-theorems]
Fixed-point theorem is a result about existence of fixed points, i.e. points fulfilling $F(x)=x$, under some conditions on the function $F$. Results of this type appear in many areas of mathematics, e.g. functional analysis (Banach), algebraic topology (Brouwer), lattice theory (Knaster-Tarski, Kleene) etc.
2,226 questions
3 votes
3 answers
345 views
+250
Why is $y = \sin \left(\frac{y^s}{t} - k \right)$ outstandingly approximated by $y = - \sin k$, even for large $k$?
Equations of the form $$y = \sin \left(\frac{y^s}{t} - k \right)$$ are surprisingly well approximated as $$y = - \sin k$$ for a large range of $s$ $t$ and $k$ values: Why? I understand why this is so ...
1 vote
0 answers
87 views
Central Limit Theorem via Fixed Point Theorem and Entropy
I'd like to work out the details of a proof of the Central Limit Theorem that utilizes the Banach Fixed Point Theorem and possibly also entropy. The rough idea is: The average $\bar{X} = \frac{1}{n} \...
1 vote
0 answers
159 views
uniqueness of fixed point using a non-linear function
I have some function from $R^{nk}$ to $R^{nk}$ defined as: $$T(v) = u + f(v) F$$ where u is some vector, f is some non-linear function and F is a nk,nk matrix. i want to prove that there is a unique ...
1 vote
0 answers
79 views
Unclear step in van Maaren's theorem proof by Schechter
I am trying to disentangle the proof of Brouwer's fixed point theorem via van Maaren's geometry-free Sperner lemma in Eric Schechter's Handbook of Analysis and its Foundations (sections 3.28-3.37). ...
3 votes
1 answer
212 views
Iterating the arithmetic-derivative map $U(n)=n+D(n)−1$
For integers $n$, the arithmetic derivative $D(n)$ is defined as follows: $D(p) = 1$, for any prime $p$. $D(mn) = D(m)n + mD(n)$, for any $m,n\in\mathbb{N}$ (Leibniz rule). $D(-n) = -D(n)$. The ...
22 votes
0 answers
410 views
A sequence based on arithmetic derivative that always converges to prime numbers
For integers $n$, the arithmetic derivative $D(n)$ is defined as follows: $D(p) = 1$, for any prime $p$. $D(mn) = D(m)n + mD(n)$, for any $m,n\in\mathbb{N}$ (Leibniz rule). $D(-n) = -D(n)$. The ...
4 votes
1 answer
170 views
Question About Milnor's proof of the Brouwer's fixed-point theorem
I'm currently going through Milnor's proof of the Brouwer's fixed-point theorem, which I've linked here. I am able to follow the proof up to theorem 2 - afterwards, I've having a bit of trouble ...
0 votes
0 answers
82 views
What are the problems in math that are equivalent to fixed point problems?
I am not sure if this question makes some sense. But I have been thinking for a while now. Let us start with simple problems; let us say that we want to solve the following equation for $x$ $$f(x)=y.$$...
2 votes
2 answers
206 views
Proving the existence of a fixed-point for the interpolation problem
This is a rephrasing of the original post in (Interpolation problem with varying nodes) Let $\{f_i\}^{M}_{i=0}$ be a set of real numbers satisfying either $$f_0>f_1<f_2>f_3 \dots$$ or $$f_0&...
0 votes
0 answers
26 views
A function $f$ such that repeated application gives you identity? i.e. $f^n(x) = x$ [duplicate]
Given a fixed $n$, I wanted a continuous function $f$ (preferably whose domain is $\mathbb{R}$) such that, applying $f^n$ (i.e. applying it $n$ times) to $x$ gives you back $x$ for any $x$ in the ...
0 votes
0 answers
35 views
Why is R-convergence a useful notion?
Consider the definition of $R$-convergence as given in Definition 9.2.1 of "Iterative solutions of nonlinear equations in several variables" by Ortega and Rheinbolt. Let $A$ be a fixed-...
5 votes
0 answers
98 views
Convergence of fixed-point iteration $x = \frac{1 + Px}{2 + Px + Nx}$
I am studying a problem related to trust propagation / rating in a network. Users rate each other either negatively or positively. From this I want to compute an overall rating vector $\boldsymbol{r} \...
0 votes
0 answers
52 views
Householder versus Halley speedtest?
Consider this Householder's method : https://mathworld.wolfram.com/HouseholdersMethod.html versus this Halley's method : https://mathworld.wolfram.com/HalleysMethod.html Which method is the most ...
-1 votes
1 answer
128 views
Why fixed point iteration of $x^3 = 1-x^2$ doesn't converge when $x_0 = 0$?
I am new to numerical methods and am currently learning Fixed point iteration. I have learned that if you can express $x = g(x)$, and $|g'(x_0)|<1$, then the sequence, $x_{n+1} = g(x_n)$ converges ...
0 votes
0 answers
87 views
Convergence of discrete replicator equation
One of the evolution equations used in evolutionary game theory is the Replicator type II dynamics $$ x_i(t+1)=x_i(t)\frac{(Ax(t))_i}{x^T(t)Ax(t)} $$ where $A$ is an $M\times M$ payoff matrix with ...