Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LeanProofs.Rosetta.PrimitiveCenterCoweight

Definition
Grade4_LeanProofs_Rosetta_PrimitiveCenterCoweight

by lisamegawatts · Sep 18, 2026 · Mathlib c5ea003 (Lean v4.30.0)

clifford-algebraleanproofs-grade4rosetta

Foundational definitions and structural lemmas from LeanProofs.Rosetta.PrimitiveCenterCoweight, required by the selected LeanProofs theorem graph.

Definition code
import Definitions.Def_Grade4_LeanProofs_Rosetta_CartanCubicInvariant
import Lean.Elab.Tactic.Omega
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic.NormNum
import Mathlib.Analysis.SpecialFunctions.Exp

namespace LeanProofsGrade4P2M


/-!
# Primitive `PSU(3)` center coweights

This file gives an integer-lattice certificate for the shortest nontrivial
`Z3` return class.  A class-one numerator is a traceless integer triple whose
three entries are congruent to `1` modulo `3`; dividing it by three gives a
diagonal path ending at the same nontrivial central phase in every entry.

The shortest such triples are exactly the Weyl permutations of `(1,1,-2)`.
Consequently the shortest nontrivial class lies on the same repeated-eigenvalue
ray that maximizes the cubic discriminator.  This is a classification of a
covering-space return class.  It is not a dynamical instability theorem, a
Killing-norm action, or a physical `PSU(3)` order-parameter declaration.
-/

namespace Rosetta.PrimitiveCenterCoweight

open Rosetta.CartanCubic

/-- Integer numerator data for the first nontrivial `Z3` central class. -/
def IsClassOneNumerator (a b c : ℤ) : Prop :=
  a + b + c = 0 ∧ a % 3 = 1 ∧ b % 3 = 1 ∧ c % 3 = 1

/-- The three distinct Weyl permutations of the repeated-entry numerator. -/
def IsH8NumeratorWeyl (a b c : ℤ) : Prop :=
  (a = 1 ∧ b = 1 ∧ c = -2) ∨
  (a = 1 ∧ b = -2 ∧ c = 1) ∨
  (a = -2 ∧ b = 1 ∧ c = 1)





































end Rosetta.PrimitiveCenterCoweight


end LeanProofsGrade4P2M
Source
https://github.com/MonumentalSystems/LeanProofs/blob/b656238b73d5f0f74515f6574a1dcb4e0216129f/LeanProofs/Rosetta/PrimitiveCenterCoweight.lean

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