Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A dogma of cardinality 188118811881

Proved
Dogma.exists_dogma_card_1881

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebracombinatoricsfinite-algebramagmas

A dogma is a right-cancellative magma (D,⋆)(D,\star)(D,⋆) satisfying

(x⋆y)⋆y  =  y⋆xfor all x,y∈D.(x\star y)\star y \;=\; y\star x \qquad\text{for all }x,y\in D .(x⋆y)⋆y=y⋆xfor all x,y∈D.

Right-cancellative means that x⋆z=y⋆zx\star z=y\star zx⋆z=y⋆z implies x=yx=yx=y.

Theorem. There exists a dogma of cardinality 188118811881.

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 188118811881 elements. The number 1881=32⋅11⋅191881=3^2\cdot 11\cdot 191881=32⋅11⋅19 is a product of the squared prime 333, which is inert in Q(5)\mathbb Q(\sqrt5)Q(5​), and the primes 111111 and 191919, which split in Q(5)\mathbb Q(\sqrt5)Q(5​).

Formalization Note. The statement is existential over a type DDD and a binary operation. Cardinality is expressed with Nat.card, which is zero for infinite types, so the equation ∣D∣=1881|D|=1881∣D∣=1881 forces DDD to be finite. Both defining properties are stated for all elements of DDD.

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 Dogma
Source
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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me