OAI/GroupTheory/PolycyclicRecognition/Analysis/RecognitionFromCanonicalAffine.lean

GitHub source file

2 declarations, 0 contain sorry, 0 declared as axioms

Recognition from affine control of canonical Lie height

A uniform affine-height estimate combines with polynomial bounded-height packing and the comparison group's Poincare-duality data to give the recognition conclusions.

  1. theorem OAI.PolycyclicRecognition.recognition_and_lattice_of_canonical_affine_height line 22

    Source documentation

    Canonical height supplies bounded-height packing for the two recognition conclusions under a uniform affine-height estimate.

    theorem recognition_and_lattice_of_canonical_affine_height
        (dekimpe : DekimpeLatticeRealizationInput)
        (liFP : LiFinitenessInput) (eaFP : ElementaryAmenableFinitenessInput)
        (liPD : LiDualityInput) (bieri : BieriDualityInput)
        {P J : Type} [Group P] [Group J] [MetricSpace P] [MetricSpace J]
        [IsIsometricSMul P P] [IsIsometricSMul J J] [Group.FG P] [Group.FG J]
        [DiscreteTopology J] [ProperSpace J]
        [MeasurableSpace J] [BorelSpace J] [MeasurableMul J]
        (e : MetricQuasiEquivalence P J) (hP : IsVirtuallyPolycyclic P)
        (hPfinite : ∀ R : ℝ, (Metric.closedBall (1 : P) R).Finite)
        {E G : Type} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
        [MetricSpace G] [ChartedSpace E G] [Group G] [LieGroup (𝓘(ℝ, E)) ⊤ G]
    …

    Mentions: OAI.PolycyclicRecognition.DekimpeLatticeRealizationInput, OAI.PolycyclicRecognition.LiFinitenessInput, OAI.PolycyclicRecognition.ElementaryAmenableFinitenessInput, OAI.PolycyclicRecognition.LiDualityInput, OAI.PolycyclicRecognition.BieriDualityInput, OAI.PolycyclicRecognition.MetricQuasiEquivalence

  2. theorem OAI.PolycyclicRecognition.recognition_and_lattice_of_template_affine_height line 65

    Source documentation

    The geometric theorem's template symmetry labels have finite image by the proved support-polytope argument. This removes the separate finite image premise from the finiteness and duality endgame.

    theorem recognition_and_lattice_of_template_affine_height
        (dekimpe : DekimpeLatticeRealizationInput)
        (liFP : LiFinitenessInput) (eaFP : ElementaryAmenableFinitenessInput)
        (liPD : LiDualityInput) (bieri : BieriDualityInput)
        {P J : Type} [Group P] [Group J] [MetricSpace P] [MetricSpace J]
        [IsIsometricSMul P P] [IsIsometricSMul J J] [Group.FG P] [Group.FG J]
        [DiscreteTopology J] [ProperSpace J]
        [MeasurableSpace J] [BorelSpace J] [MeasurableMul J]
        (e : MetricQuasiEquivalence P J) (hP : IsVirtuallyPolycyclic P)
        (hPfinite : ∀ R : ℝ, (Metric.closedBall (1 : P) R).Finite)
        {E G : Type} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]
        [MetricSpace G] [ChartedSpace E G] [Group G] [LieGroup (𝓘(ℝ, E)) ⊤ G]
    …

    Mentions: OAI.PolycyclicRecognition.DekimpeLatticeRealizationInput, OAI.PolycyclicRecognition.LiFinitenessInput, OAI.PolycyclicRecognition.ElementaryAmenableFinitenessInput, OAI.PolycyclicRecognition.LiDualityInput, OAI.PolycyclicRecognition.BieriDualityInput, OAI.PolycyclicRecognition.MetricQuasiEquivalence