Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Anosov plugs IV: strips, filling MS laminations, strong transversality, gluing maps

Definition
AnosovPlugs_Laminations

by Lucas · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

3-manifoldsanosov-flowsdynamical-systemshyperbolic-dynamics

Let (V,X)(V,X)(V,X) be as in the previous definitions.

  1. Accessible boundary of C⊂VC\subset VC⊂V: points p∉Cp\notin Cp∈/C which are the endpoint of an arc whose other points lie in CCC.
  2. Asymptotic lines. L1,L2L_1,L_2L1​,L2​ are asymptotic at both ends if they have continuous injective parametrisations c1,c2:R→Vc_1,c_2:\mathbb R\to Vc1​,c2​:R→V with (c1(t),c2(t))→(c_1(t),c_2(t))\to(c1​(t),c2​(t))→ diagonal as t→±∞t\to\pm\inftyt→±∞.
  3. Strip (Definition 3.11). A complementary component CCC of a lamination LLL is a strip if C≅R2C\cong\mathbb R^2C≅R2 and its accessible boundary consists of exactly two distinct leaves of LLL, asymptotic to each other at both ends.
  4. Filling MS laminations (Definition 3.18, Lemma 3.21). A hyperbolic plug has filling MS laminations if every component of ∂inV∖Ls\partial^{in}V\setminus L^s∂inV∖Ls is a strip for LsL^sLs and every component of ∂outV∖Lu\partial^{out}V\setminus L^u∂outV∖Lu is a strip for LuL^uLu.
  5. Transversality of leaves at ppp: the two leaves contain C¹ curves through ppp with linearly independent velocities.
  6. Strong transversality (Definition 3.25). L1,L2L_1,L_2L1​,L2​ on a surface SSS are strongly transverse if they are transverse at every point of L1∩L2L_1\cap L_2L1​∩L2​ and every component of S∖(L1∪L2)S\setminus(L_1\cup L_2)S∖(L1​∪L2​) is a disc whose closure is the image of [0,1]2[0,1]^2[0,1]2 by a C¹ immersion, injective on (0,1)2(0,1)^2(0,1)2, with [0,1]×{0,1}[0,1]\times\{0,1\}[0,1]×{0,1} mapped into leaves of L1L_1L1​ and {0,1}×[0,1]\{0,1\}\times[0,1]{0,1}×[0,1] into leaves of L2L_2L2​.
  7. Boundary diffeomorphism: φ\varphiφ maps SSS bijectively onto TTT, is C¹ along SSS and has a C¹ inverse along TTT.
  8. Strongly transverse gluing map (§1.3): a boundary diffeomorphism φ:∂outV→∂inV\varphi:\partial^{out}V\to\partial^{in}Vφ:∂outV→∂inV such that φ∗(LXu)\varphi_*(L^u_X)φ∗​(LXu​) and LXsL^s_XLXs​ are strongly transverse.

Formalization Note The MS properties (finitely many compact leaves, asymptotic half-leaves, contracting holonomy) hold automatically for the laminations of hyperbolic plugs (Proposition 3.8), so by Lemma 3.21 only the strip condition is imposed.

Definition code
import Mathlib
import Definitions.Def_AnosovPlugs_Plugs

/-!
Béguin–Bonatti–Yu, *Building Anosov flows on 3-manifolds*, Geom. Topol. 21 (2017).
Strips and hyperbolic plugs with filling MS laminations (Definitions 3.11, 3.18, Lemma 3.21),
transversality and strong transversality of laminations (Definition 3.25), boundary
diffeomorphisms and strongly transverse gluing maps (§1.3).
-/

open scoped Manifold ContDiff Topology
open Set Filter Function

namespace AnosovPlugs

variable {M : Type} [TopologicalSpace M] [ChartedSpace (EuclideanHalfSpace 3) M]
  [IsManifold I3 ∞ M]

/-- The accessible boundary of `C ⊆ M`: the points `p ∉ C` which are an endpoint of an arc
(a continuous injective image of `[0,1]`) whose other points all lie in `C`. -/
def accessibleBoundary (C : Set M) : Set M :=
  {p | p ∉ C ∧ ∃ γ : ℝ → M, ContinuousOn γ (Icc 0 1) ∧ InjOn γ (Icc 0 1) ∧ γ 0 = p ∧
    γ '' Ioc 0 1 ⊆ C}

/-- `L₁` and `L₂` are (non-compact) lines asymptotic to each other at both ends: they admit
continuous injective parametrisations `c₁, c₂ : ℝ → M` with `(c₁ t, c₂ t)` tending to the
diagonal both as `t → +∞` and as `t → -∞`. -/
def AsymptoticLines (L₁ L₂ : Set M) : Prop :=
  ∃ c₁ c₂ : ℝ → M, Continuous c₁ ∧ Continuous c₂ ∧ Injective c₁ ∧ Injective c₂ ∧
    range c₁ = L₁ ∧ range c₂ = L₂ ∧
    Tendsto (fun t => (c₁ t, c₂ t)) atTop (𝓝ˢ (diagonal M)) ∧
    Tendsto (fun t => (c₁ t, c₂ t)) atBot (𝓝ˢ (diagonal M))

/-- Definition 3.11: a complementary component `C` of a lamination `L` (whose leaf through a
point `p ∈ L` is `leaf p`) is a strip if `C` is homeomorphic to `ℝ²` and its accessible
boundary consists of exactly two distinct leaves of `L`, which are non-compact lines asymptotic
to each other at both ends. -/
def IsStrip (L : Set M) (leaf : M → Set M) (C : Set M) : Prop :=
  Nonempty (C ≃ₜ ℝ × ℝ) ∧ ∃ p₁ ∈ L, ∃ p₂ ∈ L, leaf p₁ ≠ leaf p₂ ∧
    accessibleBoundary C = leaf p₁ ∪ leaf p₂ ∧ AsymptoticLines (leaf p₁) (leaf p₂)

/-- The entrance and exit laminations of `X` are filling (Definition 3.18, Lemma 3.21): every
connected component of `∂^{in} M ∖ L^s` is a strip for the entrance lamination `L^s`, and every
connected component of `∂^{out} M ∖ L^u` is a strip for the exit lamination `L^u`. -/
def HasFillingLaminations (X : (x : M) → TangentSpace I3 x) : Prop :=
  (∀ p ∈ inBoundary X \ entranceLamination X,
      IsStrip (entranceLamination X) (entranceLeaf X)
        (connectedComponentIn (inBoundary X \ entranceLamination X) p)) ∧
    (∀ p ∈ outBoundary X \ exitLamination X,
      IsStrip (exitLamination X) (exitLeaf X)
        (connectedComponentIn (outBoundary X \ exitLamination X) p))

/-- A hyperbolic plug with filling MS laminations (Definition 3.18, Lemma 3.21). (For hyperbolic
plugs the MS-lamination properties of `L^s`, `L^u` hold automatically, Proposition 3.8, so only
the strip condition on complementary components is imposed.) -/
def IsFillingHyperbolicPlug (X : (x : M) → TangentSpace I3 x) : Prop :=
  IsHyperbolicPlug X ∧ HasFillingLaminations X

/-- Two leaves `ℓ₁, ℓ₂` through `p` are transverse at `p`: they contain C¹ curves through `p`
(at time `0`) whose velocity vectors at `p` are linearly independent. -/
def CurvesTransverseAt (ℓ₁ ℓ₂ : Set M) (p : M) : Prop :=
  ∃ c₁ c₂ : ℝ → M, c₁ 0 = p ∧ c₂ 0 = p ∧ range c₁ ⊆ ℓ₁ ∧ range c₂ ⊆ ℓ₂ ∧
    ContMDiff 𝓘(ℝ, ℝ) I3 1 c₁ ∧ ContMDiff 𝓘(ℝ, ℝ) I3 1 c₂ ∧
    LinearIndependent ℝ ![(mfderiv 𝓘(ℝ, ℝ) I3 c₁ 0 1 : EuclideanSpace ℝ (Fin 3)),
      (mfderiv 𝓘(ℝ, ℝ) I3 c₂ 0 1 : EuclideanSpace ℝ (Fin 3))]

/-- Second item of Definition 3.25: `C` is a disc whose closure is the image of the square
`[0,1]²` by a C¹ immersion `F` which is injective on `(0,1)²` with `F((0,1)²) = C`, such that
`[0,1] × {0}` and `[0,1] × {1}` are mapped into leaves of `L₁` and `{0} × [0,1]`,
`{1} × [0,1]` into leaves of `L₂`. -/
def IsSquareComponent (L₁ L₂ : Set M) (leaf₁ leaf₂ : M → Set M) (C : Set M) : Prop :=
  ∃ F : ℝ × ℝ → M,
    ContMDiffOn 𝓘(ℝ, ℝ × ℝ) I3 1 F (Icc 0 1 ×ˢ Icc 0 1) ∧
    (∀ z ∈ Icc (0 : ℝ) 1 ×ˢ Icc (0 : ℝ) 1,
      Injective (mfderivWithin 𝓘(ℝ, ℝ × ℝ) I3 F (Icc 0 1 ×ˢ Icc 0 1) z)) ∧
    InjOn F (Ioo 0 1 ×ˢ Ioo 0 1) ∧ F '' (Ioo 0 1 ×ˢ Ioo 0 1) = C ∧
    F '' (Icc 0 1 ×ˢ Icc 0 1) = closure C ∧
    (∃ p ∈ L₁, F '' (Icc 0 1 ×ˢ {0}) ⊆ leaf₁ p) ∧ (∃ p ∈ L₁, F '' (Icc 0 1 ×ˢ {1}) ⊆ leaf₁ p) ∧
    (∃ p ∈ L₂, F '' ({0} ×ˢ Icc 0 1) ⊆ leaf₂ p) ∧ (∃ p ∈ L₂, F '' ({1} ×ˢ Icc 0 1) ⊆ leaf₂ p)

/-- Definition 3.25: the laminations `L₁, L₂` of the surface `S` (with leaf maps `leaf₁`,
`leaf₂`) are strongly transverse: their leaves are transverse at every point of `L₁ ∩ L₂`, and
every connected component of `S ∖ (L₁ ∪ L₂)` is a square component. -/
def StronglyTransverse (S L₁ L₂ : Set M) (leaf₁ leaf₂ : M → Set M) : Prop :=
  (∀ p ∈ L₁ ∩ L₂, CurvesTransverseAt (leaf₁ p) (leaf₂ p) p) ∧
    ∀ p ∈ S \ (L₁ ∪ L₂),
      IsSquareComponent L₁ L₂ leaf₁ leaf₂ (connectedComponentIn (S \ (L₁ ∪ L₂)) p)

/-- `T` is a union of connected components of `S`. -/
def IsUnionOfComponents (T S : Set M) : Prop :=
  T ⊆ S ∧ ∀ p ∈ T, connectedComponentIn S p ⊆ T

variable {N : Type} [TopologicalSpace N] [ChartedSpace (EuclideanHalfSpace 3) N]
  [IsManifold I3 ∞ N]

/-- `φ` restricts to a C¹ diffeomorphism from `S ⊆ M` onto `T ⊆ N`: it maps `S` bijectively
onto `T`, is C¹ along `S`, and has an inverse `T → S` which is C¹ along `T`. -/
def IsBoundaryDiffeo (φ : M → N) (S : Set M) (T : Set N) : Prop :=
  BijOn φ S T ∧ ContMDiffOn I3 I3 1 φ S ∧
    ∃ ψ : N → M, ContMDiffOn I3 I3 1 ψ T ∧ (∀ x ∈ S, ψ (φ x) = x) ∧ ∀ y ∈ T, φ (ψ y) = y

