math / data /lean /ComparatorChallenges /OstmannComplete.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.09 kB
import Mathlib
namespace OAI
open scoped Pointwise symmDiff
namespace Ostmann
def primes : Set β„• := {n | Nat.Prime n}
abbrev sumset (A B : Set β„•) : Set β„• := A + B
def EventuallyPrimeSumset (A B : Set β„•) : Prop :=
βˆƒ N : β„•, βˆ€ n, N ≀ n β†’ (n ∈ sumset A B ↔ n.Prime)
def TwoInfiniteSummandsImpossible : Prop :=
βˆ€ A B : Set β„•, A.Infinite β†’ B.Infinite β†’ Β¬ EventuallyPrimeSumset A B
def InverseGoldbach : Prop :=
βˆ€ A B : Set β„•, A.Nontrivial β†’ B.Nontrivial β†’
Set.Infinite (@symmDiff (Set β„•)
(@SemilatticeSup.toMax (Set β„•)
(@Lattice.toSemilatticeSup (Set β„•)
(@CompleteLattice.toLattice (Set β„•)
(@CompleteBooleanAlgebra.toCompleteLattice (Set β„•)
(@CompleteAtomicBooleanAlgebra.toCompleteBooleanAlgebra (Set β„•)
(@Set.instCompleteAtomicBooleanAlgebra β„•))))))
Set.instSDiff (sumset A B) primes)
theorem inverseGoldbach : InverseGoldbach := by
sorry
theorem twoInfiniteSummandsImpossible : TwoInfiniteSummandsImpossible := by
sorry
end Ostmann
end OAI