theorem
proved
dmCandidate_count
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Cosmology.CDMDensityParameterFromRS on GitHub at line 25.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
22 | selfInteracting
23 deriving DecidableEq, Repr, BEq, Fintype
24
25theorem dmCandidate_count : Fintype.card DMCandidate = 5 := by decide
26
27noncomputable def omegaCDM : ℝ := 0.26
28
29theorem omegaCDM_band : (0.25 : ℝ) < omegaCDM ∧ omegaCDM < 0.27 := by
30 unfold omegaCDM; refine ⟨?_, ?_⟩ <;> norm_num
31
32structure CDMDensityCert where
33 five_candidates : Fintype.card DMCandidate = 5
34 omega_band : (0.25 : ℝ) < omegaCDM ∧ omegaCDM < 0.27
35
36noncomputable def cdmDensityCert : CDMDensityCert where
37 five_candidates := dmCandidate_count
38 omega_band := omegaCDM_band
39
40end IndisputableMonolith.Cosmology.CDMDensityParameterFromRS