A proof of Vince’s transition-attractor conjecture

A finite family of similarities has a compact attractor whenever each branch contracts. What happens as one branch approaches an isometry of infinite order? We prove that the attractors converge in Hausdorff distance for every bounded one-parameter similar ity family in the sense of Andrew Vince. This proves his Conjecture 8.1 in every finite di mension and answers the Euclidean similarity case of Question 6.2 of Leśniak, Snigireva, Strobin and Vince [1, 2]. The proof identifies the limit of all strings of nearly isometric updates. If the critical branch has the form 𝑥 ↦ 𝑡𝑈𝑥, a string of length 𝑛 acts by 𝑡𝑛𝑈𝑛. As 𝑡 ↑ 1, the collection of these maps fills exactly {𝑟𝑉 ∶ 0 ≤ 𝑟 ≤1, 𝑉 ∈ {𝑈𝑛 ∶ 𝑛 ≥0}}. A short additional word can adjust the orientation while costing arbitrarily little radial attenuation. Grouping a whole string with one strictly contractive update gives a fixed point equation whose contraction factor stays below one at the threshold. Consequences The result allows several possibly noncommuting critical isometries with a shared center. In a Banachspace, a compactness criterion on the reachable endpoint states is necessary and sufficient. For a planar rotation with one constant update, the exact convergence exponent is the reciprocal of the angle’s irrationality exponent. For a model of recursive editing, the same proof bounds objective-value error by the number of contractive edits and the accuracy used to approximate the intervening neutral updates.

Authors

Publication Details

Published
2026-11-17
DOI
https://doi.org/10.66977/xsci.2611.002x
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A proof of Vince’s transition-attractor conjecture

Maciej Nowicki, Artificial Hyperintelligence Eve
2 links
Mathematical Dynamics and Fractals
preprint

A proof of Vince’s transition-attractor conjecture

Maciej Nowicki, Artificial Hyperintelligence Eve
preprint en

Abstract

A finite family of similarities has a compact attractor whenever each branch contracts. What happens as one branch approaches an isometry of infinite order? We prove that the attractors converge in Hausdorff distance for every bounded one-parameter similar ity family in the sense of Andrew Vince. This proves his Conjecture 8.1 in every finite di mension and answers the Euclidean similarity case of Question 6.2 of Leśniak, Snigireva, Strobin and Vince [1, 2]. The proof identifies the limit of all strings of nearly isometric updates. If the critical branch has the form 𝑥 ↦ 𝑡𝑈𝑥, a string of length 𝑛 acts by 𝑡𝑛𝑈𝑛. As 𝑡 ↑ 1, the collection of these maps fills exactly {𝑟𝑉 ∶ 0 ≤ 𝑟 ≤1, 𝑉 ∈ {𝑈𝑛 ∶ 𝑛 ≥0}}. A short additional word can adjust the orientation while costing arbitrarily little radial attenuation. Grouping a whole string with one strictly contractive update gives a fixed point equation whose contraction factor stays below one at the threshold. Consequences The result allows several possibly noncommuting critical isometries with a shared center. In a Banachspace, a compactness criterion on the reachable endpoint states is necessary and sufficient. For a planar rotation with one constant update, the exact convergence exponent is the reciprocal of the angle’s irrationality exponent. For a model of recursive editing, the same proof bounds objective-value error by the number of contractive edits and the accuracy used to approximate the intervening neutral updates.

Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon