Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Topological mixing, dense periodic points, sensitive dependence, and the stated chaos list

Definition

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric) with its metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and let f:X→X be a map. For n≥1 write fn for the n-fold iterate, f1:=f and fn+1:=f∘fn.

  1. f is topologically mixing when for all nonempty open sets U,V⊆X there is an integer N such that

fn(U)∩V≠∅for every n≥N.

  1. A point x∈X is a periodic point of f when fn(x)=x for some n≥1. The set of periodic points of f is written Per⁡(f). The periodic points are dense in X when Per⁡(f) is dense in X, that is (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) when every nonempty open subset of X meets Per⁡(f).

  2. f has sensitive dependence on initial conditions when there is a real number δ>0 such that for every x∈X and every ε>0 there are y∈X and n≥1 with

d(x,y)<εandd(fn(x),fn(y))≥δ.

Such a number δ is called a sensitivity constant for f.

Finally, say that f is chaotic in the stated sense when f is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form), topologically mixing, has dense periodic points, and has sensitive dependence on initial conditions.

Remarks

  • The list is a definition of a chosen package of properties, not a definition of the word "chaos" in all of its uses. Devaney's closely related list replaces topological mixing by topological transitivity; mixing implies transitivity, while this definition makes no converse claim. Positive topological entropy, Li-Yorke chaos, and measure-theoretic mixing are further distinct properties that this definition neither implies nor assumes.

  • Topological mixing immediately implies the open-set form of topological transitivity: for nonempty open U,V the definition supplies N with fN(U)∩V≠∅. Sensitivity is required with one constant δ uniform over all points and all radii ε; it is a statement about the family of iterates, not about a single pair of orbits.

  • The definition applies to non-invertible maps; only forward iterates are used. When f is a bijection, applying the same definitions to f−1 gives a separate statement, and nothing here asserts two-sided mixing.

Depends on

Dependency tree · 2 levels

Sources