Alphabeta Math
DefinitionDefinition: AI-generatedProof: AI-generated
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.

Point basins, equilibrium-set basins and aggregate volume

Definition

Assume countable choice. Let V be a nonempty finite set, TV=RV/(2πZ)V the phase torus with its flat distance d, and μ its normalized phase volume. Let Φ:R×TV→TV be a complete flow: it is continuous, Φ0 is the identity, and Φt+s=Φt∘Φs. An equilibrium q satisfies Φt(q)=q for every real t. Its point basin is B(q)={x∈TV:d(Φt(x),q)→0 as t→∞}.

For a nonempty invariant set C⊆TV, meaning Φt(C)=C for every real t, put d(x,C)=inf⁡c∈Cd(x,c). Its attraction set is B(C)={x∈TV:d(Φt(x),C)→0 as t→∞}. Both B(q) and B(C) are phase-measurable. In particular, μ(B(q)) and μ(B(C)) are well-defined probabilities under the uniform phase law.

For a specified family of equilibria Q, its aggregate point-basin volume means μ(⋃q∈QB(q)) when that union is phase-measurable. This is a measure of the union; an uncountable sum of point-basin volumes is not implied. If Q=C consists of equilibria, the union is contained in B(C), but equality requires an additional point-convergence assertion. Stability of C, including a rotation orbit of equilibria, alone does not supply point attraction. For a family of graphs, phase volume is normalized separately on the phase torus associated with each graph's vertex set. An almost-everywhere or probability-one attraction conclusion requires an argument establishing the relevant attraction and exceptional-set claim.

Facts & Assumptions

[F1]

The phase torus is a metric space with the stated distance, and the complete flow and attraction notions are as defined above (Finite phase tori, local lifts and the flat metric, Point stability, attraction and stability of a set).

[F2]

Under countable choice, normalized phase volume is a probability measure whose measurable sets form a sigma-algebra containing every open subset of the phase torus (Normalized phase volume and almost-everywhere assertions, Probability measures and probability spaces, The Axiom of Countable Choice (AC_ω)).

[F3]

The Borel sigma-algebra is generated by the open sets, and sigma-algebras are closed under countable unions and intersections (The Borel sigma-algebra of a topological space, Sigma-algebras are closed under countable intersections, differences, symmetric differences, and set limits).

[F4]

Every real number has an integer part: for each real a there is an integer k with k≤a<k+1 (Integer part: for every real x there is exactly one integer m with m ≤ x < m + 1).

[F5]

The product of two at most countable sets is at most countable, without a choice assumption (A product of two at most countable sets is at most countable).

[F6]

For every real ε>0 there is an integer m≥1 with 1/m<ε, by the reciprocal Archimedean property in the complete ordered field R (For every ε > 0 in a complete ordered field there is a natural n ≥ 1 with 1/n < ε).

[F7]

Mathematical induction holds for properties of nonnegative integers (The principle of mathematical induction).

Justification

Given: The phase space, measure, complete flow, equilibrium q, and nonempty invariant set C in the definition.

Goal: Verify the measurability and volume conventions and the stated distinction between set and point attraction.

1.1 For any nonempty C, the triangle inequality gives ∣d(u,C)−d(v,C)∣≤d(u,v): apply d(u,c)≤d(u,v)+d(v,c) for every c∈C, take the infimum, and exchange u,v. Thus x↦d(Φt(x),C) is continuous for fixed t, and t↦d(Φt(x),C) is continuous for fixed x. The same holds for d(Φt(x),q) by taking C={q}. Hence their sublevel sets with a weak inequality are closed. [F1, algebra]

1.2 Let D={k2−j:k,j∈N0}. By [F5], N0×N0 is at most countable. Listing its pairs and applying (k,j)↦k2−j lists all of D, with repetitions allowed, so D is countable. Also 2j≥j+1 for every j≥0: it holds at j=0, and the induction step is 2j+1≥2(j+1)≥j+2. Given η>0, choose m≥1 with 1/m<η by [F6]; for j≥m we have 2−j≤1/(j+1)≤1/m<η. Thus 2−j→0. [F5, F6, F7, algebra]

2.1 For t≥0, let kj be the integer part of 2jt. Then kj≥0 and rj=kj2−j∈D satisfies 0≤t−rj<2−j, so rj→t by step 1.2. This proves density in [0,∞). Moreover, if t≥N for an integer N≥0, the integer 2jN is at most 2jt, so kj≥2jN and rj≥N. Hence the approximating dyadics can always be taken in the same tail [N,∞). [F4, step 1.2, algebra]

3.1 For m≥1, N∈N0 and r∈D, write Em,r={x:d(Φr(x),C)≤1/m}. Then B(C)=⋂m≥1⋃N≥0⋂r∈D, r≥NEm,r. Indeed, convergence implies the right side: for each m, choose a real threshold T≥0 after which the distance is smaller than 1/m, and take N=⌊T⌋+1 using [F4]. Conversely, if x is in the right side, fix m and a corresponding N. For every real t≥N, step 2.1 supplies dyadics rj≥N tending to t. The weak bounds d(Φrj(x),C)≤1/m pass to t by the time continuity in step 1.1. Given ε>0, choose m with 1/m<ε by [F6]; the resulting bound for all t≥N proves convergence. [F4, F6, step 1.1, step 2.1, algebra]

4.1 Each Em,r is closed, hence Borel. The displayed expression is Borel by countable sigma-algebra closure and therefore phase-measurable, since the phase-measurable sigma-algebra contains all open sets. Repeating the argument with C={q} proves measurability of B(q). Their volumes are consequently defined by the probability measure μ. [F2, F3, step 1.1, step 1.2, step 3.1]

5.1 If q∈C, then d(y,C)≤d(y,q) for every y, so B(q)⊆B(C) and the same inclusion holds for the union over q∈C. Inclusion alone does not establish equality or measurability of an arbitrary uncountable union; the aggregate convention explicitly requires the latter. For the identity flow on the phase torus, every point is a stable equilibrium and the entire torus is a stable invariant set, while B(q)={q}: set stability therefore does not imply attraction to any prescribed point. The separate normalization and almost-everywhere conventions are those of phase volume and probability, and no convergence conclusion follows from their definitions alone. [F1, F2, step 4.1, algebra] ∎

Depends on

Used by · 3

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.