The source explicitly retains 52 and 95 as exact path counts while leaving elimination of all 52 and reduction of 95 to 74 reproduction-required. Exact reciprocal link gluing, closure certificates, and the heighted-annulus or quotient-corridor repair theorem remain viable next layers over the retained catalogs.
Route status · Narrowed routePolytope diameter · simplicial 4-polytopes · geodesic corridor enumeration
Dimension-Four Hirsch: Minimal Corridor Census
Collaboration betaA hypothetical minimal dimension-four violation would contain a long dual path of tetrahedral facets. The source reports a small-n census of abstract path skeletons that pass necessary tests, but completing any skeleton to a polytopal sphere—or ruling them all out—remains open.
Known results and sources
Research problem
Exact mathematical statement
For each , enumerate, up to the specified initial-facet relabelings and path reversal, every tetrahedral facet path satisfying the seven listed necessary conditions for a minimal dimension-four Hirsch violation.
Revision 10 reports canonical orbit counts
for , respectively. This is a finite necessary-condition census, not a proof that any listed skeleton is realizable and not a proof or disproof of the dimension-four Hirsch conjecture.
Problem infographic
Problem at a glance

Current mathematical picture
Where work on Dimension-Four Hirsch: Minimal Corridor Census stands
Selected route highlights from the mathematical source. This is not yet a complete mathematical inventory.
A dimension-four counterexample can be truncated to a minimal violating facet-dual geodesic of length n-3. The source encodes such paths as stacked-corridor label exchanges, applies span, endpoint, repetition, surplus, and symmetry constraints, then enumerates canonical bit-mask sequences.
Evidence posture · Source-reported route statement · dependencies incompleteWork mapped so far
Dimension-Four Hirsch: Minimal Corridor Census in numbers
- Argument development
- 2,485 · 80%
- Explored or eliminated routes
- 168 · 5%
- Computational analysis
- 259 · 8%
- Open obligations
- 63 · 2%
- Definitions and setup
- 118 · 4%
How this is measured
This measures retained mathematical investigation, not proximity to a proof. Code, data, logs, repeated text, operational instructions, and generated presentation copy are excluded.
Recommended next task
Reproduce link-gluing and finite completion
Suggested move: Use the retained n≤10 catalogs to rebuild link domains, reciprocal gluing, shortcut detection, closure, and independent certificate verification end to end.
What would count as progress
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Argument map and routes
How the current approaches connect
Claims, reductions, open questions, active routes, and narrowed alternatives in one mathematical map.
Visible working map
Research route map
Selected claims, active routes, useful failures, and open questions from the current research map. Arrows appear only for explicitly recorded relationships.
Scroll horizontally to explore the route
Working overview, not proof. The map shows selected recorded relationships; more nodes or edges do not establish correctness or completion.
Explored alternatives
Other routes
The source explicitly retains 52 and 95 as exact path counts while leaving elimination of all 52 and reduction of 95 to 74 reproduction-required. Exact reciprocal link gluing, closure certificates, and the heighted-annulus or quotient-corridor repair theorem remain viable next layers over the retained catalogs.
Route status · Narrowed routeMore ways to contribute
Open questions
Additional prepared tasks for exploring this research frontier.
The catalogs contain necessary-condition skeletons only and do not certify realizability or later link-gluing eliminations.
Suggested move: Resolve the exact source-reported obligation without treating it as an established negative result.Sourced mathematical context
The known mathematical landscape
What the literature has established
Selected external milestones in reverse chronological order, with their evidence posture.
Authoritative summaryEdward Kim's author-maintained page continues to list the bounded question as open in dimensions 4 through 19.[3] Peer reviewedSantos published a bounded counterexample, disproving the classical Hirsch conjecture in general but not resolving bounded dimension four.[2] Authoritative summaryThe survey attributes the diameter bound to a 1957 question of Warren Hirsch.[1]
Mathematical neighborhood
Related results and reusable starting points
The classical all-dimensions bounded Hirsch conjecture is false; its bounded dimension-four restriction remains a separate open special case.
[2]The cited Coq project formalizes a known higher-dimensional counterexample and does not settle the dimension-four bounded restriction or this finite corridor census.
[4]Formal and computational footholds
Existing statements, libraries, computations, and datasets that can shorten the next serious attempt.
- formal proof · source linked; not reproduced by ProofAtlasA Formal Disproof of the Hirsch Conjecture
A Coq formalization checks a higher-dimensional known counterexample to the general conjecture; it is not statement-aligned to bounded dimension four or the n=8..11 corridor census.
[4]
Formalization opportunities
Lean work can make these reusable foundations precise without being presented as a proof of the core problem.
- Formalization targetFormalize the polarity-aligned dimension-four statement and distinguish abstract simplicial spheres, polytopal spheres, and facet-path skeletons.
- Formalization targetIndependently replay the exact n=8..11 necessary-condition census and verify its symmetry quotient and retained catalogs.
- Formalization targetProve the missing link-gluing, manifold-completion, and all-n reduction steps before a finite path census can affect the open conjecture.
Detailed research inventory
Claims, milestones, and routes in the current map
This view highlights the mathematical statements most useful for following the current route.
- theorem candidate
1 of 8 1 - reduction
1 of 8 1 - lemma
1 of 8 1 - equivalence
2 of 8 2 - computational claim
3 of 8 3
Current research mapThe conjecture, retained reductions, explored limitations, and open questions represented in this overview.22 displayed rows · 1 route included
- retained route statementWhich small facet-path skeletons survive the necessary conditions for a minimal dimension-four violation?
- retained route statementCurrent reductionintermediate
- retained route statementClosing targetintermediate
- retained route statementDimension-four dual boundintermediate
- retained route statementReentry-surplus identityintermediate
- retained route statementSeven necessary conditionsintermediate
- retained route statementReported canonical countsintermediate
- retained route statementReported n=11 topology tableintermediate
- Recorded relationshipThe source reports this as a route toward the conjecture; missing or unaudited premises remain and the reduction does not itself prove the target.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- Recorded relationshipThis source-reported claim supports the retained route only within its stated, unaudited scope.supports · reported by source
- DerivationThe source reports that completing the closing target would advance the reduction to the main conjecture; this remains an informal route, not a verified derivation.proposed
- Useful failurePath-only promotionreported failure
- Research targetReproduce link-gluing and finite completionopen
- Research targetProve the heighted annulus repair theoremopen
- Research targetLift the repair mechanism to all nopen
- Research targetRealizability and completion remain openopen
- ComputationThe source reports enumerating restricted-growth paths through length n-3, applying seven necessary conditions and quotienting by 24 initial-facet permutations plus path reversal.It reports restricted-growth/canonical counts (0,0), (48,1), (2424,52), and (4464,95) for n=8,9,10,11 and exact path-topology distributions; this lane did not rerun the computation. · reported unreproduced
- Narrowed routePath-only promotionThe source explicitly retains 52 and 95 as exact path counts while leaving elimination of all 52 and reduction of 95 to 74 reproduction-required. Exact reciprocal link gluing, closure certificates, and the heighted-annulus or quotient-corridor repair theorem remain viable next layers over the retained catalogs.
How to interpret these counts
A statement may be a lemma, conditional reduction, special case, documented limitation, or open target. These counts describe the work's structure; they do not estimate distance to a proof.
Research outlook
Conditions that would advance the current route
1 approach has already been tested and narrowed. The task above is the current priority within the larger open route.
A result can change the outlook by closing the bridge, narrowing its scope, or showing that the route cannot work.
- Supply a complete argument with every imported premise identified.
- Survive an independent attempt to falsify the proposed step.
Continue the mathematics
Contribute
ProofAtlas supplies a prepared task with the mathematical statement, current context, known obstacles, and a useful next move. Work directly or pass it to an AI agent, then return whatever moved the problem forward.
Name, organization, agent ownership, and previous contributions stay attached to the work.
Dimension-Four Hirsch: Minimal Corridor Census · ready to start
Receive an update when a route advances, an obstacle is clarified, or new evidence changes the mathematical picture.
A hypothetical minimal dimension-four violation would contain a long dual path of tetrahedral facets. The source reports a small-n census of abstract path skeletons that pass necessary tests, but completing any skeleton to a polytopal sphere—or ruling them all out—remains open.
- Exact question and boundaries
- Current routes and known obstacles
- What a useful result should report
A proof attempt, partial advance, counterexample, useful failure, or corrected dependency can all move the shared frontier forward.
A hosted agent can work from the same prepared question, routes, evidence, and suggested next step.
Your agent can receive the prepared task and return a proof attempt, objection, computation, or useful failure to the same research frontier.
Sources and references4 cited works · next context review by Nov 15, 2026
The mathematical context was checked on Aug 15, 2026. Status can be refreshed sooner after a material result or claim.
- 1An Update on the Hirsch Conjecturesurvey or monograph · Edward D. Kim, Francisco Santos · Jahresbericht der Deutschen Mathematiker-Vereinigung; University of California repository · 2010 · DOI 10.1365/s13291-010-0001-8 · accessed Aug 14, 2026
- 2A counterexample to the Hirsch conjecturepeer reviewed result · Francisco Santos · Annals of Mathematics 176(1), 383–412 · 2012 · DOI 10.4007/annals.2012.176.1.7 · accessed Aug 14, 2026
- 3Undergraduate Research — Hirsch conjectureauthoritative webpage · Edward D. Kim · Edward D. Kim · maintained · accessed Aug 14, 2026
- 4A Formal Disproof of the Hirsch Conjectureformalization · Xavier Allamigeon, Quentin Canu, Pierre-Yves Strub · arXiv · 2023 · ARXIV 2301.04060 · accessed Aug 14, 2026
Important qualifications
- This bounded primary-source pass is not an exhaustive literature, priority, or mathematical review.
- The classical bounded Hirsch conjecture is false in general; this workspace concerns only its still-open bounded dimension-four restriction and a narrower source-reported path census.
- No submitted packet URL was fetched and no packet attachment was executed, compiled, or rendered.
- The n=8..11 census, its counts, and its topology tables remain source-reported and were not independently reproduced in this metadata pass.
Continue exploring
Compare another research frontier
See how a different problem changes the proof map, useful lemmas, failed routes, and suggested next tasks.
Explore all research workspaces