SinTan1729/comm_alg
1
0
Fork 0
mirror of https://github.com/GTBarkley/comm_alg.git synced 2024-12-26 07:38:36 -06:00
Code Issues Projects Releases Packages Wiki Activity

version of 06/15

Browse source
This commit is contained in:
chelseaandmadrid 2023-06-15 23:29:40 -07:00
parent 25b85edbea
commit ed83762764
1 changed files with 7 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
FinalPolyType.lean
View file

@ -20,6 +20,7 @@ macro "obviously" : tactic =>
| ring; done; dbg_trace "it was ring" | ring; done; dbg_trace "it was ring"
| trivial; done; dbg_trace "it was trivial" | trivial; done; dbg_trace "it was trivial"
| aesop; done; dbg_trace "it was aesop" | aesop; done; dbg_trace "it was aesop"
| assumption; done; dbg_trace "it was assumption"
-- | nlinarith; done -- | nlinarith; done
| fail "No, this is not obvious.")) | fail "No, this is not obvious."))
@ -164,6 +165,9 @@ lemma Δ_0 (f : ℤ → ℤ) : (Δ f 0) = f := by tauto
-- Δ of 1 times decreaes the polynomial type by one -- Δ of 1 times decreaes the polynomial type by one
lemma Δ_1 (f : ℤ → ℤ) (d : ℕ) : PolyType f (d + 1) → PolyType (Δ f 1) d := by lemma Δ_1 (f : ℤ → ℤ) (d : ℕ) : PolyType f (d + 1) → PolyType (Δ f 1) d := by
intro h
simp only [PolyType, Δ, Int.cast_sub, exists_and_right]
rcases h with ⟨Poly, N, h⟩
sorry sorry
-- The "reverse" of Δ of 1 times increases the polynomial type by one -- The "reverse" of Δ of 1 times increases the polynomial type by one
@ -172,7 +176,9 @@ lemma Δ_1_ (f : ℤ → ℤ) (d : ℕ) : PolyType (Δ f 1) d → PolyType f (d
-- Δ of d times maps polynomial of degree d to polynomial of degree 0 -- Δ of d times maps polynomial of degree d to polynomial of degree 0
lemma Δ_1_s_equiv_Δ_s_1 (f : ℤ → ℤ) (s : ℕ) : Δ (Δ f 1) s = (Δ f (s + 1)) := by lemma Δ_1_s_equiv_Δ_s_1 (f : ℤ → ℤ) (s : ℕ) : Δ (Δ f 1) s = (Δ f (s + 1)) := by
sorry induction' s with s hs
· norm_num
· aesop
lemma foofoo (d : ℕ) : (f : ℤ → ℤ) → (PolyType f d) → (PolyType (Δ f d) 0):= by lemma foofoo (d : ℕ) : (f : ℤ → ℤ) → (PolyType f d) → (PolyType (Δ f d) 0):= by
induction' d with d hd induction' d with d hd
· intro f h · intro f h
@ -232,8 +238,6 @@ lemma foo (d : ℕ) : (f : ℤ → ℤ) → (∃ (c : ℤ), ∃ (N : ℤ), (∀
tauto tauto
lemma a_to_b (f : ℤ → ℤ) (d : ℕ) : (∃ (c : ℤ), ∃ (N : ℤ), (∀ (n : ℤ), N ≤ n → (Δ f d) (n) = c) ∧ c ≠ 0) → PolyType f d := fun h => (foo d f) h lemma a_to_b (f : ℤ → ℤ) (d : ℕ) : (∃ (c : ℤ), ∃ (N : ℤ), (∀ (n : ℤ), N ≤ n → (Δ f d) (n) = c) ∧ c ≠ 0) → PolyType f d := fun h => (foo d f) h
-- [BH, 4.1.2] (a) <= (b) -- [BH, 4.1.2] (a) <= (b)