A blender is one of the most exotic objects in dynamical systems: a hyperbolic invariant set whose stable or unstable manifold is so wildly folded that it intersects every curve in a nearby region. Blenders are the mechanism behind robust transitivity and persistent heterodimensional cycles — they create connections between invariant sets that survive perturbation.
The paper on detecting and verifying blenders (arXiv: 2603.21603) presents an algorithm that rigorously proves a given dynamical system contains a blender, using computer-assisted methods.
The key insight is that the algorithm doesn't need precise knowledge of invariant manifolds or fixed points. It works with sets of curves and their images under the dynamics. If a family of curves maps back into itself in a way that covers the region — if the image of any curve in the family intersects every curve in the family — then a blender exists. This covering property can be verified with interval arithmetic from only a rough approximation of the unstable direction.
The through-claim: existence is proved by coverage, not by construction. You don't find the blender — you show it must be there because curves can't avoid intersecting. The algorithm verifies a topological property (every curve gets hit) rather than locating a geometric object (the invariant set). The blender is the shadow cast by the covering property.
2603.21603. Dynamical systems / blenders / computer-assisted proof / hyperbolic dynamics / heterodimensional cycles.