/-- Leaves of the image lamination `φ_*(L)`: the leaf through `p` is the image under `φ` of the
leaf through the (unique, when `φ` is injective on `S`) preimage `q ∈ S` of `p`. -/
def pushLeaf (φ : M → N) (S : Set M) (leaf : M → Set M) (p : N) : Set N :=
  ⋃ q ∈ {q | q ∈ S ∧ φ q = p}, φ '' leaf q

/-- `φ : ∂^{out} M → ∂^{in} M` is a strongly transverse gluing diffeomorphism for `(M, X)`: a
C¹ diffeomorphism from the exit boundary onto the entrance boundary such that `φ_*(L^u_X)` and
`L^s_X` are strongly transverse on `∂^{in} M`. -/
def IsStronglyTransverseGluing (X : (x : M) → TangentSpace I3 x) (φ : M → M) : Prop :=
  IsBoundaryDiffeo φ (outBoundary X) (inBoundary X) ∧
    StronglyTransverse (inBoundary X) (φ '' exitLamination X) (entranceLamination X)
      (pushLeaf φ (outBoundary X) (exitLeaf X)) (entranceLeaf X)

end AnosovPlugs
Source
F. Béguin, C. Bonatti, B. Yu, *Building Anosov flows on 3-manifolds*, Geom. Topol. 21 (2017) 1837–1930, https://doi.org/10.2140/gt.2017.21.1837, Definitions 3.11 (p. 1855), 3.18 and Lemma 3.21 (pp. 1858–1859), Definition 3.25 (pp. 1861–1862), §1.3
Read-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.

