Download data/lean/OAI/Probability/SATComputability/CertificateSearch.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.4 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATComputability/CertificateSearch.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/SATComputability/CertificateSearch.lean
-
curl -L -o CertificateSearch.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/SATComputability/CertificateSearch.lean
4.4 kB
| import OAI.MathematicalPhysics.RapidForcing.RatOperations | |
| import Mathlib.Computability.PartrecCode | |
| namespace OAI | |
| namespace FixedClauseThreshold.Computability | |
| open Filter | |
| open scoped Topology | |
| open RapidForcing.EffectiveArithmetic | |
| def tolerance (r : β) : β := (2 ^ r : β)β»ΒΉ | |
| @[fun_prop] | |
| theorem tolerance_computable : Computable tolerance := by | |
| unfold tolerance | |
| fun_prop | |
| theorem tolerance_pos (r : β) : 0 < tolerance r := by | |
| unfold tolerance | |
| positivity | |
| def certificateTest (lower upper : β β β) (valid : β β Bool) | |
| (r n : β) : Option β := | |
| let i := n.unpair.1 | |
| let j := n.unpair.2 | |
| if valid j = true β§ upper j - lower i β€ 2 * tolerance r then | |
| some ((lower i + upper j) / 2) | |
| else none | |
| theorem certificateTest_computable {lower upper : β β β} {valid : β β Bool} | |
| (hl : Computable lower) (hu : Computable upper) (hv : Computable valid) : | |
| Computableβ (certificateTest lower upper valid) := by | |
| unfold Computableβ certificateTest | |
| fun_prop | |
| def certificateProgram (lower upper : β β β) (valid : β β Bool) | |
| (r : β) : Part β := | |
| Nat.rfindOpt (certificateTest lower upper valid r) | |
| theorem certificateProgram_partrec {lower upper : β β β} {valid : β β Bool} | |
| (hl : Computable lower) (hu : Computable upper) (hv : Computable valid) : | |
| Partrec (certificateProgram lower upper valid) := | |
| Partrec.rfindOpt (certificateTest_computable hl hu hv) | |
| theorem certificateTest_sound {Ξ± : β} {lower upper : β β β} {valid : β β Bool} | |
| (hl : β i, (lower i : β) β€ Ξ±) | |
| (hu : β j, valid j = true β Ξ± β€ (upper j : β)) | |
| {r n : β} {q : β} (hq : q β certificateTest lower upper valid r n) : | |
| |(q : β) - Ξ±| β€ (tolerance r : β) := by | |
| dsimp only [certificateTest] at hq | |
| split_ifs at hq with h | |
| Β· obtain rfl := Option.mem_some_iff.mp hq | |
| have hlo := hl n.unpair.1 | |
| have hup := hu n.unpair.2 h.1 | |
| have hwidth : (upper n.unpair.2 : β) - lower n.unpair.1 β€ | |
| 2 * (tolerance r : β) := by exact_mod_cast h.2 | |
| push_cast | |
| apply abs_le.mpr | |
| constructor <;> linarith | |
| Β· contradiction | |
| theorem certificateProgram_total {Ξ± : β} {lower upper : β β β} {valid : β β Bool} | |
| (hl : β Ξ΅ : β, 0 < Ξ΅ β β i, Ξ± - Ξ΅ < (lower i : β)) | |
| (hu : β Ξ΅ : β, 0 < Ξ΅ β β j, valid j = true β§ (upper j : β) < Ξ± + Ξ΅) | |
| (r : β) : (certificateProgram lower upper valid r).Dom := by | |
| have hΞ΅ : (0 : β) < tolerance r := by exact_mod_cast tolerance_pos r | |
| obtain β¨i, hiβ© := hl (tolerance r) hΞ΅ | |
| obtain β¨j, hj, hj'β© := hu (tolerance r) hΞ΅ | |
| apply Nat.rfindOpt_dom.mpr | |
| refine β¨Nat.pair i j, (lower i + upper j) / 2, ?_β© | |
| have hwidth : upper j - lower i β€ 2 * tolerance r := by | |
| have : (upper j : β) - lower i β€ 2 * (tolerance r : β) := by linarith | |
| exact_mod_cast this | |
| simp [certificateTest, hj, hwidth] | |
| theorem finite_certificate_search {Ξ± : β} | |
| {lower upper : β β β} {valid : β β Bool} | |
| (hlc : Computable lower) (huc : Computable upper) (hvc : Computable valid) | |
| (hls : β i, (lower i : β) β€ Ξ±) | |
| (hus : β j, valid j = true β Ξ± β€ (upper j : β)) | |
| (hld : β Ξ΅ : β, 0 < Ξ΅ β β i, Ξ± - Ξ΅ < (lower i : β)) | |
| (hud : β Ξ΅ : β, 0 < Ξ΅ β β j, valid j = true β§ (upper j : β) < Ξ± + Ξ΅) : | |
| β q : β β β, Computable q β§ | |
| (β r, q r β certificateProgram lower upper valid r) β§ | |
| β r, |(q r : β) - Ξ±| β€ (2 ^ r : β)β»ΒΉ := by | |
| let total := certificateProgram_total hld hud | |
| let q := fun r => (certificateProgram lower upper valid r).get (total r) | |
| have hq (r : β) : q r β certificateProgram lower upper valid r := Part.get_mem _ | |
| refine β¨q, (certificateProgram_partrec hlc huc hvc).of_eq_tot hq, hq, ?_β© | |
| intro r | |
| obtain β¨n, hnβ© := Nat.rfindOpt_spec (hq r) | |
| simpa only [tolerance, Rat.cast_inv, Rat.cast_pow, Rat.cast_ofNat] using | |
| certificateTest_sound hls hus hn | |
| theorem rational_sequence_code {q : β β β} (hq : Computable q) : | |
| β c : Nat.Partrec.Code, β r, | |
| Nat.Partrec.Code.eval c r = Part.some (Encodable.encode (q r)) := by | |
| have hencode := Computable.encode.comp hq | |
| obtain β¨c, hcβ© := Nat.Partrec.Code.exists_code.mp (Partrec.nat_iff.mp hencode) | |
| exact β¨c, fun r => congrFun hc rβ© | |
| end FixedClauseThreshold.Computability | |
| end OAI | |