Dogmas exist in every cardinality with even exponents at primes
ProvedDogma.exists_dogma_card_of_even_inertA dogma is a right-cancellative magma satisfying for all . Here right-cancellative means that implies .
Let be a positive integer. Suppose that every prime with or divides to an even power, that is,
Then there exists a dogma of cardinality .
This gives a large explicit family of cardinalities for the second question of Problem 10 in the CUHK-Shenzhen AI Math Problems (source credited to Ma Li on the problem page), which asks for which a dogma of cardinality exists. It contains, for example, , as well as every perfect square and every product of primes . The converse direction is not asserted here.
Formalization Note. The statement is existential over a type and a binary operation. Cardinality is expressed with Nat.card, which is zero for infinite types, so forces to be finite. The -adic valuation is n.factorization p.
import Mathlib
namespace Dogma
theorem exists_dogma_card_of_even_inert (n : ℕ) (hn : 0 < n)
(h : ∀ p : ℕ, p.Prime → (p % 5 = 2 ∨ p % 5 = 3) → Even (n.factorization p)) :
∃ (D : Type) (star : D → D → D), Nat.card D = n ∧
(∀ x y z : D, star x z = star y z → x = y) ∧
∀ x y : D, star (star x y) y = star y x := by
sorry
end Dogma