MMM, NNN: charted spaces over the half-space {x0≥0}⊂R3\{x_0\ge0\}\subset\mathbb R^3{x0​≥0}⊂R3 with C∞C^\inftyC∞ structures.

  • accessibleBoundary CCC ={p∉C:∃γ:R→M=\{p\notin C : \exists\gamma:\mathbb R\to M={p∈/C:∃γ:R→M continuous and injective on [0,1][0,1][0,1], γ(0)=p\gamma(0)=pγ(0)=p, γ((0,1])⊆C}\gamma((0,1])\subseteq C\}γ((0,1])⊆C}.
  • AsymptoticLines L1 L2L_1\,L_2L1​L2​: there are continuous injective c1,c2:R→Mc_1,c_2:\mathbb R\to Mc1​,c2​:R→M with images exactly L1L_1L1​, L2L_2L2​, such that (c1(t),c2(t))(c_1(t),c_2(t))(c1​(t),c2​(t)) tends to the diagonal of M×MM\times MM×M both as t→+∞t\to+\inftyt→+∞ and as t→−∞t\to-\inftyt→−∞.
  • IsStrip LLL leaf CCC: CCC (as a subspace) is homeomorphic to R×R\mathbb R\times\mathbb RR×R, and there are p1,p2∈Lp_1,p_2\in Lp1​,p2​∈L with leaf p1≠p_1\neqp1​= leaf p2p_2p2​, accessibleBoundary CCC === leaf p1∪p_1\cupp1​∪ leaf p2p_2p2​, and AsymptoticLines (leaf p1p_1p1​) (leaf p2p_2p2​).
  • HasFillingLaminations XXX: for every p∈p\inp∈ inBoundary X∖X\setminusX∖ entranceLamination XXX, the connected component of ppp in inBoundary X∖X\setminusX∖ entranceLamination XXX is a strip (for L=L=L= entranceLamination XXX with leaves entranceLeaf XXX); and for every p∈p\inp∈ outBoundary X∖X\setminusX∖ exitLamination XXX the analogous component is a strip for exitLamination XXX with leaves exitLeaf XXX. (Vacuous if the laminations fill the boundary.)
  • IsFillingHyperbolicPlug XXX: IsHyperbolicPlug XXX and HasFillingLaminations XXX. No separate MS-lamination condition is imposed.
  • CurvesTransverseAt ℓ1 ℓ2 p\ell_1\,\ell_2\,pℓ1​ℓ2​p: there are C1C^1C1 maps c1,c2:R→Mc_1,c_2:\mathbb R\to Mc1​,c2​:R→M with ci(0)=pc_i(0)=pci​(0)=p, image of cic_ici​ contained in ℓi\ell_iℓi​, and the two velocity vectors c1′(0),c2′(0)c_1'(0),c_2'(0)c1′​(0),c2′​(0) (as vectors of R3\mathbb R^3R3 in the chart at ppp) linearly independent.
  • IsSquareComponent L1 L2L_1\,L_2L1​L2​ leaf1_11​ leaf2_22​ CCC: there is F:R2→MF:\mathbb R^2\to MF:R2→M, C1C^1C1 on Q=[0,1]2Q=[0,1]^2Q=[0,1]2, with injective derivative (within QQQ) at every point of QQQ, injective on (0,1)2(0,1)^2(0,1)2, F((0,1)2)=CF((0,1)^2)=CF((0,1)2)=C, F(Q)=C‾F(Q)=\overline CF(Q)=C, and F([0,1]×{0})F([0,1]\times\{0\})F([0,1]×{0}), F([0,1]×{1})F([0,1]\times\{1\})F([0,1]×{1}) each contained in leaf1(p)_1(p)1​(p) for some p∈L1p\in L_1p∈L1​, F({0}×[0,1])F(\{0\}\times[0,1])F({0}×[0,1]), F({1}×[0,1])F(\{1\}\times[0,1])F({1}×[0,1]) each contained in leaf2(p)_2(p)2​(p) for some p∈L2p\in L_2p∈L2​.
  • StronglyTransverse S L1 L2S\,L_1\,L_2SL1​L2​ leaf1_11​ leaf2_22​: CurvesTransverseAt (leaf1p_1 p1​p) (leaf2p_2 p2​p) ppp for all p∈L1∩L2p\in L_1\cap L_2p∈L1​∩L2​, and for every p∈S∖(L1∪L2)p\in S\setminus(L_1\cup L_2)p∈S∖(L1​∪L2​) the connected component of ppp in S∖(L1∪L2)S\setminus(L_1\cup L_2)S∖(L1​∪L2​) is a square component.
  • IsUnionOfComponents T ST\,STS: T⊆ST\subseteq ST⊆S and for each p∈Tp\in Tp∈T the connected component of ppp in SSS lies in TTT.
  • IsBoundaryDiffeo φ S T\varphi\,S\,TφST (φ:M→N\varphi:M\to Nφ:M→N): φ\varphiφ is a bijection S→TS\to TS→T, φ\varphiφ is C1C^1C1 on SSS in Mathlib's "within SSS" sense, and some ψ:N→M\psi:N\to Mψ:N→M is C1C^1C1 within TTT with ψ∘φ=id\psi\circ\varphi=\mathrm{id}ψ∘φ=id on SSS and φ∘ψ=id\varphi\circ\psi=\mathrm{id}φ∘ψ=id on TTT.
  • pushLeaf φ S\varphi\,SφS leaf ppp =⋃{φ(leaf q):q∈S, φ(q)=p}=\bigcup\{\varphi(\mathrm{leaf}\,q) : q\in S,\ \varphi(q)=p\}=⋃{φ(leafq):q∈S, φ(q)=p}.
  • IsStronglyTransverseGluing X φX\,\varphiXφ (φ:M→M\varphi:M\to Mφ:M→M): IsBoundaryDiffeo φ\varphiφ (outBoundary XXX) (inBoundary XXX), and StronglyTransverse on S=S=S= inBoundary XXX of L1=φ(exitLamination X)L_1=\varphi(\text{exitLamination }X)L1​=φ(exitLamination X) (leaves pushLeaf φ\varphiφ (outBoundary XXX) (exitLeaf XXX)) and L2=L_2=L2​= entranceLamination XXX (leaves entranceLeaf XXX).
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me