Opportunities/Theorem Dependency Intelligence

A possibility worth exploring

Theorem Dependency Intelligence

A machine-readable graph showing which theorems, algorithms and claims depend on open conjectures, assumptions or formal lemmas.

01

The possibility

A machine-readable graph showing which theorems, algorithms and claims depend on open conjectures, assumptions or formal lemmas.

A breakthrough changes more than one page: it can alter the status of a network of conditional results.

When an assumption changes status, the graph can recalculate affected results and route users to the exact evidence.

02

What to keep in mind

What stands between here and there?

Known limitation

LLM extraction can confuse implication, motivation, analogy and true formal dependency.

Honest boundary

Every dependency must retain provenance and review state; an AI-inferred edge is not a verified theorem dependency.

03

Ideas it sparks

Ways to start thinking today.

These are prompts for curiosity—not roadmaps or promises.

Strongly supported

Theorem Dependency Auditor

Extract and review explicit dependency edges such as “assuming RH,” “uses bounded gaps,” or “requires this lemma,” with citations and review states.

Why it is thinkable now

Yes, with AI-assisted extraction plus expert or community correction.

Explore the idea →
Sources and uncertainty 5

AI summarized and source-backed · Qualified expert review pending.