Theorem 3.6: cognitive closure is the least deductive superset

Proved

CogCons.cognitiveClosure_isLeast

by Lucas · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

consequence-operatorlogictopology

For every $A \subseteq C$ , the cognitive closure $\mathrm{Cl}^{\square}(A)$ is the smallest deductive system containing $A$ : it is deductive, contains $A$ , and is contained in every deductive system containing $A$ .

Preamble

import Mathlib
import Definitions.Def_CogCons_consequence_space

open CogCons.CognitiveConsequenceSpace

Formal statement

namespace CogCons

theorem cognitiveClosure_isLeast {C : Type*} (S : CognitiveConsequenceSpace C) (A : Set C) :
    IsLeast {D : Set C | S.IsDeductive D ∧ A ⊆ D} (S.cognitiveClosure A) := by sorry

end CogCons

Source

S. Acharjee and U. Gogoi, *The limit of human intelligence*, arXiv:2310.10792v2 [math.GM] (2023), https://arxiv.org/abs/2310.10792, Theorem 3.6 (pp. 7–8)

Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted these Lean statements, not by an independent auditor working blind from the code alone. The author knew the intended meaning while writing it, so it may read that intent into the code. Do not treat it as independent verification; compare the Lean code against the source directly.

For every type $C$ , every cognitive-consequence space $S$ on $C$ and every $A \subseteq C$ , the set $K = \bigcap\{D \subseteq C : \mathrm{Cn}(D) = D,\ A \subseteq D\}$ is the least element (for inclusion) of $\{D \subseteq C : \mathrm{Cn}(D) = D,\ A \subseteq D\}$ : $\mathrm{Cn}(K) = K$ , $A \subseteq K$ , and $K \subseteq D$ for every such $D$ .

Human review

Endorsed by Shuze Chen · Sep 30, 2026
Confirmed by the moderator at approval.
Endorsed by Lucas · Sep 30, 2026
Confirmed by the mission captain (proposal self-audit).

View graph