On the Fundamental Impossibility of Hallucination Control in Large Language Models
Micha{\l} P. Karpowicz

TL;DR
This paper proves a fundamental impossibility theorem showing that large language models cannot simultaneously achieve truthful knowledge, semantic conservation, complete knowledge revelation, and optimality, due to inherent mathematical constraints.
Contribution
It introduces a formal framework and proof demonstrating the fundamental limits of hallucination control in large language models, linking hallucination to core information-theoretic principles.
Findings
Hallucination and imagination are mathematically identical phenomena.
Meaningful reasoning necessarily violates information conservation.
The Jensen gap quantifies confidence excess beyond evidence.
Abstract
This paper establishes a fundamental Impossibility Theorem: no LLM performing non-trivial knowledge aggregation can simultaneously achieve truthful knowledge representation, semantic information conservation, complete revelation of relevant knowledge, and knowledge-constrained optimality. This impossibility stems from the mathematical structure of information aggregation, not from engineering limitations. We prove this by modeling inference as an auction of ideas, where distributed components compete to influence responses using their encoded knowledge. The proof employs three independent approaches: mechanism design (Green-Laffont theorem), proper scoring rules (Savage), and transformer architecture analysis (log-sum-exp convexity). We introduce the semantic information measure and the emergence operator to analyze computationally bounded and unbounded reasoning. Bounded reasoning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
