structure
definition
RecognitionGeneratorsCert
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.CrossDomain.RecognitionGenerators on GitHub at line 79.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
formal source
76theorem second_primorial : G2 * G3 = 6 := by decide
77theorem third_primorial : G2 * G3 * G5 = 30 := by decide
78
79structure RecognitionGeneratorsCert where
80 generator_2 : G2 = 2
81 generator_3 : G3 = 3
82 generator_5 : G5 = 5
83 primorial_3 : G2 * G3 * G5 = 30
84 generators_distinct : G2 ≠ G3 ∧ G3 ≠ G5 ∧ G2 ≠ G5
85 -- Spectrum decompositions
86 four_as_G : (4 : ℕ) = G2^2
87 six_as_G : (6 : ℕ) = G2 * G3
88 fortyfive_as_G : (45 : ℕ) = G3^2 * G5
89 oneTwentyFive_as_G : (125 : ℕ) = G5^3
90 threeSixty_as_G : (360 : ℕ) = G2^3 * G3^2 * G5
91
92def recognitionGeneratorsCert : RecognitionGeneratorsCert where
93 generator_2 := rfl
94 generator_3 := rfl
95 generator_5 := rfl
96 primorial_3 := primorial_product
97 generators_distinct := generators_minimal
98 four_as_G := four_decomp
99 six_as_G := six_decomp
100 fortyfive_as_G := fortyfive_decomp
101 oneTwentyFive_as_G := oneTwentyFive_decomp
102 threeSixty_as_G := threeSixty_decomp
103
104end IndisputableMonolith.CrossDomain.RecognitionGenerators