Q-SPACE
← DISCOVERY STREAM · RU

Documentation

Q-space · public documentation · snapshot 2026-11-17

Q-space is a formal knowledge space for mathematics and an autonomous research system that grows it: the system surveys existing formalized mathematics, identifies what is missing, formulates candidate statements, searches for proofs, rejects false candidates by counterexample, and registers every surviving result with strict machine verification. $$\text{Q-Space} = \bigl(\text{Knowledge Graph}\bigr) + \bigl(\text{Proof Search}\bigr) + \bigl(\text{Strict Verification}\bigr)$$

What the Discovery Stream shows

The stream is a read-only window into the result registry — the single record of everything the system has produced. Each entry carries:

Failed research is recorded too: refuted candidates appear as FALSIFIED entries with their counterexamples, and open targets appear as HYPOTHESIS entries with what is known about their boundaries.

Verification policy

TermMeaning
STRICT VERIFIEDThe proof compiles in Lean 4 and passes an independent strict check: the set of axioms the proof depends on is extracted and compared against a fixed whitelist — $\text{propext}$, $\text{Classical.choice}$, $\text{Quot.sound}$. $$\text{axioms}(P) \subseteq \{\text{propext},\; \text{Classical.choice},\; \text{Quot.sound}\}$$ Anything outside the whitelist rejects the proof. $\text{sorry}$, $\text{admit}$ and analogous placeholders are rejected.
COMPILE ONLYThe proof compiles, but the strict axiom-level check has not yet classified it. These are mostly small auxiliary lemmas. They are never counted as verified results.
FALSIFIEDThe candidate statement was disproved by an exhibited counterexample, found by automated search and machine-checked.
HYPOTHESISAn open target: a statement the system aims to prove, with the current knowledge of its boundary of validity recorded.
IN PROGRESSAn active attempt: statement accepted, proof search under way.
Environment. All strict verifications are performed with Lean 4 (v4.34.1) against a pinned Mathlib revision (d13f23b7, 2026-09-24). Verification runs in a separate process from proof search; results are stored with the full environment record shown on each entry.

What we do not claim

Honesty about the limits of formal verification is part of the design.

How results originate

Every entry records its origin. Current sources of targets include:

Counterexample search runs on candidates before and during proof attempts; a refuted candidate is registered as a negative result rather than discarded.

Registry state

MetricValue (2026-11-17)
Total registered259
Strictly verified224
Compile-only (auxiliary)35
Domains representedbitwise algebra, div/mod, gcd/lcm, order, powers, coprimality (new)

The stream shows a curated subset; the registry grows with every research run.

Access & citation

Frequently asked

Why are there “compile only” entries at all?

Transitional honesty: auxiliary lemmas are recorded when they compile, and upgraded to strict status after the independent axiom check. Mixing verified and unchecked results under one label would be worse than showing the difference.

Why publish refuted statements?

A verified counterexample is knowledge: it maps the boundary of what is true. Negative results also protect future work from re-attempting dead ends.

Is this an AI system?

Q-space is an automated research system: it operates autonomously — surveying, formulating, searching, checking — without a language model in its proof loop. Trust in a result never rests on who or what produced the proof: it rests on the strict verification record attached to it.

What is the long-term goal?

A self-growing formal knowledge space: results compound into new results, demanded concepts get introduced, and every fact carries a machine-checkable certificate and full provenance.

Q-SPACE · PUBLIC DOCUMENTATION · SNAPSHOT 2026-11-17 · READ-ONLY