Math 2.0

Dynamical systems and ergodic theory Definition

Attractor

Builds on Metric spaceContinuous functionCompact spaceOpen setIterated function

Definition

Let (X,d)(X, d) be a metric space and let f ⁣:X→Xf \colon X \to X be a continuous map, with iterates fnf^n. For x∈Xx \in X and A⊆XA \subseteq X nonempty, let d(x,A)=inf⁡a∈Ad(x,a)d(x, A) = \inf_{a \in A} d(x, a). A nonempty compact set A⊆XA \subseteq X is an attractor of ff if:

  1. AA is invariant: f(A)=Af(A) = A;
  2. AA attracts an open neighbourhood: there is an open set U⊇AU \supseteq A such that d(fn(x),A)→0d(f^n(x), A) \to 0 as n→∞n \to \infty for every x∈Ux \in U;
  3. AA is minimal: no nonempty compact proper subset of AA satisfies clauses 1 and 2.

The basin of attraction of AA is the set of all x∈Xx \in X with d(fn(x),A)→0d(f^n(x), A) \to 0. For a flow (φt)(\varphi_t) the definition is the same, with φt(A)=A\varphi_t(A) = A for all tt and t→∞t \to \infty in place of n→∞n \to \infty.

Remarks

A set that satisfies clauses 1 and 2 is often called an attracting set. The literature uses several other versions. Some replace clause 3 by the existence of a dense orbit in AA. Some ask for a neighbourhood UU with f(U‾)⊆Uf(\overline{U}) \subseteq U and A=⋂n≥0fn(U)A = \bigcap_{n \ge 0} f^n(U). Milnor's version replaces the open neighbourhood in clause 2 by a basin of positive measure.

Example: f(x)=x/2f(x) = x/2 on ℝ\R and A={0}A = \set{0}. Clause 1 holds since f(0)=0f(0) = 0; clause 2 holds with U=ℝU = \R, since d(fn(x),A)=∣x∣/2n→0d(f^n(x), A) = \abs{x}/2^n \to 0; clause 3 holds since AA has no nonempty proper subset.

Non-example: let ff be the time-11 map of the flow of u′=u−u3u' = u - u^3 on ℝ\R, and let A=[−1,1]A = [-1, 1]. Every solution tends to −1-1, 00 or 11, so AA is invariant and attracts all of ℝ\R. But the proper subset {1}\set{1} also satisfies clauses 1 and 2, with U=(0,∞)U = (0, \infty), so clause 3 fails for AA. The attractors of this map are {−1}\set{-1} and {1}\set{1}.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Compact space concept
  2. Continuous function concept
  3. Iterated function concept
  4. Metric space concept
  5. Open set concept
  6. Attractor definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Attractor
About this page
TagEZ24HDESPB
URIm2://EZ24HDESPB
Kinddefinition
WritingW0 stub
MSC37C70, 37G35, 37B25
DefinesAttractor
UsesMetric space, Continuous function, Compact space, Open set, Iterated function

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.