Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dogmas exist in every cardinality with even exponents at primes ≡±2(mod5)\equiv \pm 2 \pmod 5≡±2(mod5)

Proved
Dogma.exists_dogma_card_of_even_inert

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

algebrafinite-algebramagmasnumber-theory

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. Here right-cancellative means that x⋆z=y⋆zx\star z=y\star zx⋆z=y⋆z implies x=yx=yx=y.

Let n≥1n\ge1n≥1 be a positive integer. Suppose that every prime ppp with p≡2p\equiv 2p≡2 or p≡3(mod5)p\equiv 3 \pmod 5p≡3(mod5) divides nnn to an even power, that is,

vp(n) is even for all primes p with p≡±2(mod5).v_p(n)\ \text{is even for all primes } p \text{ with } p\equiv \pm 2 \pmod 5 .vp​(n) is even for all primes p with p≡±2(mod5).

Then there exists a dogma of cardinality nnn.

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 nnn a dogma of cardinality nnn exists. It contains, for example, n=1881=32⋅11⋅19n=1881=3^2\cdot 11\cdot 19n=1881=32⋅11⋅19, as well as every perfect square and every product of primes p≡0,±1(mod5)p\equiv 0,\pm1\pmod 5p≡0,±1(mod5). The converse direction is not asserted here.

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 ∣D∣=n>0|D|=n>0∣D∣=n>0 forces DDD to be finite. The ppp-adic valuation vp(n)v_p(n)vp​(n) is n.factorization p.

Preamble
import Mathlib
Formal statement
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
Source
CUHK-Shenzhen AI Math Problems, Problem 10 (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 a sufficient condition (original); the converse is not claimed.

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