Skip to content

Commit

Permalink
H92 brake fixed
Browse files Browse the repository at this point in the history
  • Loading branch information
CBirkbeck committed Dec 1, 2023
1 parent 12f0122 commit f66599a
Showing 1 changed file with 12 additions and 12 deletions.
24 changes: 12 additions & 12 deletions FltRegular/NumberTheory/Hilbert92.lean
Original file line number Diff line number Diff line change
Expand Up @@ -289,9 +289,9 @@ lemma norm_map_inv (z : K) : Algebra.norm k z⁻¹ = (Algebra.norm k z)⁻¹ :=
lemma torsion_free_lin_system [Algebra k K] (h : Monoid.IsTorsionFree (𝓞 K)ˣ)
(ι : Fin (NumberField.Units.rank k + 1) → Additive (𝓞 k)ˣ) :
∃ (a : (Fin (NumberField.Units.rank k + 1) → ℤ)) (i : Fin (NumberField.Units.rank k + 1)),
¬ ((p : ℤ) ∣ a i) ∧ ∑ i in ⊤, (a i) • (ι i) = 0 := by
¬ ((p : ℤ) ∣ a i) ∧ ∑ i in ⊤, (a i) • (ι i) = 0 := by sorry


sorry

variable (k)

Expand All @@ -314,33 +314,32 @@ lemma lh_pow_free [Algebra k K] [IsGalois k K] [FiniteDimensional k K] (h : ℕ
∃ (a : ℤ) (ι : Fin (NumberField.Units.rank k + 2) → ℤ) (i : Fin (NumberField.Units.rank k + 2)),
∑ i in ⊤, ι i • (η i) = (a*p) • (Additive.ofMul ζ) ∧ ¬ ((p : ℤ) ∣ ι i) := by sorry


lemma h_exists : ∃ (h : ℕ) (ζ : (𝓞 k)ˣ),
IsPrimitiveRoot ζ (p^h) ∧ ∀ ε : k, ¬ IsPrimitiveRoot ε (p^(h+1)) := by sorry

lemma Hilbert92ish
[Algebra k K] [IsGalois k K] [FiniteDimensional k K] [IsCyclic (K ≃ₐ[k] K)]
(hKL : finrank k K = p) (σ : K ≃ₐ[k] K) (hσ : ∀ x, x ∈ Subgroup.zpowers σ) :
∃ η : (𝓞 K)ˣ, Algebra.norm k (η : K) = 1 ∧ ∀ ε : (𝓞 K)ˣ, (η : K) ≠ ε / (σ ε : K) := by sorry




/-
lemma Hilbert92ish
[Algebra k K] [IsGalois k K] [FiniteDimensional k K] [IsCyclic (K ≃ₐ[k] K)]
(hKL : finrank k K = p) (σ : K ≃ₐ[k] K) (hσ : ∀ x, x ∈ Subgroup.zpowers σ) (hp : Nat.Prime p) :
∃ η : (𝓞 K)ˣ, Algebra.norm k (η : K) = 1 ∧ ∀ ε : (𝓞 K)ˣ, (η : K) ≠ ε / (σ ε : K) := by
obtain ⟨h, ζ, hζ⟩:= h_exists p (k := k)
by_cases H : ∀ ε : (𝓞 K)ˣ, (algebraMap k K ζ) ≠ ε / (σ ε : K)
sorry
simp at H
obtain ⟨ E, hE⟩:= H
let NE := Units.map (RingOfIntegers.norm k ) E
obtain ⟨S, hS⟩ := Hilbert91ish p (K := K) (k := k) hp

obtain ⟨S, hS⟩ := Hilbert91ish p (K := K) (k := k) _
let H := unitlifts p (K:= K) (k:=k) S
let N : Fin (NumberField.Units.rank k + 1) → Additive (𝓞 k)ˣ :=
fun e => Additive.ofMul (Units.map (RingOfIntegers.norm k )) (Additive.toMul (H e))
let η : Fin (NumberField.Units.rank k + 2) → Additive (𝓞 k)ˣ := Fin.cons (Additive.ofMul NE) N
obtain ⟨a, ι,i, ha⟩ := lh_pow_free p h ζ (k := k) (K:= K) hζ.1 hζ.2 η

sorry
/-
have S := @Hilbert91ish p K _ k _ _ _ _ σ
Expand All @@ -350,7 +349,8 @@ lemma Hilbert92ish
fun e => Additive.ofMul (Units.map (RingOfIntegers.norm k )) (Additive.toMul (H e))
let η : Fin (NumberField.Units.rank k + 2) → Additive (𝓞 k)ˣ := Fin.cons (Additive.ofMul NE) N
obtain ⟨a, ι,i, ha⟩ := lh_pow_free p h ζ (k := k) (K:= K) hζ.1 hζ.2 η
/-
have S := @Hilbert91ish p K _ k _ _ _ _ σ
obtain ⟨S, hS⟩ := S
let H := @unitlifts p K _ k _ _ _ S
Expand Down Expand Up @@ -383,7 +383,7 @@ lemma Hilbert92ish
by_contra h
simp at h
-/
-/



Expand Down

0 comments on commit f66599a

Please sign in to comment.