A dogma of cardinality
ProvedDogma.exists_dogma_card_1881algebracombinatoricsfinite-algebramagmas
A dogma is a right-cancellative magma satisfying
Right-cancellative means that implies .
Theorem. There exists a dogma of cardinality .
This answers the first question of Problem 10 in the CUHK-Shenzhen AI Math Problems (source credited to Ma Li on the problem page): to exhibit a dogma with elements. The number is a product of the squared prime , which is inert in , and the primes and , which split in .
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 the equation forces to be finite. Both defining properties are stated for all elements of .
Preamble
import Mathlib
Formal statement
namespace Dogma
theorem exists_dogma_card_1881 :
∃ (D : Type) (star : D → D → D), Nat.card D = 1881 ∧
(∀ 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 DogmaSource
CUHK-Shenzhen AI Math Problems, Problem 10 (Ma Li), https://rybindmitry.github.io/problems/10.html, question 1: 'Find a dogma of cardinality 1881', where a dogma is a right-cancellative magma with (x*y)*y = y*x (added June 22, 2026).