Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Novelty_EmotionalChromaticNumber

Definition
Novelty_EmotionalChromaticNumber

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

Definition bundle for the Aether Catalog module Novelty.EmotionalChromaticNumber, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.

Definition code
-- Def bundle generated from Novelty/EmotionalChromaticNumber.lean by skeleton subtraction
import Mathlib
/-
Copyright (c) 2026 Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.

# The Emotional Chromatic Number of a Social Network

Model a social network as a finite simple graph `G`: vertices are people and edges are
friendships.  A proper coloring with `k` colors is an assignment of one of `k` *emotions* to each
person so that no two friends share the same emotion.  The chromatic counting function
`chromVal G k` (developed in `Catalog/Combinatorics/ChromaticPolynomial.lean`) counts such
assignments, and `G.Colorable k` records whether at least one exists.

We isolate the *emotional* regime, where a genuine assignment must use at least three emotion
categories (two-emotion assignments are dismissed as trivial "bipartite" splits).  The
**emotional chromatic number**

  `emoChrom G  =  min { k : 3 ≤ k and G is k-colorable }`

is the smallest number of emotions `≥ 3` that suffices for a consistent assignment.

## Main results

* `emoChrom_ge_three`      : `3 ≤ emoChrom G`               (the emotional floor).
* `emoChrom_colorable`     : `G.Colorable (emoChrom G)`     (the value is attained).
* `emoChrom_le`            : minimality among admissible color counts.
* `emoChrom_eq_three_iff`  : `emoChrom G = 3 ↔ G.Colorable 3`.
* `emoChrom_complete`      : `emoChrom (K_n) = max n 3`     (a clique of `n` mutual friends).
* `emoChrom_complete_ge_three` : for `n ≥ 3`, `emoChrom (K_n) = n`.
* `emoChrom_cycle`         : `emoChrom (C_n) = 3` for every `n ≥ 3` (friendship circles).
* `emotionally_consistent` : if `G` is `6`-colorable then `3 ≤ emoChrom G ≤ 6`
                             (the six basic emotions suffice, and three are always needed).
* `emoChrom_bipartite_floor` : the complete bipartite pair `K_2` is `2`-colorable yet has
                             emotional chromatic number `3` — the emotional floor bites.
* `chromVal_two_of_edge_pos` / `bipartite_root_claim_false` : a graph that splits into two
                             groups is *not* a root of the chromatic polynomial at `k = 2`;
                             the true obstruction lives at `k = 1`.

-- !-- Lab Notes -- !--
HYPOTHESIS.  Restricting proper colorings to the "emotional" range `k ≥ 3` should collapse the
chromatic number to a small window.  Concretely: cliques should force `emoChrom = n`, cycles should
always land on `3` (even cycles, which are bipartite, are pushed up from `2` by the emotional floor),
and any network colorable with the six basic emotions should satisfy `3 ≤ emoChrom ≤ 6`.

EXPERIMENTAL PLAN.
  (1) Define `emoChrom` as the infimum of the admissible set `{k | 3 ≤ k ∧ G.Colorable k}` and show
      the set is nonempty (a finite graph is colorable with `card V` colors).
  (2) Read off the defining properties from `Nat.sInf_mem` / `Nat.sInf_le`.
  (3) Feed the falling-factorial evaluation of the complete graph (`complete_colorable_iff`) into the
      infimum to get `emoChrom (K_n) = max n 3`.
  (4) Use Mathlib's `chromaticNumber_cycleGraph_of_even/odd` to get `C_n.Colorable 3`, then pin the
      cycle value to the floor `3`.
  (5) Refute the folklore "bipartite root at k = 2" claim by computing `chromVal (K_2) 2 = 2`.

INSIGHT.  Colorability is monotone (`Colorable.mono`), so the admissible set `{k | 3 ≤ k ∧ Colorable k}`
is an up-set intersected with `[3, ∞)`; its infimum is therefore `max (χ G) 3` in spirit.  This is
why every bipartite network (chromatic number `2`) has emotional chromatic number exactly `3`: the
floor, not the graph, decides.  The complete graph is the unique obstruction that pushes the value
strictly above `3`, and only when the clique already needs `≥ 3` colors.

ANALYSIS / CRITIQUE.  The description's assertion that "the chromatic polynomial has a root at
`k = 2` for any bipartite graph" is FALSE: a bipartite graph with an edge has *positive* chromatic
polynomial at `2` (e.g. `chromVal (K_2) 2 = 2`).  The genuine root common to every graph with an edge
sits at `k = 1`.  We record the corrected statements `chromVal_two_of_edge_pos` and
`bipartite_root_claim_false`, and encode the intended phenomenon — that two emotions are declared
insufficient — as the *emotional floor* `emoChrom ≥ 3` rather than as a spurious polynomial root.
-- !-- End Lab Notes -- !--
-/


namespace Catalog.Novelty.EmotionalChromaticNumber

open SimpleGraph
open scoped Classical

noncomputable section

variable {V : Type*} [Fintype V] [DecidableEq V]

/-! ## Definition and basic API -/

/-- The **emotional chromatic number** of a social network `G`: the least number of emotions
`k ≥ 3` for which the people can be assigned emotions with no two friends sharing one. -/
noncomputable def emoChrom (G : SimpleGraph V) : ℕ :=
  sInf {k | 3 ≤ k ∧ G.Colorable k}







/-! ## Cliques: complete graphs -/



/-! ## Friendship circles: cycles -/


/-! ## The six basic emotions -/


/-! ## The emotional floor versus the "bipartite root" folklore -/




/-
-- !-- Lab Notes (synthesis) -- !--
SURVIVED.
  * `emoChrom_complete` / `emoChrom_complete_ge_three`: cliques realize `emoChrom (K_n) = max n 3`,
    recovering `emoChrom (K_n) = n` for `n ≥ 3` from the falling-factorial evaluation of the
    chromatic polynomial (via `complete_colorable_iff`, a catalog result).
  * `emoChrom_cycle`: every friendship circle of length `≥ 3` has emotional chromatic number exactly
    `3`, unifying the even (bipartite, χ = 2) and odd (χ = 3) cases under the emotional floor.
  * `emotionally_consistent`: the "six basic emotions" window `[3, 6]` for any 6-colorable network.

FAILED / CORRECTED.
  * The conjectured "root at k = 2 for bipartite graphs" is false; `bipartite_root_claim_false`
    exhibits `chromVal (K_2) 2 = 2`.  The intended phenomenon is captured instead by the emotional
    floor `emoChrom ≥ 3` and its concrete bite `emoChrom (K_2) = 3` (`emoChrom_bipartite_floor`).

CROSS-DOMAIN SYNTHESIS.  This file bridges the algebraic/combinatorial chromatic-polynomial theory of
`Catalog/Combinatorics/ChromaticPolynomial.lean` with a modeling layer (social networks, emotion
assignments), and reuses Mathlib's concrete cycle colorings.  The emotional chromatic number is a
genuinely new order-theoretic invariant: `emoChrom G = max (least k with Colorable k) 3`, whose
behavior on cliques and cycles is fully determined here.
-- !-- End Lab Notes -- !--
-/

end

end Catalog.Novelty.EmotionalChromaticNumber

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