Proposition 1.6 (Béguin–Bonatti–Yu): combinatorial transitivity implies transitivity of the glued Anosov flow
OpenAnosovPlugs.prop_1_6_combinatorial_transitivityUnder the hypotheses of Theorem 1.5, if is combinatorially transitive (the oriented graph on the basic pieces of , with edges given by intersections inside or across the gluing , is strongly connected), then the Anosov vector field produced by Theorem 1.5 is transitive:
Formalization Note Stated as a strengthening of the conclusion of Theorem 1.5: the plug and gluing map can be chosen so that, in addition, every induced field on any realisation of is hyperbolic on the whole manifold and has a dense orbit.
import Mathlib import Definitions.Def_AnosovPlugs_Gluing open scoped Manifold ContDiff Topology open Set
namespace AnosovPlugs
theorem prop_1_6_combinatorial_transitivity {U : Type} [TopologicalSpace U] [ChartedSpace (EuclideanHalfSpace 3) U]
[IsManifold I3 ∞ U] [T2Space U] [CompactSpace U]
(X : (x : U) → TangentSpace I3 x) (φ : U → U)
(hX : IsFillingHyperbolicPlug X) (hXnoAR : NoAttractorNorRepeller X)
(hφ : IsStronglyTransverseGluing X φ) (hcomb : IsCombinatoriallyTransitive X φ) :
∃ (Y : (x : U) → TangentSpace I3 x) (ψ : U → U),
IsFillingHyperbolicPlug Y ∧ IsStronglyTransverseGluing Y ψ ∧ StronglyIsotopic X φ Y ψ ∧
∀ (N : Type) [TopologicalSpace N] [ChartedSpace (EuclideanHalfSpace 3) N]
[IsManifold I3 ∞ N] [T2Space N] [CompactSpace N] [BoundarylessManifold I3 N]
(Z : (y : N) → TangentSpace I3 y) (q : U → N),
IsSelfGluing Y ψ Z q → IsHyperbolicSet Z univ ∧ IsTransitiveFlow Z := by sorry
end AnosovPlugsRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; non-blind
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source paper and of the intended meaning. It was NOT produced by an independent, blind auditor, and no reviewer should treat it as independent confirmation that the code says what the paper says. Compare it against the Lean code yourself.
Same variables and hypotheses 1–3 as Theorem 1.5, plus IsCombinatoriallyTransitive : for any two basic pieces of (nonempty closed invariant subsets of the nonwandering set, relatively open in it, with a dense orbit), is reachable from by finitely many PieceEdge steps (unstable set of one meets stable set of the next, or maps a point of unstableSetOf outBoundary to a point of stableSetOf inBoundary).
Conclusion: there exist , with IsFillingHyperbolicPlug , IsStronglyTransverseGluing , StronglyIsotopic , and for every type with a topology, charted-space structure over the half-space, manifold structure, Hausdorff, compact and boundaryless, every vector field on (no regularity assumed) and every map satisfying IsSelfGluing (i.e. is a surjective map with injective derivative everywhere, iff or one of them lies in outBoundary and sends it to the other, and for all ), both IsHyperbolicSet (univ) and IsTransitiveFlow hold.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.