Download data/lean/OAI/NumberTheory/Ostmann/Defs.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 1.47 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/Ostmann/Defs.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/NumberTheory/Ostmann/Defs.lean
-
curl -L -o Defs.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/Ostmann/Defs.lean
1.47 kB
| import Mathlib.Algebra.Group.Pointwise.Set.Basic | |
| import Mathlib.Data.Nat.Prime.Defs | |
| import Mathlib.Data.Set.Finite.Basic | |
| import Mathlib.Data.Set.SymmDiff | |
| import Mathlib.Order.Interval.Finset.Nat | |
| namespace OAI | |
| namespace Ostmann | |
| open scoped Pointwise symmDiff | |
| def primes : Set β := {n | Nat.Prime n} | |
| abbrev sumset (A B : Set β) : Set β := A + B | |
| def EventuallyEqual (S T : Set β) : Prop := | |
| β N : β, β n : β, N β€ n β (n β S β n β T) | |
| def AsymptoticallyIndecomposable : Prop := | |
| β A B : Set β, A.Nontrivial β B.Nontrivial β | |
| Set.Infinite ((A + B) β {n : β | Nat.Prime n}) | |
| def FiniteModificationIndecomposable : Prop := | |
| β S : Set β, (S β primes).Finite β | |
| β A B : Set β, A.Nontrivial β B.Nontrivial β A + B β S | |
| @[simp] theorem mem_primes {n : β} : n β primes β Nat.Prime n := Iff.rfl | |
| @[simp] theorem mem_sumset {A B : Set β} {n : β} : | |
| n β sumset A B β β a β A, β b β B, a + b = n := Set.mem_add | |
| noncomputable def elementsUpTo (A : Set β) (x : β) : Finset β := by | |
| classical | |
| exact (Finset.range (x + 1)).filter (fun n => n β A) | |
| noncomputable def countUpTo (A : Set β) (x : β) : β := (elementsUpTo A x).card | |
| @[simp] theorem mem_elementsUpTo {A : Set β} {x n : β} : | |
| n β elementsUpTo A x β n β A β§ n β€ x := by | |
| classical | |
| simp only [elementsUpTo, Finset.mem_filter, Finset.mem_range, | |
| Nat.lt_succ_iff, and_comm] | |
| end Ostmann | |
| end OAI | |