Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A dogma of cardinality 171717

Proved
Dogma.exists_dogma_card_17

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

algebrafinite-algebramagmasquasigroups

A dogma is a right-cancellative magma (D,⋆)(D,\star)(D,⋆) satisfying (x⋆y)⋆y=y⋆x(x\star y)\star y=y\star x(x⋆y)⋆y=y⋆x for all x,y∈Dx,y\in Dx,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 171717.

The prime 17≡2(mod5)17\equiv2\pmod 517≡2(mod5) is inert in Q(5)\mathbb Q(\sqrt5)Q(5​) and occurs to the first power, so 171717 is not covered by the sufficient condition of Dogma.exists_dogma_card_of_even_inert (even exponents at primes ≡±2(mod5)\equiv\pm2\pmod 5≡±2(mod5)); the condition is therefore not necessary. The example given is a full multiplication table found by a SAT solver; it is not medial, so it is not of the affine form x⋆y=αx+α2yx\star y=\alpha x+\alpha^2yx⋆y=αx+α2y. The statement is relevant to the second question of Problem 10 of the CUHK-Shenzhen AI Math Problems, which asks for which nnn a dogma of cardinality nnn exists.

Formalization Note. The statement is existential over a type DDD and a binary operation. Cardinality is expressed with Nat.card, so ∣D∣=17|D|=17∣D∣=17 forces DDD to be finite.

Preamble
import Mathlib
Formal statement
namespace Dogma

theorem exists_dogma_card_17 :
    ∃ (D : Type) (star : D → D → D), Nat.card D = 17 ∧
      (∀ 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 (source credited to Ma Li), https://rybindmitry.github.io/problems/10.html, question 2: 'For which n does there exist a dogma of cardinality n?' This statement is an original existence result found by computer search and verified in Lean; it is not claimed in the source.

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