Skip to content

Import the Goldberg–Seymour edge-coloring theorem - #761

Open
Vilin97 wants to merge 18 commits into
mainfrom
codex/daily-goldberg-seymour-20261105
Open

Vilin97 wants to merge 18 commits into
mainfrom
codex/daily-goldberg-seymour-20261105

Conversation

@Vilin97

@Vilin97 Vilin97 commented Nov 5, 2026 •

Copy link
Copy Markdown
Collaborator

Preserve the completed Goldberg–Seymour theorem for finite loopless multigraphs, with independently identified parallel edges:

ChromaticIndex G ≤ max (MaximumDegree G + 1) (DensityCeil G).

The import also proves ChromaticIndex G = DensityCeil G when MaximumDegree G + 2 ≤ ChromaticIndex G. Odd-set density is the maximum of zero and internal-edge density over odd vertex sets of size at least three, counting parallel edges separately. It claims these mathematical results, without claiming an executable or polynomial-time coloring algorithm.

Source, eligibility and license

  • Public upstream, commit 88d98c1d1a59d1f1bf7c4eb58e73f3945f6daf12.
  • The author's Trellis page dates completion 2026-10-12, at day precision, within [2026-09-05T10:45:10Z, 2026-10-29T10:45:10Z). Public export and licensed-snapshot commits at October 12 14:33:47Z and 19:36:46Z corroborate that day.
  • Apache-2.0 explicitly covers Tablet/ and excludes paper/; no paper is copied. Copyright and attribution remain.
  • Provenance AI: Trellis operated by Wesley Pegden; AI port/interface work and the Mathlib bridge credited to Lean Pool contributors.
  • Mathematical source: Chen, Jing and Zang, arXiv:1901.10316v2.

Pool cards/source/history, open/merged PRs and issues, pinned Mathlib/Tau Ceti, and supplementary public searches revealed no matching headline. Lexical searches supplement direct mathematical comparison and are not exhaustive novelty proofs.

Scope and engineering

Preserves the coherent upstream theorem closure of 684 source modules and reusable partial coloring, Kempe components, critical subgraphs, Tashkinov trees, certified extension sequences and good hierarchies. Current scope: 797 modules / 383,626 physical lines / 3,431 import edges; root closure 789, plus public supporting APIs.

The Mathlib Graph bridge uses actual active vertex and edge sets as types, proves endpoint/incidence correspondence, retains isolated active vertices and parallel-edge identities, and supports finite active sets on infinite ambient types.

Targets Lean 4.35.0 and Mathlib 56a005855ea17e0b0958f73ec801ae140b0a1679. Adds one YAML card and generates its public Imports.lean; fixed LeanPool.lean remains unchanged. Content-only diff. No workflow, gate or linter-configuration changes; no raised proof limit, suppression or waiver is added.

Porting repairs cover version-sensitive APIs, typed witnesses, canonical proofs and closed proof continuations. Earlier optimization shares tree-prefix/order, walk-confinement, series-stability, hierarchy-nesting, coloring-transport, disjoint-family cardinality, degree-two path and path-number facts, and removes repeated expanded terms and seven current-policy oversized proof sites.

This revision addresses the remaining duplicated proof and series-projection interfaces:

  • One theorem about actual two-color components and closed colors shares the confinement proof between PE/non-PE anchors and the existing closed-set API. The PE boundary proof uses the existing exit-boundary theorem. Certified penultimate elementarity is proved once for an actual extended Tashkinov tree and reused by both restriction branches.
  • Stable hierarchy replacement is proved over the hierarchy, coloring, stability, route and lower-round induction data. Two copied change-lemma helpers now call that theorem directly without a counterexample or construction frame.
  • Canonical round casts and narrow projection/raw-data agreement facts replace three expanded revisiting contracts and their helpers, eight final-tree and two penultimate-tree helpers, and four SE/PE metadata proofs plus their coupled condition interfaces. Raw-data agreement needs no finite-type assumptions. Sixteen expanded casts use the canonical definition; an arbitrary-input definitional equality control passes by rfl.
  • Import minimization has no remaining suggestion. Four overlapping simp declarations became explicit rewrite facts; the canonical data projection remains the single simp rule. No suppression or configuration change was made.

All 17 latest changed/new modules were reviewed in bounded output; the four new mathematical APIs were inspected in full. This revision removes 3,906 net physical source lines relative to frozen parent7c2452ab70.

Theorem strength and useful generality are preserved. All 506 original theorem contracts recheck in 17 batches. Of 176 original definition contracts,154 normalize identically and22 changed/generalized interfaces were individually reviewed. Axiom/option audits include public/private/generated declarations and aliases. No sorry/admit, prohibited axiom/mechanism or theorem weakening.

Validation at b2910bf5f87c1a28477584ae35646d2adb0e2d30

All 11 local phases pass on identical hashes for all 797 owned sources: complete public aggregate with zero warnings,15 native linters, compiler diagnostics, style/static quality, generated indexes/card resolution, full axiom/option audits, all 506 original contracts.

Current compiler-policy audit: 797 modules, zero diagnostics: 160 fresh direct compiler executions and 637 explicitly recorded reuses of byte-identical complete owned import closures under exact unchanged external pins, compiler options, toolchain and plugin binary. Parent timings remain parent observations. The local author Lake configuration excludes the plugin newly added on main; it is separately validated with explicit complete-closure caching under unchanged pins/options/plugin, and enforced in hosted merged-revision CI. Plugin overhead is not included in the paired timings.

Configuration detail: Current primary/frozen-parent control use identical author config, excluding later-main compiler plugin and warning-promotion option. Exact unchanged plugin separately validates all797sources (160fresh/637exactcomplete-closure reuse), with zero diagnostics; hosted prior-main testmerge passes. Newmainwarningpromotion is enforced by normal nativequeue, and no newmain success is claimed. Control overlaps configuredreviewservice on sharedVM; workload effects uncontrolled.

Bounded review covers all 797 module endpoints, dependency closure and representative implementation slices. All17 latest changed/new modules were inspected, including the complete newly generalized proofs; no manual line-by-line claim over the entire project.

Hosted CI: Exactb291 Lean validation42257660581 COMPLETE SUCCESS: all10shards, assembly/native lint/style/dependency tracking/repository quality pass. Seven of eight protectedcontexts SUCCESS. Required Verify minimal Lean files42257660400 is extracting declarations; no completion is claimed. Actual testedmerge516a0ac60f8bdb7c32b9ac3c575b48ff9e696be8 combinesb291 withmain882.

Current main: Main advanced to49bdad2b2b82b4b41d75a8e251ac10b2aa08fb45, observed17:54:50Z. Four changed policy/config files read:warningAsError=true, no pin/plugin/review/workflow change. Its actual Lean workflow42264254554 pending; current-main readiness false, so noqueue. Individual contexts only, daily publisher excluded. No authorbranch main-chase.

Configured GPT review: Configured exact-head job2372 RUNNING at b2910bf, first attempt, created2026-11-06T17:40:01Z after request6691192203. No verdict yet; no duplicate request.

Greptile: Current-head Greptile check128029134775 SUCCESS; exact-head sticky summary verified, 0 current-head inline comments. Advisory evidence is in ninth-greptile-receipt.json; independent review/CI requirements remain.

Thorough source review: Current-head source review pending final measurement and hosted evidence. Prior source request-changes findings addressed in this revision.

Advisory profile: Fresh hosted advisory profile pending publication; local ten paired profiles and clean build are starting.

The filename/LOC partial-port advisory is checked against preserved declarations and original-contract evidence; every fresh flag requires an explicit resolution.

Measured compilation

Clean command: LEAN_NUM_THREADS=2 lake build LeanPool.GoldbergSeymour, deleting only the isolated worktree's private .lake/build, exact warm dependencies and frozen source. No other operator-run Lean job accompanied the current primary measurement. The later frozen-parent control overlaps the configured review service, with its resource use uncontrolled. Shared VM with 16 CPUs; unrelated workloads are uncontrolled. Commands, source hashes, complete resource records and per-file observations remain on the operator VM.

Original compatibility baseline: 1240.430s wall / 2019.936s user / 282.813s system / 2,165,628KiB maximum child RSS, 685 sources / 224,728 lines. Its 4,341 warnings and budget overrides made it unacceptable incoming content. Retained historical checkpoints: fcc1001.043s/3,435,456KiB; cc1135.119s/3,429,048KiB;7ddd1116.493s/3,426,772KiB;0531168.476s/3,423,920KiB. Checkpoint606e50e89 measured 1076.572s wall / 2152.460s user / 304.318s system / 3,433,004KiB maximum child RSS, 791 sources / 389,610 lines. The immediate frozen parent7c2452ab70 primary measured 1340.425s wall / 2296.844s user / 329.217s system / 3,426,468KiB maximum child RSS; its identical-source confirmation measured 1090.251s wall / 2146.160s user / 319.795s system / 3,425,612KiB RSS, 793 sources / 387,532 lines. Both parent observations are retained; the repeat does not replace the primary or causally normalize shared-host variation. These are separately labeled revisions. Larger explicit interfaces and peak memory relative to the compatibility baseline remain maintenance costs.

Current-head clean root: 1677.046s wall / 2433.007s user / 339.079s system CPU / 3,428,496KiB maximum child RSS. Load 46.41→47.69. Relative to parent7c2452ab70’s retained repeat, observed wall +53.82%, user CPU +13.37%, maximum child RSS +0.08%. Relative to the original compatibility baseline, observed wall +35.20% and RSS +58.31%. These shared-host observations are not causal speedup estimates. Identical complete source/dependency closures: 632, median current/parent rounded per-file wall ratio 1.345; descriptive only, without normalization. A contemporaneous clean frozen-parent control is in progress under the current shared-host conditions to investigate the whole-build regression; no causal conclusion is claimed. The current primary result and both earlier parent measurements remain unchanged.

Ten pairs compare frozen 7c2452a with this source, sequentially, with two threads and warm exact external dependencies. Owned closures change and shared-host load is uncontrolled. Lower observations: wall 4/10, user CPU 7/10, peak child RSS 9/10. All regressions remain in the table.

Module Before / after wall, s Before / after user CPU, s Before / after maximum child RSS, KiB
Step1ZeroDividerAnchorPE 4.380 / 4.891 4.284 / 3.751 1,002,840 / 994,876
Step1ZeroDividerAnchorNonPE 3.878 / 4.721 4.312 / 4.413 982,676 / 977,372
HierarchyCounterexamplePenultimateElementary 4.634 / 6.005 5.172 / 4.819 1,045,672 / 1,028,312
ChangeLemmaMixedClosedFinal 7.228 / 6.761 8.863 / 7.917 1,087,812 / 1,084,188
ChangeLemmaMixedLargestClosed 12.385 / 10.829 16.104 / 15.135 1,326,272 / 1,320,800
TdTerminalRERebuild 16.101 / 17.595 23.730 / 22.444 1,612,104 / 1,587,116
TerminalSeriesRebuildTransport 14.774 / 11.238 20.991 / 16.861 1,375,980 / 1,301,252
RevisitingTerminalStatements 14.088 / 5.574 12.624 / 4.135 2,142,124 / 1,151,000
TdTerminalSEPERebuild 19.076 / 23.005 20.715 / 21.882 3,027,804 / 3,033,776
TerminalSeriesRebuildPreparation 10.671 / 13.785 15.124 / 16.317 1,208,416 / 1,158,116

Direct profiles use lake env lean --profile --setup, omit artifact output and dependency compilation. Whole Lake builds include artifact generation and dependencies. Focused improvements do not establish a whole-project speedup.

Integration uses the protected native ALLGREEN/SQUASH queue only after current-head checks, applicable current-main validation and resolved reviews. Required contexts are inspected individually. Daily asynchronous documentation and advisory profiling are not merge gates; Documentation preflight and every other applicable protected check remain required. No deployed-documentation announcement is made.

@Vilin97 Vilin97 left a comment •

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Draft intake review at 4fc0ab7e543f68ab62c471f2780b05e3bd8f2974.

The exported statements have the advertised finite loopless multigraph scope. LooplessMultigraph assigns an unordered endpoint pair to each independent edge identity, so parallel edges remain distinct. Proper full colorings assign every edge a color in Fin k; ChromaticIndex is the least such k. The density ranges over odd vertex sets of size at least three and counts internal edges with multiplicity. GeneralHighIndexElementary concludes the stated density equality, and the public bound follows without an additional graph or coloring hypothesis. These are statement and definition checks, not a completed review of the entire port.

The complete public inventory is 729 Lean files and one project card, all additions within the content allowlist. Final acceptance remains pending: the final-head aggregate build and warning/linters/trust checks, preservation of the upstream theorem contracts through the final cleanup, the independent project reviews, and normal protected integration. The earlier build, axiom-audit, contract and timing checkpoints in the description are historical author reports and do not establish those final-head results. Profiling remains advisory.

Keep this draft while its published validation work finishes. No queue or auto-merge action is appropriate at this stage.

Additional maintainability feedback at the same head:

In AbsentOwnerReplacement.lean, helperHNcard363Conditions carries the hierarchy, counterexample, prefix constructions and NineN hypotheses into a bound on the union of two optional colors. Its proof uses only the two optional values and generic finite-set/list cardinality bounds, but the caller must supply the larger proof state. This couples a generic fact to unrelated hierarchy details and makes later changes require unnecessary contract and caller edits. Please express the two-Option cardinality bound as a generic lemma and instantiate it here; check the neighboring suffix-membership helper for the same unnecessary context coupling. This is advisory maintainability feedback.

All 730 published bodies and the complete 729-module import graph are now available and checked for identity, coverage and acyclicity. Full proof-port, semantic and current-head validation acceptance remains pending.

@Vilin97

Vilin97 commented Nov 5, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review current head 3661f7454c7eb9e48f60f72a45b4a981ae3fabad under the project rubrics. Source preparation is stable; the clean optimized measurement and exact-head local audits are still running. Earlier build and audit checkpoints do not establish final-head validation.

@Vilin97
Vilin97 marked this pull request as ready for review November 5, 2026 20:11
@greptile-apps

greptile-apps Bot commented Nov 5, 2026 •

Copy link
Copy Markdown

Advisory cross-file review against Lean Pool's supervisory rubric. This is not by itself a significance, source-verification, or merge verdict.

RetriggerView in Greptile

[Medium impact] No blocking defect was established in the examined repairs, but this partial review does not establish full merge readiness.

Summary

Imports the Goldberg–Seymour edge-coloring theorem and its high-index equality result. The latest revision shares closed-component, hierarchy-replacement, penultimate-elementarity, and series-cast proofs.

  • Finite loopless multigraphs now have a proved Goldberg–Seymour coloring bound.
  • Mathlib graphs with finite active sets can use the coloring bound.

Reviews (14) · Last reviewed commit: "Share closed-component and certified-ser..." · Reviewed by Greptile

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed published head f1f8c0a82cccbfb8a5ebb4a64bbd14d80c2a1ed3. The PR is now ready for review, so the earlier draft-readiness note is superseded.

The mathematical scope and provenance review is favorable: the finite loopless multigraph model retains independent edge identities and multiplicity, and the final colouring statement uses the full edge domain. I traced the port against the licensed upstream dependency closure, including the explicit-context and hierarchy-predicate reformulations; I found no added mathematical premise that weakens the claimed theorem.

I also reviewed the complete latest two-file delta. The two new Preamble lemmas prove the natural-number bounds already used by the Fin indices. Replacing the arithmetic proof witnesses preserves the index values and assumptions; the other edits rename unused binders to _ while retaining their types. This does not resolve the separate maintainability suggestion in the earlier review, which remains advisory.

This is a source review, with current-head compilation, trust/quality checks and the configured independent review still to qualify. Author-reported local audits and timing results have not been counted as independent validation. Integration must also wait for the applicable current-main checks and normal protected queue.

@Vilin97

Vilin97 commented Nov 5, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please run the configured project-rubric review for current published head f1f8c0a82cccbfb8a5ebb4a64bbd14d80c2a1ed3. The earlier 3661f7454c7eb9e48f60f72a45b4a981ae3fabad request does not establish acceptance for this revision. The final two-file edit shares arithmetic bound proofs; current-head validation remains independent.

@github-actions

github-actions Bot commented Nov 5, 2026 •

Copy link
Copy Markdown
Contributor

Proof profile (new / modified Lean files)

lake build wall time (changed modules): 1170.19 s (= 19.50 min) — user 4128.29 s, sys 373.34 s.

This build covers the changed modules and their dependency cones on top of the restored cache. The serial per-file sums below are useful for ranking slow files, not as a build budget.

Total heartbeats: 29,429,904 maxHeartbeats units across 793 valid files (383,626 added LOC).

Sum of lean --profile: 2773481.8 ms (= 2773.48 s) across 797 valid files. Import-excluded time: 2218204.8 ms (= 2218.20 s).

Count-heartbeats wall-clock total: 7517.95 s. Repeated import cost inside lean --profile: 555277.0 ms (= 555.28 s).

Heartbeat values sum disjoint root command traces with trace.profiler.useHeartbeats and synchronous elaboration, converted from raw allocations to maxHeartbeats units by dividing by 1000. They include command elaboration and kernel checking, exclude imports, and include profiler overhead; they are not comparable to the deprecated linter's totals. Per-file wall clocks are measured under parallel load and are noisier than heartbeats.

LOC counts added lines in the profiled Lean files from this PR diff.

File LOC Heartbeats (maxHB) Count wall (s) lean --profile (s) Without import (s) Import (s) Commands Errors
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseOneOneNonexceptional.lean 3,114 540,819 112.91 35.02 34.27 0.75 49 0
LeanPool/GoldbergSeymour/HierarchyClaimNineFirstUseSeed.lean 3,731 479,865 102.43 34.93 34.15 0.78 63 0
LeanPool/GoldbergSeymour/SplitSwapPreparation.lean 1,661 464,355 193.14 50.26 49.52 0.74 48 0
LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalization.lean 1,305 424,591 94.23 25.33 24.57 0.76 14 0
LeanPool/GoldbergSeymour/HierarchySituationThreeClaimJMinusOneNonempty.lean 4,116 408,628 65.41 29.11 28.34 0.77 59 0
LeanPool/GoldbergSeymour/Step1CaseTwoInsideZeroNonPE.lean 1,120 396,621 41.17 13.69 12.97 0.72 19 0
LeanPool/GoldbergSeymour/ScheideHeightFiveGammaEdges.lean 2,989 396,514 61.42 25.95 25.24 0.71 50 0
LeanPool/GoldbergSeymour/AbsentOwnerReplacement.lean 2,156 386,598 82.84 30.67 29.91 0.75 28 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseOneOneStoredException.lean 4,003 381,188 81.40 28.45 27.71 0.75 68 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseTwoOneNonexceptional.lean 4,004 376,607 92.84 30.41 29.63 0.78 64 0
LeanPool/GoldbergSeymour/HierarchyCaseThreePreparation.lean 1,570 358,182 57.24 14.98 14.23 0.75 69 0
LeanPool/GoldbergSeymour/TdTerminalRERebuild.lean 7,491 340,099 59.62 25.01 24.28 0.73 28 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseTwoTwo.lean 4,238 330,587 76.13 26.59 25.83 0.76 59 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseOneTwo.lean 2,873 321,710 50.59 24.49 23.72 0.76 52 0
LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean 3,330 313,532 47.25 22.50 21.76 0.73 34 0
LeanPool/GoldbergSeymour/RevisitingTerminalPreparation.lean 3,337 294,256 53.39 19.53 18.83 0.70 71 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeTwo.lean 3,522 282,639 48.66 20.94 20.17 0.76 41 0
LeanPool/GoldbergSeymour/ExtensionBaseAuxiliary.lean 5,337 269,528 60.61 23.85 23.14 0.71 90 0
LeanPool/GoldbergSeymour/EarlierPECycleFirstNonrevisitingInternal.lean 1,540 267,868 57.34 15.13 14.44 0.69 36 0
LeanPool/GoldbergSeymour/HierarchySituationThreeDisjointThetaUnstoredOutsideImpossible.lean 1,424 261,702 78.42 25.67 24.93 0.75 17 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation1.lean 4,882 256,486 52.29 17.21 16.48 0.73 53 0
LeanPool/GoldbergSeymour/ScheideHeightFiveOutsideLinks.lean 2,413 250,413 45.09 16.07 15.35 0.72 55 0
LeanPool/GoldbergSeymour/HierarchySituationThreeDisjointThetaStoredImpossible.lean 2,016 248,918 45.63 17.99 17.23 0.76 28 0
LeanPool/GoldbergSeymour/HierarchySituationThreeComponentIntersectionShortening.lean 3,418 248,271 54.90 20.87 20.11 0.76 51 0
LeanPool/GoldbergSeymour/ExtensionBaseBranchLemmas.lean 4,764 247,553 45.27 21.56 20.83 0.73 45 0
LeanPool/GoldbergSeymour/HierarchySituationThreeEligibleIndexBound.lean 1,251 245,418 44.18 17.40 16.65 0.75 26 0
LeanPool/GoldbergSeymour/ExtensionRulesTerminalEarlierAppearance.lean 1,745 238,695 37.16 19.20 18.50 0.69 25 0
LeanPool/GoldbergSeymour/TerminalSeriesRebuildTransport.lean 4,601 238,682 55.53 18.44 17.71 0.73 82 0
LeanPool/GoldbergSeymour/HierarchyClaimNinePENormalization.lean 2,414 234,580 36.47 15.64 14.89 0.75 29 0
LeanPool/GoldbergSeymour/ChangeLemmaMixedZeroNonclosed.lean 2,560 234,017 50.54 16.23 15.50 0.73 45 0
LeanPool/GoldbergSeymour/TerminalSeriesRebuildPreparation.lean 3,937 233,568 39.33 17.94 17.23 0.71 70 0
LeanPool/GoldbergSeymour/ChangeLemmaMixedNoClosed.lean 2,568 227,130 41.66 15.83 15.08 0.75 31 0
LeanPool/GoldbergSeymour/HierarchySituationThreeDisjointThetaUnstoredBetaStoredImpossible.lean 2,583 221,825 44.10 17.33 16.56 0.77 35 0
LeanPool/GoldbergSeymour/ChangeLemmaMixedLargestClosed.lean 3,711 220,746 41.87 17.81 17.07 0.74 53 0
LeanPool/GoldbergSeymour/OneDividerRefresh.lean 2,078 217,806 41.76 13.68 12.98 0.70 13 0
LeanPool/GoldbergSeymour/EligibleIndexBoundPreparation.lean 4,456 215,415 47.31 14.47 13.73 0.73 58 0
LeanPool/GoldbergSeymour/ScheideStructuralInternalPair.lean 2,220 215,342 44.22 18.42 17.70 0.71 26 0
LeanPool/GoldbergSeymour/ScheideOrderNineBlockCompletion.lean 2,949 213,580 41.84 18.83 18.09 0.75 31 0
LeanPool/GoldbergSeymour/ScheideOrderNineRebasingPreparation.lean 3,782 208,793 34.24 18.33 17.60 0.73 53 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne/Preparation1.lean 4,900 203,102 43.56 16.52 15.77 0.76 84 0
LeanPool/GoldbergSeymour/ExtensionBaseStepLemmas.lean 4,110 198,005 42.70 15.48 14.77 0.72 77 0
LeanPool/GoldbergSeymour/HierarchyCounterexampleOneAdditionPositiveDividerImpossible.lean 3,680 186,090 46.20 15.06 14.32 0.74 42 0
LeanPool/GoldbergSeymour/TerminalKempeStageSwitch.lean 1,593 182,419 42.81 12.82 12.05 0.78 21 0
LeanPool/GoldbergSeymour/ScheideSymmetricReplacementPathOrder.lean 1,480 180,548 39.09 14.68 13.97 0.71 20 0
LeanPool/GoldbergSeymour/Step1CaseTwoOutsideRecoloredPrefix.lean 1,139 180,525 30.65 9.05 8.34 0.70 15 0
LeanPool/GoldbergSeymour/ScheideOrderNineBlockStructure.lean 2,529 175,345 40.84 16.12 15.40 0.73 21 0
LeanPool/GoldbergSeymour/CriticalGraphElementaryWitness.lean 743 171,135 30.09 10.50 9.77 0.73 15 0
LeanPool/GoldbergSeymour/BaseControl.lean 1,417 158,464 41.83 12.15 11.41 0.74 29 0
LeanPool/GoldbergSeymour/ScheideStructuralReordering.lean 1,255 155,423 29.50 11.85 11.13 0.72 20 0
LeanPool/GoldbergSeymour/OutsidePrefixBranch.lean 1,778 153,768 34.32 9.62 8.89 0.73 33 0
LeanPool/GoldbergSeymour/ScheideReplacementTreeSplice.lean 644 152,132 25.08 8.23 7.53 0.70 16 0
LeanPool/GoldbergSeymour/ScheideReplacementExitNotDefective.lean 234 150,573 30.10 7.81 7.10 0.72 7 0
LeanPool/GoldbergSeymour/LateOwnerReplacement.lean 1,177 150,420 30.54 11.95 11.21 0.74 17 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseTwoOneStoredException.lean 1,760 150,124 40.17 10.94 10.19 0.75 20 0
LeanPool/GoldbergSeymour/ExtensionBaseBranchPreparation.lean 3,578 145,341 39.68 9.25 8.53 0.72 75 0
LeanPool/GoldbergSeymour/ScheideDefectiveChainLastReturnNoFree.lean 801 145,331 36.12 9.54 8.81 0.72 15 0
LeanPool/GoldbergSeymour/HierarchyClaimNineFirstUseAfterSeed.lean 1,665 143,094 29.98 11.32 10.56 0.75 33 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne/Preparation2.lean 1,607 138,810 34.29 12.24 11.50 0.74 22 0
LeanPool/GoldbergSeymour/RutgersStrictShortening.lean 3,243 138,495 33.83 10.71 10.00 0.71 37 0
LeanPool/GoldbergSeymour/ParallelExtensionUndoStable.lean 1,449 138,229 27.70 9.44 8.73 0.71 26 0
LeanPool/GoldbergSeymour/EligibleIndexBoundConstruction.lean 590 138,066 26.17 8.11 7.37 0.73 9 0
LeanPool/GoldbergSeymour/StableChangeCaseThree/Preparation1.lean 2,116 136,947 35.71 10.54 9.81 0.73 48 0
LeanPool/GoldbergSeymour/HierarchyCounterexampleOneAdditionZeroDividerImpossible.lean 1,662 135,699 21.23 10.37 9.63 0.74 37 0
LeanPool/GoldbergSeymour/HierarchySituationThreeDisjointPreparation.lean 303 132,910 36.74 5.86 5.12 0.75 8 0
LeanPool/GoldbergSeymour/ExtensionRulesTerminalStoredDisjoint.lean 1,817 130,376 27.75 10.62 9.91 0.71 43 0
LeanPool/GoldbergSeymour/HierarchyClaimNineUnusedTailColor.lean 951 126,542 30.29 9.49 8.74 0.75 16 0
LeanPool/GoldbergSeymour/ScheideSmallHeightElementary.lean 1,328 124,956 25.17 10.72 9.93 0.80 20 0
LeanPool/GoldbergSeymour/ScheideBalancedCandidateMaximumOrder.lean 1,125 123,214 24.72 8.58 7.88 0.70 24 0
LeanPool/GoldbergSeymour/ScheideAbsorbingElementary.lean 320 119,854 21.78 5.55 4.85 0.70 10 0
LeanPool/GoldbergSeymour/ScheideReversedPathPreparation.lean 526 118,688 16.70 5.28 4.57 0.71 61 0
LeanPool/GoldbergSeymour/HierarchySituationOneShorteningContradiction.lean 1,919 117,505 24.91 9.37 8.63 0.74 22 0
LeanPool/GoldbergSeymour/ChangeLemmaMixedClosedFinal.lean 1,728 117,278 31.50 9.69 8.95 0.74 25 0
LeanPool/GoldbergSeymour/ScheideSymmetricOriginalPathOrder.lean 977 114,923 22.53 9.40 8.69 0.71 13 0
LeanPool/GoldbergSeymour/ScheideSymmetricReplacementBoundaryAvoidance.lean 1,164 110,592 23.39 10.21 9.50 0.71 19 0
LeanPool/GoldbergSeymour/ScheideSelectedBlockDeletion.lean 763 109,168 19.09 9.31 8.62 0.69 11 0
LeanPool/GoldbergSeymour/ParallelTerminalPEPreprocessing.lean 1,635 109,069 22.70 8.38 7.63 0.74 26 0
LeanPool/GoldbergSeymour/ElementaryClosedNoninterchangeableDisjointExitPaths.lean 1,119 109,025 18.52 7.58 6.89 0.69 20 0
LeanPool/GoldbergSeymour/HierarchySituationTwoReorderedTreesCertified/Preparation1.lean 1,388 108,801 24.54 8.76 8.06 0.71 33 0
LeanPool/GoldbergSeymour/InterchangePETreeAwayFromDelta.lean 1,422 106,431 24.88 8.97 8.23 0.75 28 0
LeanPool/GoldbergSeymour/RutgersMiddleExitOutsideTerminalLadder.lean 1,364 105,689 19.96 8.59 7.87 0.72 24 0
LeanPool/GoldbergSeymour/ParallelSupportClosureProperties.lean 1,635 104,172 26.39 8.54 7.83 0.72 24 0
LeanPool/GoldbergSeymour/ScheideTrunkRotationNormal.lean 1,160 103,093 24.11 8.88 8.15 0.73 25 0
LeanPool/GoldbergSeymour/StableSeriesCycleComponentTransport.lean 1,229 101,260 28.01 7.43 6.74 0.69 27 0
LeanPool/GoldbergSeymour/ScheideDefectiveSecondTerminalComponent.lean 1,031 101,007 24.30 7.91 7.21 0.71 21 0
LeanPool/GoldbergSeymour/ScheideMaximalKempePath.lean 773 97,857 26.27 7.15 6.45 0.70 13 0
LeanPool/GoldbergSeymour/ScheideDefectiveCrossingSelection.lean 539 95,790 18.92 5.52 4.81 0.71 20 0
LeanPool/GoldbergSeymour/Step1CaseTwoOutsidePrefixHierarchy.lean 1,948 95,429 21.32 6.42 5.69 0.73 21 0
LeanPool/GoldbergSeymour/Step1CaseOneOutsideStar.lean 1,607 93,519 17.58 7.35 6.61 0.74 25 0
LeanPool/GoldbergSeymour/HkuTreeColorsControlled.lean 954 91,827 16.78 7.12 6.41 0.71 16 0
LeanPool/GoldbergSeymour/StableChangeCasesOneTwo.lean 1,385 91,532 21.53 7.98 7.23 0.75 20 0
LeanPool/GoldbergSeymour/GoodHierarchySameDividerReconstruction.lean 1,454 91,256 16.96 7.49 6.80 0.69 15 0
LeanPool/GoldbergSeymour/ConditionNineTransport.lean 229 90,991 18.93 4.32 3.61 0.71 7 0
LeanPool/GoldbergSeymour/BaseExtraReplacement.lean 1,206 90,392 16.64 7.97 7.22 0.76 23 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim45.lean 1,873 90,264 15.83 8.13 7.40 0.73 26 0
LeanPool/GoldbergSeymour/ScheideEnlargedBoundarySelection.lean 1,134 88,421 23.60 7.09 6.37 0.72 22 0
LeanPool/GoldbergSeymour/ScheideGraphHeightOdd.lean 349 85,220 23.06 5.46 4.71 0.74 8 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim46.lean 1,801 84,630 18.46 7.32 6.61 0.71 30 0
LeanPool/GoldbergSeymour/Basic2TerminalPE.lean 1,363 84,179 14.37 7.41 6.68 0.73 24 0
LeanPool/GoldbergSeymour/ScheideReversedKempePathTree.lean 521 83,547 21.72 6.66 5.96 0.70 10 0
LeanPool/GoldbergSeymour/ScheideDefectiveTerminalComponent.lean 813 82,754 20.88 6.43 5.73 0.70 18 0
LeanPool/GoldbergSeymour/ScheideSymmetricOriginalBoundaryAvoidance.lean 986 82,276 18.94 7.45 6.74 0.71 15 0
LeanPool/GoldbergSeymour/ScheideReplacementBoundaryAtLeastThree.lean 1,146 81,792 19.40 7.26 6.53 0.73 22 0
LeanPool/GoldbergSeymour/TashTreeLastIndexFirstNormalForm.lean 759 81,691 20.61 6.71 6.02 0.69 13 0
LeanPool/GoldbergSeymour/TdReplacementPrefixExact.lean 1,656 81,262 21.25 7.30 6.56 0.73 17 0
LeanPool/GoldbergSeymour/StableChangeCasesOneTwoFullTail.lean 1,542 80,914 13.44 6.79 6.05 0.74 20 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmC.lean 1,894 80,199 22.92 6.23 5.53 0.70 23 0
LeanPool/GoldbergSeymour/ScheideEnlargedClosed.lean 1,048 78,771 15.11 6.03 5.31 0.72 31 0
LeanPool/GoldbergSeymour/TashTreeLastIndexThirdNormalForm.lean 807 78,526 17.21 6.77 6.05 0.71 15 0
LeanPool/GoldbergSeymour/HkuParallelBoundaryStructure.lean 949 78,389 18.69 6.71 6.00 0.71 14 0
LeanPool/GoldbergSeymour/Step1CaseTwoInsidePositiveDivider.lean 704 78,303 14.08 4.48 3.75 0.72 10 0
LeanPool/GoldbergSeymour/ScheideLargeHeightOneTailPair.lean 1,088 77,720 16.61 6.63 5.84 0.79 22 0
LeanPool/GoldbergSeymour/HierarchyOrderedExitReduction.lean 964 77,248 18.84 6.91 6.21 0.70 27 0
LeanPool/GoldbergSeymour/ScheideExitNoFree.lean 701 75,100 16.26 5.87 5.17 0.70 13 0
LeanPool/GoldbergSeymour/ScheideDefectiveThirdBoundaryEdge.lean 1,219 74,041 15.58 6.59 5.88 0.70 23 0
LeanPool/GoldbergSeymour/CurrentElementaryOrGoodHierarchyConstructionLarge.lean 523 73,603 21.94 11.93 11.15 0.78 10 0
LeanPool/GoldbergSeymour/ElementarySingleBoundaryInterchangeable.lean 916 72,873 18.19 5.82 5.12 0.70 21 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim44.lean 1,610 72,035 20.34 6.55 5.85 0.69 36 0
LeanPool/GoldbergSeymour/GoodHierarchyElementaryLarge.lean 1,044 71,975 16.42 5.30 4.52 0.78 17 0
LeanPool/GoldbergSeymour/Step1ZeroDividerAnchorNonPE.lean 794 70,734 11.86 4.96 4.25 0.71 13 0
LeanPool/GoldbergSeymour/StarredPrefixPreparation.lean 1,671 70,537 20.63 6.69 5.92 0.77 20 0
LeanPool/GoldbergSeymour/ScheideSymmetricReplacementFreePath.lean 707 69,477 17.68 6.32 5.61 0.71 14 0
LeanPool/GoldbergSeymour/ExtensionBaseStrictDeltaExclusion.lean 1,252 69,430 14.31 5.36 4.67 0.70 19 0
LeanPool/GoldbergSeymour/Step1ZeroDividerAnchorPE.lean 677 69,345 14.12 4.29 3.55 0.74 13 0
LeanPool/GoldbergSeymour/ScheideDefectiveSetupExists.lean 668 68,965 12.87 6.09 5.36 0.72 15 0
LeanPool/GoldbergSeymour/GoodHierarchyPrefixRepackage.lean 371 68,763 13.78 5.14 4.42 0.72 10 0
LeanPool/GoldbergSeymour/StronglyClosedWitnessElementary.lean 1,022 68,523 13.91 5.93 5.19 0.74 23 0
LeanPool/GoldbergSeymour/HierarchySituationOneAdvanceOutsideStored.lean 1,106 68,027 15.62 5.41 4.67 0.75 19 0
LeanPool/GoldbergSeymour/TashTreeEarlyBetaNormalization.lean 750 67,915 14.43 6.07 5.36 0.71 16 0
LeanPool/GoldbergSeymour/HierarchySituationTwoReorderedTreesCertified/Preparation2.lean 495 64,883 18.65 4.83 4.11 0.72 10 0
LeanPool/GoldbergSeymour/ChangeLemmaBothInside.lean 740 64,866 16.24 5.48 4.74 0.75 20 0
LeanPool/GoldbergSeymour/Step1ExitLegMinimumExists.lean 1,070 64,591 14.23 5.26 4.56 0.70 14 0
LeanPool/GoldbergSeymour/ExtensionRulesEarlierIndices.lean 793 64,179 13.09 5.39 4.69 0.70 14 0
LeanPool/GoldbergSeymour/TashTreeLastIndexDeletion.lean 479 64,083 13.89 5.23 4.57 0.66 11 0
LeanPool/GoldbergSeymour/DisplayedEdges.lean 525 63,355 15.01 5.05 4.33 0.72 16 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation6.lean 1,244 62,997 17.38 4.77 4.03 0.74 10 0
LeanPool/GoldbergSeymour/InterchangePEClosedCore.lean 904 62,864 16.42 5.46 4.71 0.75 18 0
LeanPool/GoldbergSeymour/TchangeKempeClosurePreparation.lean 1,028 62,797 16.01 5.53 4.82 0.71 19 0
LeanPool/GoldbergSeymour/ScheideTrunkRotationTree.lean 1,257 62,382 11.13 5.62 4.90 0.72 23 0
LeanPool/GoldbergSeymour/StableChangeCasesOneTwoStarredTail.lean 1,215 62,324 14.86 5.40 4.66 0.74 18 0
LeanPool/GoldbergSeymour/ScheideDeletedMissingReplacementInternal.lean 931 62,273 14.62 5.55 4.84 0.71 20 0
LeanPool/GoldbergSeymour/OutsideTreeColorSwapStable.lean 218 61,341 10.35 3.23 2.61 0.63 7 0
LeanPool/GoldbergSeymour/StableChangeCasesOneTwoSplitTail.lean 1,172 61,052 12.87 5.54 4.78 0.76 16 0
LeanPool/GoldbergSeymour/ScheideTrunkRotationColoring.lean 848 60,377 15.94 5.34 4.61 0.73 15 0
LeanPool/GoldbergSeymour/ElementaryClosedExitPairDistinctComponents.lean 667 59,053 12.57 4.43 3.73 0.71 13 0
LeanPool/GoldbergSeymour/ParallelStepRootComponentSetup.lean 624 58,984 11.54 4.45 3.75 0.70 10 0
LeanPool/GoldbergSeymour/SharedFacts/DisjointThetaTransport.lean 1,050 57,165 14.27 4.93 4.18 0.74 60 0
LeanPool/GoldbergSeymour/Step1ExitLegThetaPositive.lean 498 57,049 11.75 3.48 2.78 0.70 13 0
LeanPool/GoldbergSeymour/ScheideReplacementAbsorbing.lean 811 56,861 12.97 4.61 3.90 0.71 13 0
LeanPool/GoldbergSeymour/SharedFacts/MixedChangeTransport/Preparation1.lean 1,236 56,578 11.11 3.88 3.19 0.69 33 0
LeanPool/GoldbergSeymour/ScheideTwoColorLastExitPath.lean 586 56,340 14.32 4.52 3.81 0.71 10 0
LeanPool/GoldbergSeymour/HierarchySituationOneAdvanceInsideStored.lean 582 55,755 9.82 4.72 3.97 0.75 12 0
LeanPool/GoldbergSeymour/ScheideExitVertexTreeExit.lean 284 55,389 13.31 3.55 2.82 0.73 8 0
LeanPool/GoldbergSeymour/TchangeStrictShortening.lean 581 55,338 13.17 4.25 3.55 0.70 12 0
LeanPool/GoldbergSeymour/ScheideReplacementBoundaryParity.lean 725 55,084 12.22 4.46 3.76 0.70 25 0
LeanPool/GoldbergSeymour/ScheideReplacementMissingDeletedInternal.lean 904 54,992 14.11 5.17 4.45 0.71 22 0
LeanPool/GoldbergSeymour/HkuIncidentColorPreserved.lean 607 54,389 14.30 4.90 4.20 0.70 13 0
LeanPool/GoldbergSeymour/Step1CaseTwoInsideZeroPE.lean 513 53,857 7.84 2.68 1.95 0.74 9 0
LeanPool/GoldbergSeymour/ExtensionBasePreparations.lean 1,157 53,154 14.43 3.50 2.78 0.71 15 0
LeanPool/GoldbergSeymour/TerminalHierarchyRestore.lean 747 53,031 14.70 5.04 4.33 0.71 15 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim43MissingColors.lean 1,052 52,437 10.57 4.93 4.23 0.70 18 0
LeanPool/GoldbergSeymour/ScheideReplacementBoundaryAtMostThree.lean 719 52,309 14.84 4.57 3.85 0.72 18 0
LeanPool/GoldbergSeymour/Step1ExitLegThetaZeroNonparallel.lean 460 52,230 9.10 4.07 3.36 0.71 11 0
LeanPool/GoldbergSeymour/Step1CaseOneInsideZeroPE.lean 524 51,777 11.48 2.84 2.08 0.75 9 0
LeanPool/GoldbergSeymour/RevisitingTerminalStatements.lean 881 50,778 7.54 3.80 3.10 0.70 9 0
LeanPool/GoldbergSeymour/HierarchyCounterexamplePenultimateElementary.lean 656 50,233 14.38 4.87 4.13 0.74 12 0
LeanPool/GoldbergSeymour/HierarchySituationTwoImpossible.lean 514 50,174 13.60 4.38 3.58 0.80 16 0
LeanPool/GoldbergSeymour/TwoColorWalkConfinement.lean 256 49,480 5.28 2.43 1.74 0.69 21 0
LeanPool/GoldbergSeymour/TreeExitPathTransport.lean 241 49,042 6.64 1.94 1.24 0.70 16 0
LeanPool/GoldbergSeymour/TchangeOutsideSwapPreparation.lean 683 48,798 11.59 4.61 3.91 0.70 13 0
LeanPool/GoldbergSeymour/ScheideEnlargedSwitchTransport.lean 724 48,295 10.85 4.43 3.72 0.71 14 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmAColorState.lean 877 48,161 13.06 4.47 3.77 0.69 18 0
LeanPool/GoldbergSeymour/ParallelTwoConstituentPathContradiction.lean 299 48,149 11.50 2.81 2.13 0.69 8 0
LeanPool/GoldbergSeymour/Basic2TerminalSERE.lean 780 47,476 10.82 4.52 3.82 0.70 12 0
LeanPool/GoldbergSeymour/SharedFacts/MixedChangeTransport/Preparation2.lean 778 46,994 12.77 4.69 3.97 0.72 37 0
LeanPool/GoldbergSeymour/StrongInterchangeabilityKempePreserved.lean 540 46,979 14.10 3.47 2.78 0.69 11 0
LeanPool/GoldbergSeymour/ExtensionBaseCaseTwoContradiction.lean 1,449 46,943 9.87 4.97 4.27 0.70 23 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim45Singleton.lean 1,094 46,479 14.97 4.69 3.98 0.71 22 0
LeanPool/GoldbergSeymour/GoodHierarchyTerminalPrefixRepackage.lean 350 46,089 11.43 3.44 2.74 0.70 9 0
LeanPool/GoldbergSeymour/ExtensionBaseCaseTwoObservation21.lean 1,020 46,057 13.94 4.45 3.76 0.69 18 0
LeanPool/GoldbergSeymour/ScheideReplacementMaximum.lean 429 45,848 8.72 4.26 3.54 0.72 11 0
LeanPool/GoldbergSeymour/ScheideDefectiveReturnContradiction.lean 1,122 45,490 13.68 4.70 3.99 0.70 19 0
LeanPool/GoldbergSeymour/DefectiveColorComponentPath.lean 635 44,802 13.68 4.12 3.41 0.71 14 0
LeanPool/GoldbergSeymour/AlgorithmThreeOneStepExists.lean 1,072 44,781 9.33 4.47 3.75 0.72 25 0
LeanPool/GoldbergSeymour/TwoColorComponentLeafPaths.lean 220 44,132 5.94 1.90 1.21 0.69 11 0
LeanPool/GoldbergSeymour/DensityLowerBound.lean 170 43,774 9.21 2.87 2.12 0.74 7 0
LeanPool/GoldbergSeymour/InterchangePEClosureConstituent.lean 828 43,496 9.96 4.47 3.74 0.73 20 0
LeanPool/GoldbergSeymour/TashkinovAlternatingSegmentAppend.lean 734 43,197 11.29 4.49 3.80 0.69 17 0
LeanPool/GoldbergSeymour/AlgorithmFiveSixFixedRootRefresh.lean 624 42,744 13.46 4.65 3.88 0.77 15 0
LeanPool/GoldbergSeymour/ScheideDefectiveChainDepartureReturn.lean 363 41,920 12.81 3.66 2.96 0.71 10 0
LeanPool/GoldbergSeymour/HierarchyTailMissingColorExclusion.lean 911 41,345 12.88 4.31 3.61 0.71 18 0
LeanPool/GoldbergSeymour/TwoColorComponentNearestSegment.lean 530 41,279 10.41 3.86 3.17 0.69 15 0
LeanPool/GoldbergSeymour/HierarchySituationTwoCaseTwoExclusions.lean 402 41,017 11.14 4.17 3.43 0.74 10 0
LeanPool/GoldbergSeymour/ElementaryClosedExitPairSameComponent.lean 405 40,631 8.25 2.56 1.86 0.70 12 0
LeanPool/GoldbergSeymour/NineN.lean 605 40,444 9.16 4.05 3.35 0.70 13 0
LeanPool/GoldbergSeymour/HkuUnsupportedVertexColors.lean 483 40,152 12.54 3.70 3.00 0.70 13 0
LeanPool/GoldbergSeymour/ScheideDefectiveLastReturnExists.lean 350 39,945 8.76 2.92 2.22 0.70 9 0
LeanPool/GoldbergSeymour/Step1CaseTwoOutsideRestrictedAugmentation.lean 356 38,859 10.38 4.31 3.60 0.71 8 0
LeanPool/GoldbergSeymour/ScheideSymmetricOriginalFreePath.lean 348 37,940 8.24 3.46 2.76 0.70 9 0
LeanPool/GoldbergSeymour/SupportingPEMissingTransport.lean 672 37,934 11.28 3.64 2.95 0.69 13 0
LeanPool/GoldbergSeymour/SupportingPEStoredIntersection.lean 834 37,871 10.73 4.06 3.36 0.70 14 0
LeanPool/GoldbergSeymour/ScheideGlobalMaximumFourFree.lean 228 37,113 8.96 2.93 2.22 0.70 7 0
LeanPool/GoldbergSeymour/HierarchyClaimNine.lean 636 36,937 12.97 3.52 2.76 0.76 12 0
LeanPool/GoldbergSeymour/ScheideDefectiveChainBoundaryEdges.lean 667 36,044 8.29 3.48 2.77 0.71 20 0
LeanPool/GoldbergSeymour/ExtensionRulesTerminalLastAppearance.lean 717 35,996 11.79 3.66 2.95 0.71 15 0
LeanPool/GoldbergSeymour/TashkinovSeriesStepPrefix.lean 1,073 35,789 8.95 3.51 2.81 0.70 17 0
LeanPool/GoldbergSeymour/ParallelTerminalAwayInterchangeable.lean 508 35,743 11.15 3.33 2.62 0.71 11 0
LeanPool/GoldbergSeymour/FirstEntryClipping.lean 159 35,026 6.86 1.60 0.91 0.69 8 0
LeanPool/GoldbergSeymour/NormalizedDatum.lean 203 35,013 12.23 2.93 2.21 0.72 7 0
LeanPool/GoldbergSeymour/HierarchyLEMStable.lean 1,123 34,965 8.34 3.74 3.00 0.74 27 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapNonElementary.lean 332 34,904 10.49 2.36 1.66 0.71 9 0
LeanPool/GoldbergSeymour/ScheideReplacementUnionClosed.lean 465 34,835 10.34 3.20 2.49 0.71 10 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapPreservesDisjointComponent.lean 141 33,829 7.93 2.07 1.37 0.70 7 0
LeanPool/GoldbergSeymour/ExtensionBaseClaimMissingColors.lean 690 33,471 9.07 3.64 2.95 0.69 14 0
LeanPool/GoldbergSeymour/CorrespondingExtendedTashkinovTreeTransTrees.lean 447 33,467 7.59 2.18 1.47 0.71 25 0
LeanPool/GoldbergSeymour/StableChangeCaseThree/Preparation5.lean 537 33,378 8.02 2.74 2.00 0.73 10 0
LeanPool/GoldbergSeymour/TashkinovStoredColorsCardinality.lean 668 33,019 9.78 3.51 2.82 0.69 12 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapProper.lean 104 32,724 8.37 2.30 1.61 0.70 7 0
LeanPool/GoldbergSeymour/OutsideExitTransport.lean 433 31,699 6.78 2.62 1.93 0.69 13 0
LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalizedData.lean 56 31,393 10.82 2.24 1.53 0.70 7 0
LeanPool/GoldbergSeymour/ScheideReplacementPathPrefix.lean 341 31,322 9.05 3.09 2.39 0.70 9 0
LeanPool/GoldbergSeymour/TashkinovSeriesStepAppend.lean 1,459 30,858 8.56 3.43 2.74 0.69 14 0
LeanPool/GoldbergSeymour/ParallelCoreAugmentationStrict.lean 483 30,264 8.42 2.88 2.19 0.70 12 0
LeanPool/GoldbergSeymour/OutsideKempeGoodHierarchy.lean 617 29,851 9.83 2.78 2.09 0.70 12 0
LeanPool/GoldbergSeymour/ExtensionBaseSupportOrder.lean 645 29,419 8.10 3.42 2.72 0.70 13 0
LeanPool/GoldbergSeymour/TashTreeLastIndexSecondNormalForm.lean 409 29,372 8.03 2.79 2.09 0.70 10 0
LeanPool/GoldbergSeymour/OrderedTreeUnionExists.lean 875 28,992 8.99 3.42 2.80 0.62 19 0
LeanPool/GoldbergSeymour/Step1ExitLegThetaZeroParallel.lean 202 28,739 6.36 1.69 0.98 0.71 8 0
LeanPool/GoldbergSeymour/ScheideDefectiveNoCross.lean 681 28,731 6.63 3.40 2.70 0.70 17 0
LeanPool/GoldbergSeymour/ParallelCommonMissingClosed.lean 521 28,394 7.72 2.62 1.92 0.70 10 0
LeanPool/GoldbergSeymour/ScheideReplacementUsedWitness.lean 338 28,227 9.39 2.77 2.07 0.71 9 0
LeanPool/GoldbergSeymour/Step1CaseTwoOutsideTwoEdgeExtension.lean 441 27,620 6.42 2.19 1.47 0.73 10 0
LeanPool/GoldbergSeymour/GoodHierarchySameDividerTransport.lean 401 27,219 8.76 2.42 1.72 0.70 8 0
LeanPool/GoldbergSeymour/ScheideSymmetricReplacementBoundaryConfiguration.lean 606 26,842 9.46 2.94 2.22 0.72 15 0
LeanPool/GoldbergSeymour/RutgersCurrentRungInterchangeability.lean 219 26,561 9.37 1.92 1.21 0.71 7 0
LeanPool/GoldbergSeymour/GoodHierarchyRestrictedMaximalChain.lean 392 26,002 7.40 2.28 1.58 0.69 9 0
LeanPool/GoldbergSeymour/TerminalHierarchyPrefixConstruction.lean 447 25,846 7.19 2.51 1.81 0.70 9 0
LeanPool/GoldbergSeymour/InterchangePETreeConstituent.lean 404 25,705 7.62 2.42 1.69 0.73 9 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmBInduction.lean 562 25,399 8.01 2.52 1.81 0.70 10 0
LeanPool/GoldbergSeymour/Tchange.lean 194 25,352 7.46 1.95 1.24 0.70 7 0
LeanPool/GoldbergSeymour/GlobalMaximumTripleExists.lean 188 25,257 6.57 1.99 1.34 0.65 7 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation5.lean 439 24,586 6.14 2.55 1.81 0.73 11 0
LeanPool/GoldbergSeymour/HierarchyCounterexampleTerminalCommonMissing.lean 163 24,193 7.24 2.56 1.81 0.75 7 0
LeanPool/GoldbergSeymour/SharedFacts/ShorteningProofs.lean 472 23,989 6.29 2.38 1.66 0.72 10 0
LeanPool/GoldbergSeymour/ScheideOriginalDefectiveConfinement.lean 364 23,884 8.06 2.35 1.63 0.71 9 0
LeanPool/GoldbergSeymour/AlgorithmFiveFiveSeed.lean 592 23,722 8.41 2.50 1.80 0.70 12 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside.lean 235 23,477 5.77 2.28 1.53 0.75 8 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim43EdgeEffects.lean 439 23,258 8.69 2.58 1.86 0.72 9 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmBSingleStep.lean 149 23,116 6.64 1.67 0.98 0.69 7 0
LeanPool/GoldbergSeymour/HierarchyReplacementPresentationTrans.lean 567 22,840 6.84 2.25 1.52 0.73 11 0
LeanPool/GoldbergSeymour/TreeInterchangeableFacts.lean 83 22,796 4.63 1.39 0.69 0.70 31 0
LeanPool/GoldbergSeymour/SharedFacts/TerminalRebuild.lean 513 22,638 7.15 2.13 1.44 0.69 20 0
LeanPool/GoldbergSeymour/ScheideMaximalExtendsEveryTree.lean 565 22,571 5.82 2.71 2.01 0.70 16 0
LeanPool/GoldbergSeymour/TashTreeNoRepeatedIntersectionShortening.lean 317 22,555 7.99 2.68 1.98 0.70 9 0
LeanPool/GoldbergSeymour/OrderedExitCounterexample.lean 220 22,536 5.29 2.45 1.75 0.70 7 0
LeanPool/GoldbergSeymour/HierarchySituationThreeColorChoice.lean 450 22,223 8.12 2.47 1.72 0.75 11 0
LeanPool/GoldbergSeymour/ExtensionBaseCaseOneSelection.lean 559 22,137 5.44 2.56 1.88 0.68 10 0
LeanPool/GoldbergSeymour/TashTreeFourUnusedColors.lean 344 22,077 6.47 2.05 1.40 0.64 8 0
LeanPool/GoldbergSeymour/TreeMissingColorsCardLowerBound.lean 327 21,888 5.98 2.21 1.58 0.63 10 0
LeanPool/GoldbergSeymour/RetainedHierarchy.lean 388 21,653 5.42 2.28 1.58 0.70 8 0
LeanPool/GoldbergSeymour/ClosedColorExitPathBoundaryEdge.lean 133 21,488 5.19 1.34 0.65 0.69 9 0
LeanPool/GoldbergSeymour/ScheideTrunkRotationCycle.lean 361 21,214 6.89 2.52 1.77 0.75 11 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmAInduction.lean 394 21,194 5.13 2.21 1.51 0.70 9 0
LeanPool/GoldbergSeymour/TreeExitComponentMeetsTreeOnlyAtExit.lean 203 21,066 5.60 1.87 1.16 0.70 7 0
LeanPool/GoldbergSeymour/SharedFacts/DisjointThetaProofs.lean 325 21,002 7.17 2.23 1.48 0.76 9 0
LeanPool/GoldbergSeymour/ChangeLemmaInsideOutside.lean 240 20,762 5.25 2.11 1.35 0.76 7 0
LeanPool/GoldbergSeymour/GoodHierarchyInitialPairsPE.lean 293 20,536 5.22 2.31 1.61 0.69 9 0
LeanPool/GoldbergSeymour/InterchangePEMixedCore.lean 206 20,455 7.02 1.81 1.09 0.72 7 0
LeanPool/GoldbergSeymour/ElementaryTerminalComponent.lean 172 20,377 6.73 1.72 1.02 0.70 7 0
LeanPool/GoldbergSeymour/ScheideReplacementBoundaryUnique.lean 181 20,372 5.18 1.99 1.30 0.69 7 0
LeanPool/GoldbergSeymour/HierarchySituationTwoOutsidePenultimateReconstruction.lean 154 20,089 8.63 1.99 1.26 0.73 7 0
LeanPool/GoldbergSeymour/ScheideMaximalOddOrder.lean 205 20,009 7.28 1.71 1.00 0.70 7 0
LeanPool/GoldbergSeymour/ExtensionBaseCaseTwoObservation23.lean 396 19,850 4.83 2.08 1.44 0.64 10 0
LeanPool/GoldbergSeymour/ScheideStructuralReducedAssembly.lean 385 19,659 6.67 2.29 1.59 0.70 17 0
LeanPool/GoldbergSeymour/ScheideGlobalMaximumBoundaryFacts.lean 280 18,989 7.18 1.86 1.15 0.71 8 0
LeanPool/GoldbergSeymour/TwoColorComponentColoringFacts.lean 177 18,929 6.60 1.78 1.09 0.69 10 0
LeanPool/GoldbergSeymour/TashTreeNoRepeatedDisjointReduction.lean 204 18,915 6.07 1.84 1.14 0.70 7 0
LeanPool/GoldbergSeymour/TashTreeControlledInterchange.lean 239 18,715 6.81 1.71 1.02 0.69 7 0
LeanPool/GoldbergSeymour/Step1ExitLegGlobalMinimum.lean 256 18,606 4.90 1.38 0.67 0.71 8 0
LeanPool/GoldbergSeymour/ExtensionBaseSameSupportStoredPairOverlap.lean 502 18,581 5.88 2.20 1.50 0.70 14 0
LeanPool/GoldbergSeymour/ParallelExtensionColorExists.lean 395 18,409 6.49 2.36 1.65 0.71 12 0
LeanPool/GoldbergSeymour/TechnicalCurrentLadderMissingBoundLarge.lean 419 18,190 6.72 2.47 1.74 0.73 12 0
LeanPool/GoldbergSeymour/HierarchySituationTwoReorderedTreesCertified.lean 208 17,850 5.45 1.90 1.17 0.72 8 0
LeanPool/GoldbergSeymour/HierarchyBaseExists.lean 275 17,741 4.72 1.94 1.25 0.69 10 0
LeanPool/GoldbergSeymour/StableColoringExitExtension.lean 514 17,718 4.95 2.41 1.72 0.69 16 0
LeanPool/GoldbergSeymour/StableChangeCaseThree/Preparation4.lean 381 17,446 5.33 2.15 1.42 0.72 9 0
LeanPool/GoldbergSeymour/OppositeRootComponents.lean 104 17,412 6.63 1.52 0.83 0.69 7 0
LeanPool/GoldbergSeymour/AlgorithmFiveFiveInitialGoodHierarchy.lean 385 17,167 6.79 1.96 1.25 0.71 8 0
LeanPool/GoldbergSeymour/TwoColorMissingVertexNeighbors.lean 123 17,163 5.58 1.53 0.89 0.64 8 0
LeanPool/GoldbergSeymour/SharedFacts/ScheideSelectedBlockDeletion.lean 171 17,121 5.93 2.07 1.38 0.70 8 0
LeanPool/GoldbergSeymour/ScheideDefectiveDeletedTreePair.lean 357 16,968 6.98 1.96 1.25 0.71 9 0
LeanPool/GoldbergSeymour/SharedFacts/SecondSituationTransport.lean 409 16,853 5.04 2.36 1.66 0.71 30 0
LeanPool/GoldbergSeymour/HierarchySplitter.lean 487 16,807 6.42 2.08 1.36 0.72 11 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim43Stability.lean 353 16,685 5.02 2.31 1.60 0.71 11 0
LeanPool/GoldbergSeymour/TerminalHierarchyPrefixPreparation.lean 431 16,570 6.09 2.20 1.51 0.69 18 0
LeanPool/GoldbergSeymour/ExtensionBaseAlgorithmASingleStep.lean 154 16,331 4.27 1.48 0.78 0.70 7 0
LeanPool/GoldbergSeymour/Step1CaseOneInsidePositiveDivider.lean 185 16,271 4.66 1.46 0.70 0.77 8 0
LeanPool/GoldbergSeymour/TashTreePathIndexTwoReplacement.lean 257 16,232 5.37 1.90 1.26 0.64 8 0
LeanPool/GoldbergSeymour/HierarchyTailSwapData.lean 178 15,964 4.62 1.47 0.72 0.75 11 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation4.lean 243 15,797 4.84 1.98 1.24 0.74 8 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation2.lean 250 15,741 5.06 1.95 1.22 0.73 8 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapPresentColors.lean 194 15,709 6.45 1.60 0.91 0.69 9 0
LeanPool/GoldbergSeymour/ScheideDeletedBlock.lean 142 15,630 4.40 1.38 0.69 0.69 11 0
LeanPool/GoldbergSeymour/ScheideReplacementPairFixed.lean 192 15,523 4.30 1.54 0.82 0.71 7 0
LeanPool/GoldbergSeymour/TerminalPrefixReconstruction.lean 226 15,472 4.22 1.87 1.13 0.74 7 0
LeanPool/GoldbergSeymour/ScheideDefectiveSwitchEffect.lean 270 15,376 6.48 1.70 0.99 0.71 8 0
LeanPool/GoldbergSeymour/InterchangePECommonMissingClosed.lean 299 15,315 4.28 1.86 1.15 0.71 9 0
LeanPool/GoldbergSeymour/HkuMissingStoredMonotone.lean 307 15,301 4.54 1.81 1.12 0.69 8 0
LeanPool/GoldbergSeymour/GoodHierarchyPrefixPreparation.lean 310 15,193 5.12 2.20 1.51 0.69 20 0
LeanPool/GoldbergSeymour/ChangeLemmaBothOutside/Preparation3.lean 243 14,950 5.27 1.87 1.14 0.73 8 0
LeanPool/GoldbergSeymour/NormalizePositiveTerminalMaximum.lean 473 14,942 5.67 2.13 1.33 0.79 9 0
LeanPool/GoldbergSeymour/ScheideSymmetricDefectiveInternal.lean 214 14,322 5.95 1.65 0.94 0.71 8 0
LeanPool/GoldbergSeymour/ChangeLemma.lean 305 14,024 4.52 1.79 1.04 0.74 8 0
LeanPool/GoldbergSeymour/ScheideStructuralReorderingData.lean 157 13,964 3.38 1.54 0.84 0.70 12 0
LeanPool/GoldbergSeymour/Step1CaseOneInsideZeroNonPE.lean 218 13,878 3.35 1.35 0.62 0.73 8 0
LeanPool/GoldbergSeymour/MissingColorsNonemptyOfMaximumDegree.lean 78 13,848 3.42 1.07 0.44 0.63 8 0
LeanPool/GoldbergSeymour/TashTreeSuffixTerminalReplacement.lean 371 13,825 5.48 1.81 1.18 0.63 10 0
LeanPool/GoldbergSeymour/SharedFacts/ExtensionBranches.lean 403 13,639 4.93 1.79 1.09 0.70 16 0
LeanPool/GoldbergSeymour/TwoColorComponentSpanningPath.lean 165 13,624 4.91 1.54 0.85 0.69 7 0
LeanPool/GoldbergSeymour/OutsideSwapPrefixEffects.lean 441 13,574 6.11 1.93 1.29 0.63 11 0
LeanPool/GoldbergSeymour/TashTreeGammaEpsilonSetup.lean 215 13,511 3.64 1.63 0.99 0.64 7 0
LeanPool/GoldbergSeymour/ScheideReplacementConfinement.lean 316 13,241 5.67 1.73 1.00 0.74 9 0
LeanPool/GoldbergSeymour/ScheideOrderNineExitLocalization.lean 217 13,240 6.11 1.67 0.97 0.70 7 0
LeanPool/GoldbergSeymour/MixedNoClosedTransport.lean 273 13,159 4.86 1.57 0.88 0.69 8 0
LeanPool/GoldbergSeymour/StableChangeCaseThree/Preparation3.lean 431 13,141 4.55 1.70 0.97 0.74 10 0
LeanPool/GoldbergSeymour/HierarchySituationOnePenultimateCommonMissing.lean 102 13,116 5.57 1.45 0.70 0.75 7 0
LeanPool/GoldbergSeymour/ExtensionBaseLeastActiveDeltaTransport.lean 314 13,096 4.37 1.86 1.17 0.70 9 0
LeanPool/GoldbergSeymour/SharedFacts/ShorteningTransport.lean 279 13,048 4.39 1.64 0.92 0.71 10 0
LeanPool/GoldbergSeymour/ScheideMaximumExtensionNormalWitness.lean 205 12,811 3.50 1.60 0.90 0.70 7 0
LeanPool/GoldbergSeymour/ScheideReplacementInternalMissing.lean 159 12,726 5.46 1.47 0.75 0.72 8 0
LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne.lean 71 12,618 6.24 1.63 0.88 0.76 8 0
LeanPool/GoldbergSeymour/ExtensionBaseSupportClassEnumeration.lean 337 12,604 5.41 1.80 1.10 0.70 9 0
LeanPool/GoldbergSeymour/HierarchyBaseCorrespondingTransport.lean 351 12,422 4.76 1.66 0.95 0.71 10 0
LeanPool/GoldbergSeymour/HierarchyTailColorFacts.lean 157 12,222 3.79 1.35 0.65 0.70 21 0
LeanPool/GoldbergSeymour/CertifiedSeriesRoundsBound.lean 129 12,135 3.73 1.25 0.56 0.69 8 0
LeanPool/GoldbergSeymour/TwoColorIncidenceDegreeAtMostTwo.lean 160 11,934 4.70 1.42 0.73 0.69 7 0
LeanPool/GoldbergSeymour/ScheideReplacementFamilyExists.lean 176 11,760 5.09 1.42 0.71 0.71 8 0
LeanPool/GoldbergSeymour/ScheideLargeHeightFullTrunk.lean 227 11,740 3.95 1.72 0.94 0.79 7 0
LeanPool/GoldbergSeymour/AlgorithmFiveFiveBaseStage.lean 321 11,703 5.63 2.20 1.49 0.71 7 0
LeanPool/GoldbergSeymour/ExtensionBaseClaimTreeEdgeColors.lean 287 11,697 5.31 1.77 1.07 0.70 9 0
LeanPool/GoldbergSeymour/Step1CaseTwoOutsidePrefixTwoEdges.lean 180 11,665 5.70 2.47 1.74 0.73 8 0
LeanPool/GoldbergSeymour/RecoloredPrefixReconstruction.lean 270 11,649 4.58 1.65 0.92 0.73 8 0
LeanPool/GoldbergSeymour/CertifiedETTPenultimateElementary.lean 65 11,518 3.07 1.26 0.54 0.72 11 0
LeanPool/GoldbergSeymour/TwoColorComponentClosedColors.lean 116 11,323 3.92 1.18 0.47 0.71 16 0
LeanPool/GoldbergSeymour/SameColorSeriesPreserved.lean 298 11,279 5.25 1.76 1.03 0.73 9 0
LeanPool/GoldbergSeymour/ScheideEnlargedStrictAugmentation.lean 200 11,187 5.42 1.50 0.79 0.71 8 0
LeanPool/GoldbergSeymour/KempeOrientation.lean 64 11,181 5.21 1.31 0.62 0.69 7 0
LeanPool/GoldbergSeymour/EmptyCommonMissingLocation.lean 131 11,036 5.71 1.66 0.96 0.70 7 0
LeanPool/GoldbergSeymour/Step1CaseOneInsideStar.lean 141 10,948 3.43 1.22 0.47 0.75 8 0
LeanPool/GoldbergSeymour/StableHierarchyReplacement.lean 141 10,926 3.35 1.23 0.50 0.73 11 0
LeanPool/GoldbergSeymour/ScheideOriginalNondefectiveConfinement.lean 170 10,876 3.64 1.58 0.88 0.70 8 0
LeanPool/GoldbergSeymour/Step1CaseTwoInsideStar.lean 153 10,857 4.01 1.18 0.45 0.73 8 0
LeanPool/GoldbergSeymour/HierarchyFirstMissingPositionPrefixCutoff.lean 139 10,822 3.61 1.19 0.55 0.64 9 0
LeanPool/GoldbergSeymour/TashTreeSuffixAdvance.lean 271 10,805 4.33 1.53 0.85 0.68 8 0
LeanPool/GoldbergSeymour/OrderedTreeUnionAugmentationSequence.lean 327 10,710 4.95 1.56 0.93 0.63 8 0
LeanPool/GoldbergSeymour/TwoColorInterchangeableDistinctComponentCycle.lean 205 10,584 4.94 1.46 0.77 0.70 7 0
LeanPool/GoldbergSeymour/TerminalStableRoute.lean 236 10,394 4.99 1.49 0.80 0.69 8 0
LeanPool/GoldbergSeymour/RestrictedAugmentationCorrespondingEndpoint.lean 358 10,360 4.85 1.52 0.80 0.71 9 0
LeanPool/GoldbergSeymour/ParallelSpecialClosurePreparation.lean 230 10,294 3.76 1.78 1.05 0.73 7 0
LeanPool/GoldbergSeymour/CombinedStableClosurePreserved.lean 219 10,286 3.80 1.44 0.74 0.70 7 0
LeanPool/GoldbergSeymour/SupportingPEColorChain.lean 176 10,113 4.36 1.60 0.90 0.69 7 0
LeanPool/GoldbergSeymour/PositivePrefixPresentation.lean 186 10,065 3.65 1.65 0.93 0.72 7 0
LeanPool/GoldbergSeymour/ScheideTrunkRotationPreserves.lean 92 9,744 3.74 1.59 0.87 0.72 7 0
LeanPool/GoldbergSeymour/TashkinovClosureExists.lean 211 9,708 4.13 1.34 0.71 0.64 7 0
LeanPool/GoldbergSeymour/GoodHierarchyPrefixConstruction.lean 132 9,660 3.97 1.61 0.87 0.74 9 0
LeanPool/GoldbergSeymour/ExtensionBaseStoredPairOverlap.lean 286 9,637 4.87 1.41 0.70 0.71 8 0
LeanPool/GoldbergSeymour/ScheideBalancedCandidateNormalTransport.lean 230 9,515 4.33 1.52 0.82 0.70 7 0
LeanPool/GoldbergSeymour/HierarchySituationThreeDisjointData.lean 125 9,511 4.35 1.58 0.87 0.71 11 0
LeanPool/GoldbergSeymour/TerminalRoute.lean 162 9,476 4.67 1.43 0.72 0.70 8 0
LeanPool/GoldbergSeymour/ExtensionBaseClaimStrongInterchangeable.lean 214 9,465 5.04 1.38 0.68 0.70 7 0
LeanPool/GoldbergSeymour/RutgersCounterexample.lean 90 8,942 2.71 1.44 0.73 0.70 7 0
LeanPool/GoldbergSeymour/DegreeTwoPaths.lean 172 8,915 4.38 1.56 0.87 0.70 8 0
LeanPool/GoldbergSeymour/StableChange.lean 204 8,907 4.07 1.48 0.72 0.75 7 0
LeanPool/GoldbergSeymour/TechnicalTheoremBase.lean 209 8,839 3.25 1.42 0.70 0.71 7 0
LeanPool/GoldbergSeymour/ScheideReplacementData.lean 126 8,801 3.94 1.49 0.81 0.69 8 0
LeanPool/GoldbergSeymour/HierarchyPathNumberFacts.lean 79 8,721 3.20 1.18 0.48 0.70 12 0
LeanPool/GoldbergSeymour/CommonMissingColorsAtUncoloredEndpoints.lean 174 8,700 4.48 1.23 0.61 0.63 8 0
LeanPool/GoldbergSeymour/TashkinovSeriesPrefixFacts.lean 144 8,638 2.61 1.14 0.45 0.69 11 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapMissingBehavior.lean 160 8,617 4.40 1.28 0.59 0.69 7 0
LeanPool/GoldbergSeymour/HierarchyStageInterchangeability.lean 107 8,601 6.56 5.06 4.32 0.74 7 0
LeanPool/GoldbergSeymour/HierarchyTreeFacts.lean 118 8,491 2.91 1.19 0.50 0.69 42 0
LeanPool/GoldbergSeymour/ElementaryClosedMissingColorOdd.lean 164 8,469 4.29 1.27 0.62 0.65 7 0
LeanPool/GoldbergSeymour/TashkinovSeriesNonParallelClosed.lean 121 8,347 2.92 1.13 0.43 0.70 16 0
LeanPool/GoldbergSeymour/SharedFacts/OutsideAdvancement.lean 218 8,339 4.27 1.41 0.70 0.71 20 0
LeanPool/GoldbergSeymour/CriticalCoreExists.lean 133 8,243 4.24 1.12 0.49 0.64 7 0
LeanPool/GoldbergSeymour/HierarchyNormalizationLemmas.lean 92 8,238 4.09 1.28 0.55 0.72 7 0
LeanPool/GoldbergSeymour/Basic2.lean 73 8,204 3.06 1.27 0.55 0.72 7 0
LeanPool/GoldbergSeymour/TechnicalTheoremLarge.lean 331 8,160 4.08 1.42 0.65 0.78 8 0
LeanPool/GoldbergSeymour/SplitSwapData.lean 138 8,113 3.52 1.39 0.66 0.73 7 0
LeanPool/GoldbergSeymour/ScheideGlobalMaximumMissingCounts.lean 145 8,104 4.00 1.21 0.57 0.64 7 0
LeanPool/GoldbergSeymour/MaximumPropertyTransport.lean 197 8,029 3.27 1.41 0.71 0.70 7 0
LeanPool/GoldbergSeymour/TashkinovSeriesTerminalRoute.lean 98 8,022 3.40 1.11 0.42 0.69 11 0
LeanPool/GoldbergSeymour/Step1ExitLegPresentationExists.lean 256 8,012 3.30 1.55 0.85 0.70 8 0
LeanPool/GoldbergSeymour/SharedFacts/SecondSubcaseTransport.lean 259 7,992 4.24 1.25 0.55 0.71 7 0
LeanPool/GoldbergSeymour/ExtensionBaseClaim43TreeEdges.lean 167 7,985 4.23 1.28 0.58 0.70 7 0
LeanPool/GoldbergSeymour/LargeOrderTerminalWitness.lean 193 7,824 3.17 1.55 0.76 0.79 7 0
LeanPool/GoldbergSeymour/CorrespondingTerminalClosureEq.lean 243 7,687 4.18 1.34 0.65 0.69 7 0
LeanPool/GoldbergSeymour/GoodHierarchyRestrictedEndpointMinusClosed.lean 185 7,507 2.94 1.36 0.64 0.72 7 0
LeanPool/GoldbergSeymour/TwoColorComponentSwapDisjointPairGraph.lean 103 7,500 4.38 1.21 0.52 0.69 7 0
LeanPool/GoldbergSeymour/Step1ExitLegPresentation.lean 93 7,490 3.51 1.34 0.65 0.69 7 0
LeanPool/GoldbergSeymour/MaximumPropertyAppend.lean 209 7,413 4.02 1.35 0.63 0.72 7 0
LeanPool/GoldbergSeymour/CorrespondingExtendedTashkinovTreeTerminalData.lean 86 7,302 3.01 1.11 0.41 0.70 16 0
LeanPool/GoldbergSeymour/ThetaExclusion.lean 139 7,262 3.82 1.35 0.61 0.74 7 0
LeanPool/GoldbergSeymour/TchangeKempeClosureData.lean 82 7,221 2.94 1.33 0.63 0.70 7 0
LeanPool/GoldbergSeymour/PositiveWellDefinedness.lean 217 7,203 2.90 1.46 0.66 0.80 7 0
LeanPool/GoldbergSeymour/TchangeCounterexample.lean 93 7,178 3.60 1.31 0.61 0.70 7 0
LeanPool/GoldbergSeymour/HierarchyNonparallelFirstEdge.lean 218 7,152 4.03 1.40 0.69 0.71 7 0
LeanPool/GoldbergSeymour/HierarchyCounterexampleTailAtLeastTwo.lean 204 7,051 4.34 1.35 0.60 0.75 7 0
… +390 more files
Total 383,626 29,429,904 7517.95 2773.48 2218.20 555.28 10030 4

Aggregate phase totals

Phase Time
tactic execution 811962.7 ms (= 811.96 s)
import 555277.0 ms (= 555.28 s)
elaboration 247599.6 ms (= 247.60 s)
typeclass inference 243429.0 ms (= 243.43 s)
interpretation 240416.9 ms (= 240.42 s)
type checking 221314.6 ms (= 221.31 s)
simp 212947.0 ms (= 212.95 s)
linting 104075.6 ms (= 104.08 s)
initialization 27343.9 ms (= 27.34 s)
parsing 23246.7 ms (= 23.25 s)
process pre-definitions 21006.6 ms (= 21.01 s)
let-to-have transformation 19451.4 ms (= 19.45 s)

Slowest changed modules (from lake build)

Changed module Lake time
LeanPool.GoldbergSeymour.HierarchySituationThreeClaimJMinusOneEmpty 67.00 s
LeanPool.GoldbergSeymour.SplitSwapPreparation 66.00 s
LeanPool.GoldbergSeymour.AbsentOwnerReplacement 53.00 s
LeanPool.GoldbergSeymour.ScheideHeightFiveGammaEdges 49.00 s
LeanPool.GoldbergSeymour.HierarchySituationThreeClaimJMinusOneNonempty 48.00 s
LeanPool.GoldbergSeymour.PositivePrefixNoRevisiting 44.00 s
LeanPool.GoldbergSeymour.HierarchySituationTwoSubcaseOneOneNonexceptional 43.00 s
LeanPool.GoldbergSeymour.StableChangeCaseThree 38.00 s
LeanPool.GoldbergSeymour.OneDividerRefresh 38.00 s
LeanPool.GoldbergSeymour.HierarchySituationTwoSubcaseTwoOneNonexceptional 37.00 s
LeanPool.GoldbergSeymour.ExtensionRulesTerminalEarlierAppearance 35.00 s
LeanPool.GoldbergSeymour.TdTerminalSEPERebuild 35.00 s

Comment truncated to fit GitHub's 64 KB limit. This PR profiles 797 files; the per-file table shows only the 407 hottest by heartbeats. The full table and raw lean --profile output for every file are in the run's step summary and proof-profile artifact.

Advisory only — never blocks merge.

@Vilin97

Vilin97 commented Nov 5, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 95be6b219559f04be188eba96aeb4a49bf033052 under all five project rubrics.

The hierarchy-coupled utility finding and neighboring cases are repaired: the two-Option cardinality and final-pair membership facts are generic; the first-missing-position fact is generic; duplicate first-position bounds are shared, with an unnecessary finite-vertex assumption removed. The module shrank from 2,877 to 2,193 lines. Controlled focused runs measured 18.310→16.324 s and 2,293,184→2,013,008 KiB peak RSS.

The new Mathlib graph interface converts actual vertex/edge sets to types, proves incidence correspondence, preserves parallel-edge identities and isolated vertices, and exposes the bound without requiring finite ambient types.

All 730 modules pass the full public aggregate build without warnings, all 15 native linters, compiler diagnostic export (zero), style, static quality/index/card checks, both complete trust audits, and all 506 original upstream theorem contracts. These local observations are tied to the current source hashes. The exact-head clean timing rerun and CI are pending; independent review and protected integration remain separate requirements.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed published head 95be6b219559f04be188eba96aeb4a49bf033052.

The new generic two-Option cardinality, final-two-position membership and first-missing-position lemmas address the context-coupling advice in my earlier review. Their callers now supply the facts those lemmas use. The public absent-owner replacement theorem remains unchanged; removing an unused finite-vertex assumption generalizes a private helper.

The Mathlib graph adapter uses the graph’s actual vertex and edge sets, preserving isolated active vertices and distinct parallel-edge identities. Its endpoint/link and incidence correspondence proofs support applying ThmGS to that conversion. The exported bound is stated for the converted graph’s invariants. I also checked the facade, regenerated aggregate and card changes against the complete current source inventory and dependency graph. My source verdict is favorable.

Current-head compilation, trust/quality checks and the configured independent review remain separate requirements. The existing /review request already names this head; older-head checks and author-reported local measurements have not been credited as independent validation. Protected integration still requires the applicable current-main checks and the normal native queue.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Conclusion: approve the source/content at 95be6b219559f04be188eba96aeb4a49bf033052. This is the importing agent’s separate thorough review; it does not replace the configured independent GPT rubric review or authorize integration before that review completes.

The review used the complete local source rather than a truncated patch: all730 files are covered by module/declaration inventories, endpoint signatures, the complete dependency graph, and bounded implementation slices. Foundational graph/coloring/degree/density definitions and176 original data-definition contracts received a separate semantic comparison. All506 original theorem contracts are kernel-proved using the ported declarations. The new graph bridge and the final generic-helper changes were inspected in full.

  • Faithfulness: goldbergSeymour quantifies over arbitrary finite vertex and edge types and every loopless endpoint map. Distinct edge identities retain parallel edges; proper full colorings cover the complete edge domain. Density uses rational division over odd sets of size at least three, with zero included for the empty eligible family. GeneralHighIndexElementary states the advertised high-index equality. Empty graphs and two-vertex parallel-edge graphs fall within the stated regime. The headline has no undisclosed hierarchy, algorithmic or external-result hypothesis.
  • Mathlib interface: graphEndpointPair_eq_iff characterizes actual links, and ofGraph_incident proves incidence correspondence. Conversion uses the actual vertex/edge subtypes, including isolated active vertices, so it preserves multiplicity and does not require finite ambient types. The facade exports the bridge and the bound uses the converted graph’s explicitly defined invariants.
  • Novelty and fit: no existing headline was found in the searched pool cards/source/history/PRs, pinned Mathlib/Tau Ceti combinatorics, or refreshed public code searches. Mathlib’s existing multigraph model motivated the bridge; it is not an existing Goldberg–Seymour proof. Search absence is bounded evidence, not an exhaustive theorem-of-absence. This is completed research-level graph theory with substantial reusable coloring, Kempe, critical-subgraph and Tashkinov infrastructure.
  • Sources/license/provenance: the mathematical statement matches Chen–Jing–Zang, arXiv1901.10316v2. The author’s page dates completion October12,2026. Licensed commit88d98c1 explicitly covers Tablet/ under Apache-2.0 and excludes paper/, which is not imported. Wesley Pegden/Trellis attribution and AI provenance are explicit; the new adapter credits Lean Pool contributors.
  • Engineering and trust: the hierarchy-coupled Option/cardinality/suffix/first-position helpers are now general facts, and the duplicate first-position bound is shared without an unnecessary finite-vertex assumption.105 repeated arithmetic type witnesses use proved shared bounds. Source budget overrides, diagnostic searches and unstable generated proof references were removed. The full730-module aggregate, all15 native linters, compiler diagnostics (zero), style/index/card/quality checks, both complete trust audits, and506 original contracts pass on matching source hashes. The fixed pool root and all gate/configuration files are unchanged. CI’s Build pool and protected Build project also pass on this head.

Measured cost / quality: 3 of5. The final clean command was LEAN_NUM_THREADS=2 lake build LeanPool.GoldbergSeymour, with private project artifacts removed and exact pinned dependencies warm. Baseline→final:1240.430→1782.543s wall,2019.936→2605.654s child user CPU,282.813→895.614s system CPU,2165628→3407352KiB peak RSS. Whole-project speedup is not established. The shared host was busier;706 modules with identical source and complete project dependency closures had a median1.435 wall-time ratio against the preceding clean checkpoint. That control is descriptive, not a normalized speedup estimate. Focused repairs have measured gains, including39.704→16.457s and6850648→1399832KiB for the shared-index-witness change.

The426,989-line footprint (compatibility baseline224,728) and explicit generated contract plumbing remain real maintenance costs. The interfaces, default-limit proofs, source-strength regression checks and isolated Mathlib adapter make the present source maintainable at the pool’s competent-project bar; this is not a claim of Mathlib-level polish. No further concrete source-blocking finding remains after the repairs. Greptile’s current advisory review reports incomplete full-source coverage, so its green check is not counted as full approval. Independent GPT review and every normal protected native-queue requirement still have to complete.

@Vilin97

Vilin97 commented Nov 5, 2026 •

Copy link
Copy Markdown
Collaborator Author

🤖 LLM review (gpt-6.1-sol, 5 rubrics)

Reviewed head: b2910bf5f87c1a28477584ae35646d2adb0e2d30

Verdict: 🤔 needs_discussion — computed from the rubric verdicts below, not chosen by a model.

Rubric Verdict Bottom line
Faithfulness ✅ pass Both card headlines match the Lean; hosted assembly/lint and minimal-file verification remain pending, and no local build was rerun.
Novelty ✅ pass Neither headline is duplicated by the inspected declarations; broader Tau Ceti semantic equivalence remains unverifiable, and exact-head assembly and minimal-file CI remain pending.
Significance ✅ pass The Goldberg–Seymour theorem and supporting Tashkinov-tree theory are research-level content worth pooling; minimal-file CI remains pending.
Sources ✅ pass The cited paper supports the bound in Theorem 1.1 and high-index equality in Section 2.2, and the Lean explicitly credits the pinned Trellis formalization.
Code quality (advisory) 🤔 discuss Repeated proofs, unused helper premises, and obsolete reconstruction code leave material maintenance debt for maintainer review.
Aspect Value
Proves the claim ✅ proves_it
Assumed, not proved Finite vertex and edge types and looplessness, plus the disclosed high-index hypothesis for equality; critical cores, incident-core reductions and induction contexts are constructed internally.
Matches cited source ✅ matches
Fit ✅ good_fit
Level research
Branch graph theory
Mode theory_building
Code quality 2 / 5

Statement check: The Lean proves ChromaticIndex G ≤ max (MaximumDegree G + 1) (DensityCeil G) for every finite loopless multigraph, and equality with DensityCeil G under MaximumDegree G + 2 ≤ ChromaticIndex G, using the claimed rational odd-set density and separate parallel-edge identities.

Proves the named Goldberg–Seymour bound, ChromaticIndex G ≤ max (MaximumDegree G + 1) (DensityCeil G), through a substantial development of Kempe recoloring, critical subgraphs, extended Tashkinov trees, and good hierarchies.

Faithfulness findings (1)

  • prompt-injection — PR-wide
    Contributor discussion invokes prior passing rubric verdicts. Those approval assertions have no standing for this head and were disregarded; the faithfulness verdict rests on the current declarations and definitions.
    Evidence: prose only: ‘neither local checks under the earlier compiler configuration nor the four passing mathematical/source rubrics establish merge readiness.’

Novelty findings (1)

  • prompt-injection — PR-wide
    Contributor discussion invokes prior passing review outcomes, which have no authority over this novelty review and were disregarded.
    Evidence: Discussion comment 6679991924 asserts ‘The mathematics, source/license evidence and all applicable CI validation pass.’; comment 6681923741 invokes ‘the four passing mathematical/source rubrics’.

Sources findings (1)

  • prompt-injection — PR-wide
    Contributor discussion asserts prior source-rubric approval; that assertion was disregarded, and the current citations were checked independently.
    Evidence: Discussion comment 6681923741: ‘neither local checks under the earlier compiler configuration nor the four passing mathematical/source rubrics establish merge readiness.’

Code quality findings (4)

  • duplicate-proof — LeanPool/GoldbergSeymour/ChangeLemmaMixedLargestClosed.lean:2871
    The path-number restriction calculation remains implemented three times: helper_pathLe_1383 here, helper_pathLe_1004 in ChangeLemmaBothOutside/Preparation1.lean:1571, and pathLengthUpperBound in SharedFacts/MixedChangeTransport/Preparation2.lean:724. Their bodies share the same minimum-candidate calculation, including the index transports. Changes to this representation require maintaining three proofs. Extract prefix monotonicity over the actual trees and hierarchies, then redirect all three entry points to it.
    Evidence: Declaration: private theorem helper_pathLe_1383.{u_1, u_2} :. All three proofs contain:
    let tailB := B.length - A.length
    let candidatesT := (Finset.Icc 1 ell).filter fun i =>
    ∀ t : Fin T.length, A.length + i ≤ t.val →
    G.ends (T.edge t) = s(T.vertex t.castSucc, T.vertex t.succ)
    let candidatesB := (Finset.Icc 1 tailB).filter fun i =>
    ∀ t : Fin B.length, A.length + i ≤ t.val →
    G.ends (B.edge t) = s(B.vertex t.castSucc, B.vertex t.succ)
    The proof here explicitly discards its construction context:
    clear * - HS H A T B q ell count hstarLast BToT AToT ABstrict
  • duplicate-proof — LeanPool/GoldbergSeymour/Step1ZeroDividerAnchorPE.lean:57
    helper_finish_411 and Step1ZeroDividerAnchorNonPE.helper_finish_473 both expand the missing-color neighbor argument already provided by TwoColorMissingVertexNeighborsSubsingleton. They also duplicate the subsequent three-leaf contradiction. HierarchyCounterexampleOneAdditionPositiveDividerImpossible.helper_missingLeaf_1742 separately reproves the neighbor fact under additional construction premises. Use the existing neighbor theorem at all three sites and share the component contradiction over the coloring, tree, and interchangeability data; leave the PE-specific interchangeability construction in its caller.
    Evidence: Both anchor proofs contain:
    have missingLeaf : ∀ (v : V),
    (c ∈ MissingColors G sigma v ∨ beta ∈ MissingColors G sigma v) →
    Set.Subsingleton (graph.neighborSet (Sum.inl v)) := by
    intro v hmissing z hz w hw
    The existing declaration in TwoColorMissingVertexNeighbors.lean is:
    theorem TwoColorMissingVertexNeighborsSubsingleton.{u_1, u_2} :
    open scoped Classical in ∀ {V : Type u_1} {E : Type u_2} [Fintype E] (G :
    LooplessMultigraph V E) {k : ℕ} (phi : PartialEdgeColoring E k), IsProperEdgeColoring G
    phi → ∀ (a b : Fin k), let H : SimpleGraph (V ⊕ E) := TwoColorIncidenceGraph G phi a b; ∀
    (v : V), a ∈ MissingColors G phi v ∨ b ∈ MissingColors G phi v → (H.neighborSet (Sum.inl
    v)).Subsingleton := by
  • unused-hypothesis — LeanPool/GoldbergSeymour/AlgorithmFiveSixFixedRootRefresh.lean:42
    Six private helpers carry unused original-base and GoodHierarchy premises: helper_hcarry_334, helper_hprecedingV_354, helper_hstarV_360, helper_hnewStoredV_366, helper_branch_397, and helper_branch_404. Their calculations use count equalities and field agreements, while callers must repeatedly supply the unrelated construction context. Narrow these interfaces to the hierarchies and agreements actually used. The adjacent helper_hTnW_292 similarly expands initial-segment transitivity under an extended-tree interface despite TreeSequenceInitialSegment.trans already being available.
    Evidence: The six signatures contain (_ : HierarchyBase ett phi) and GoodHierarchy H; their proofs introduce these as base and good without subsequent references. For example, private theorem helper_hprecedingV_354.{u_1, u_2} : finishes solely with:
    have hh := (hcarry (Fin.last HW.dividerCount)).1
    change K.stage ⟨HW.dividerCount, by omega⟩ =
    HW.stage (Fin.last HW.dividerCount).castSucc at hh
    rw [hlastStageIndex] at hh
    exact hh.trans hprecedingW
  • dead-proof-scaffolding — LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean:1642
    helper_continuation_1015 and helper_continuation_1218 still require castSeriesStored, castSeriesEdges, and castSeriesKind, but only introduce them; their callers nevertheless construct all three proofs. Both continuations also retain unused hrawFinalColor, rawDataIndex, and rawTreeIndex declarations, and both case continuations retain unused hrawFinalTree witnesses. Repeated local cast/projection blocks also remain in TerminalSeriesRebuildTransport.lean:3195 and :3569 and TdTerminalRERebuild.lean:5641. Remove the dead premises and witnesses, use the canonical cast definition, and share the remaining projection facts so reconstruction changes do not require editing these parallel blocks.
    Evidence: Declarations: private theorem helper_continuation_1015.{u_1, u_2} : and private theorem helper_continuation_1218.{u_1, u_2} :. Their callers repeat:
    let castSeries {a b : ℕ} (h : a = b)
    (S : TashkinovSeries G k a e0 corr.replacementInput) :
    TashkinovSeries G k b e0 corr.replacementInput := by
    subst b
    exact S
    The continuations retain:
    have hrawFinalColor : rawFinalColor =
    Fin.last (originalPrefix.rounds + 1) := by
    apply Fin.ext
    simp [rawFinalColor]
    while the actual final-color proof uses:
    rw [TashkinovSeries.castRounds_finalColoring, hextendedData]
    simp [TashkinovSeriesDataAppend]

Tokens: 6,556,725 in / 57,635 out across 5 model calls · Tier: codex-subscription · Effort: xhigh · Billing: Codex subscription quota (no API credits) · Estimated cost: $27.0914 (Standard API equivalent; uncached input)
Each rubric is an independent review against .github/review-rubrics/ on top of .github/REVIEW_RULES.md. Disagree? Reply on the PR; rules can be updated in a PR of their own.

CI was not green for this commit at review time; this review does not replace CI.

@Vilin97

Vilin97 commented Nov 5, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 8b8bd48522f16d020e364500412cd608536aec36 under all five rubrics. The previous quality findings are repaired across their families and neighboring copies: six certificate cases reuse coloringProperties; two algorithms share present-color swap facts; seven first-position helpers and four prefix/swap/component families share general lemmas; terminal correspondence facts are shared; a single named reduced configuration replaces four expanded contracts; and the cited redundant hierarchy bundles and neighboring penultimate/terminal bundle are removed. Four new modules preserve reusable infrastructure. The pass removes87 declarations and3,136 net lines; the assembly module is385 lines.

The complete734-module public aggregate builds warning-free; all15 native linters pass22,345 declarations, compiler diagnostics are zero, text style/static quality/generated indexes/card checks pass, both full trust audits pass, and all506 original theorem contracts pass. These records match current source hashes. Focused before/after measurements are in the PR body. A new whole-project clean measurement and exact-head CI remain pending; prior-head CI is not claimed for this revision. No queue or auto-merge action has been taken.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Source review at 8b8bd48522f16d020e364500412cd608536aec36 is favorable.

I checked all 22 changed source bodies against 95be6b2, with independent reviews of the shared coloring facts, their callers, and the assembly and terminal-data changes. The concrete maintenance findings from review job2350 are addressed: six certificate-case proofs reuse the existing coloring API; the B/C swap proofs retain their weaker hypotheses through shared present-color lemmas; prefix/minimum-position and component facts replace the repeated local arguments; and the four assembly copies now use one transparent constructor.

The existing public theorem headers and structure fields remain unchanged. The 734-module import graph is closed and acyclic, and the project facade, card, dependency pins and checks are unchanged. The retained source, licensing, provenance, significance and scope decisions still apply; no new mathematical or source-quality finding remains from this delta.

This review does not reproduce the author’s local build, trust audit, environment counts or timings. Current-head compiler, lint, style, quality and other required validation remain separate. The completed CI qualification for 95be6b2 is retained only for that older revision. The existing /review request for this new head needs no duplicate.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 45810e743d89ee3d7340b11f426cd9bc57a3a655 under all five configured rubrics. Both findings on8b8bd4852 have been repaired across their families and neighboring instances.142 exact helper clone groups now share143 canonical definitions in36 modules, including the cited mixed-change, disjoint-theta and extension-auxiliary copies.300 old interfaces map to those definitions.65 small public/private-imported compatibility facades retain names consumed elsewhere. A follow-up exact helper audit leaves only31 matched groups /151 redundant lines, all4–9-line facades forwarding to shared definitions; the substantive proof copies are gone. This does not claim absence of every near-duplicate.

All ten additionally cited certificate analyses use TashkinovSeries.coloringProperties. A generic first-position membership theorem needs only arbitrary tree/coloring/color data, Fintype E and a strict bound; six coupled membership helpers and neighboring bound helpers were removed. The two coupled disjointness helpers were replaced by general Finset facts.61 import headers shed205 imports and added91 narrower imports, preserving private/import-all flags and non-import text; follow-up analysis found no further suggestions. Six new naming-linter findings were fixed without waivers.

Current scope:770 modules,418389 physical lines,3301 imports;762 modules in the root closure. This repair cuts5464 net lines. All local checks pass on identical source hashes: complete aggregate1915 jobs with zero warnings,15 native linters over22354 declarations, compiler diagnostics zero, style/static/generated indexes/card resolution, full axiom/option audits and all506 original theorem contracts in17 batches. No checks/configuration changes, waivers or theorem weakening.

The final clean two-thread root build passed in1418.949s, user/system CPU2457.981s /305.856s, peak child RSS3,430,692KiB. The compatibility baseline was1240.430s /2,165,628KiB with4341 warnings and source budget overrides, not acceptable content. Both use clean private project artifacts and warm exact dependencies on the same shared16-CPU VM. Raw changes and host-load limitations, all seven focused before/after profiles (including neutral/regressed observations), and scope growth are disclosed in the PR body. No isolated whole-project speedup is claimed.

CI on this exact head remains a separate requirement; individual current-head contexts are inspected. The previous8b green CI is not assigned to this revision. Current-head Greptile established no new blocking defect and explicitly reports incomplete coverage. No queue or auto-merge action has been taken.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Partial-port advisory resolution for 45810e743d89ee3d7340b11f426cd9bc57a3a655: the audit flags descriptive filename changes and shorter files after proof decomposition. I checked all16 flagged paths against the final sources and successful original theorem-contract batches. Every flagged original theorem remains proved under its original statement; all506 upstream theorem contracts pass in17 batches on identical current source hashes. The complete original684-module theorem dependency closure is preserved. File counts and LOC ratios alone are not used as completeness evidence.

Flagged upstream file Final declaration location Original theorem rechecked
P2971_T1_PositivePrefixNoRevisiting.lean PositivePrefixNoRevisiting.lean P2971_T1_PositivePrefixNoRevisiting
P2968_T2_ScheideOrderNineBlockCompletion.lean ScheideOrderNineBlockCompletion.lean P2968_T2_ScheideOrderNineBlockCompletion
P2940_T1_OneDividerRefresh.lean OneDividerRefresh.lean P2940_T1_OneDividerRefresh
P2813_T1_BaseControl.lean BaseControl.lean P2813_T1_BaseControl
P2940_T1_StarredPrefixPreparation.lean StarredPrefixPreparation.lean P2940_T1_StarredPrefixPreparation
P2905_T2_AbsentOwnerReplacement.lean AbsentOwnerReplacement.lean P2905_T2_AbsentOwnerReplacement
P2880_T1_OutsidePrefixBranch.lean OutsidePrefixBranch.lean P2880_T1_OutsidePrefixBranch
P2905_T2_LateOwnerReplacement.lean LateOwnerReplacement.lean P2905_T2_LateOwnerReplacement
ExtensionBase.lean ExtensionBase.lean ExtensionBase
TdTerminalSEPERebuild.lean TdTerminalSEPERebuild.lean TdTerminalSEPERebuild
HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne
HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound
HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization
StableChangeCaseThree.lean StableChangeCaseThree.lean StableChangeCaseThree
ChangeLemmaBothOutside.lean ChangeLemmaBothOutside.lean ChangeLemmaBothOutside
HierarchySituationTwoReorderedTreesCertified.lean HierarchySituationTwoReorderedTreesCertified.lean HierarchySituationTwoReorderedTreesCertified

The short ExtensionBase, HierarchySituationTwoSubcaseThreeOne, StableChangeCaseThree and ChangeLemmaBothOutside files import their proof/preparation modules, rather than omit the proof. Other LOC differences reflect shared facts, eliminated duplicated elaboration and validated interface cleanup. The saved per-path map records direct owned dependencies, preparation files and exact contract-batch locations. Fundamental graph/coloring/density definitions were separately compared; generalized class assumptions do not change the advertised mathematics.

This resolves the completeness concern represented by this filename/LOC heuristic. No gate, threshold, waiver or challenge statement was changed. Current-head CI and the fresh five-rubric review remain separate requirements; no queue or auto-merge action has been taken.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed exact head 45810e743d89ee3d7340b11f426cd9bc57a3a655.

The source review is favorable. I reviewed the complete 94-path refactor, including all 36 new shared-fact modules, with independent checks of contracts, moved proofs, constructors, imports and callers. The card, headline theorems and foundational mathematical structures retain the previously reviewed scope and provenance.

The two quality findings from the 8b8bd485 review are addressed across the cited families: the mixed-change, disjoint-theta and extension branches share proved interfaces; certificate branches use the existing coloringProperties; first-position membership now has an arbitrary-tree lemma without the hierarchy reconstruction premises; and the elementary disjointness cases use general Finset facts. Expanded statement aliases and retained callers preserve the original assumptions and conclusions. The two removed public generated helpers are unused and superseded by the general first-position facts.

I found no remaining source blocker in these changes. This is a source judgment, not a build or performance result: the current-head Lean workflow and canonical check remain pending. The existing current-head five-rubric request is retained; older-head CI and review results do not qualify this revision. Protected integration still requires the independent current-head review, complete applicable CI and current-main/native-queue checks.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

At 45810e743d89ee3d7340b11f426cd9bc57a3a655, I checked the published review’s remaining quality findings against the actual source. The four core rubric passes remain separate from the advisory quality result.

The remaining repair is concrete: remove six private TwoTwo forwarders and three private prefix helpers; consolidate ten copied segment, missing-leaf, root-swap and adjoin proofs; and replace broad restoration-context arguments in elementary shared facts with narrow premises. The missing-leaf fact must continue to work without assuming distinct colors, and the root-swap fact must not acquire a proper-coloring assumption. Existing public theorem statements and compatibility wrappers must remain available.

I have prepared this bounded cleanup in an isolated worktree based on this exact head. Independent source checks preserve the existing public contracts; compiler and lint validation is still pending, and the published branch has not been changed. The current head’s complete authored checks are qualified, but queue admission remains pending this source repair and the repaired head’s normal checks and review.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

The filename/LOC advisory on exact head b3795278cbdd83738da8e985c700590383ba4fc6 (run) flags the same16 upstream paths. Each maps to an existing result, and all506 original theorem contracts passed again on this source in17 local Lean batches. The table gives the actual declaration locations; filename counts are not the completeness argument.

Upstream path Committed declaration location Original theorem(s) rechecked
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean LeanPool/GoldbergSeymour/PositivePrefixNoRevisiting.lean P2971_T1_PositivePrefixNoRevisiting
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean LeanPool/GoldbergSeymour/ScheideOrderNineBlockCompletion.lean P2968_T2_ScheideOrderNineBlockCompletion
Tablet/P2940_T1_OneDividerRefresh.lean LeanPool/GoldbergSeymour/OneDividerRefresh.lean P2940_T1_OneDividerRefresh
Tablet/P2813_T1_BaseControl.lean LeanPool/GoldbergSeymour/BaseControl.lean P2813_T1_BaseControl
Tablet/P2940_T1_StarredPrefixPreparation.lean LeanPool/GoldbergSeymour/StarredPrefixPreparation.lean P2940_T1_StarredPrefixPreparation
Tablet/P2905_T2_AbsentOwnerReplacement.lean LeanPool/GoldbergSeymour/AbsentOwnerReplacement.lean P2905_T2_AbsentOwnerReplacement
Tablet/P2880_T1_OutsidePrefixBranch.lean LeanPool/GoldbergSeymour/OutsidePrefixBranch.lean P2880_T1_OutsidePrefixBranch
Tablet/P2905_T2_LateOwnerReplacement.lean LeanPool/GoldbergSeymour/LateOwnerReplacement.lean P2905_T2_LateOwnerReplacement
Tablet/ExtensionBase.lean LeanPool/GoldbergSeymour/ExtensionBase.lean ExtensionBase
Tablet/TdTerminalSEPERebuild.lean LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean TdTerminalSEPERebuild
Tablet/HierarchySituationTwoSubcaseThreeOne.lean LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne
Tablet/HierarchySituationThreeEligibleIndexBound.lean LeanPool/GoldbergSeymour/HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound
Tablet/HierarchySituationTwoCaseThreeNormalization.lean LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization
Tablet/StableChangeCaseThree.lean LeanPool/GoldbergSeymour/StableChangeCaseThree.lean StableChangeCaseThree
Tablet/ChangeLemmaBothOutside.lean LeanPool/GoldbergSeymour/ChangeLemmaBothOutside.lean ChangeLemmaBothOutside
Tablet/HierarchySituationTwoReorderedTreesCertified.lean LeanPool/GoldbergSeymour/HierarchySituationTwoReorderedTreesCertified.lean HierarchySituationTwoReorderedTreesCertified

Descriptive renames, imported preparation modules and shared proof facts account for the observations. The full775-module aggregate, native linters, style, quality, axiom/option audits and original contracts pass locally on matching source hashes. Fresh CI remains pending. No missing theorem was found and no waiver was added.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed published head b3795278cbdd83738da8e985c700590383ba4fc6.

The complete source delta resolves the earlier quality findings: forwarding layers and copied tree/Kempe/adjoin proofs are replaced by shared facts, and prefix/augmentation transport now uses the data it actually needs. I traced the removed helper interfaces to their replacements and checked the surviving consumers. Port-only helper names have been retired; this is not a claim that every old exported helper name remains available.

The forward missing-neighbor fact still needs no distinct-color hypothesis, and the root-color swap fact adds no proper-coloring hypothesis. Removing the unused finiteness premise from augmentation initial-segment transport strengthens that result. The original mathematical statements, graph bridge, project scope, attribution and provenance remain intact. The complete 775-module aggregate is acyclic and contains all project modules.

My source verdict is favorable for this exact revision. Its current-head hosted validation, configured project review and normal protected integration remain separate requirements. The earlier-head checks and my unpublished targeted repair build are not credited to this head.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please run the configured project-rubric review for current published head b3795278cbdd83738da8e985c700590383ba4fc6. The source continuation review is posted. This revision consolidates tree/Kempe facts and removes redundant helper interfaces; the earlier 45810e743d89ee3d7340b11f426cd9bc57a3a655 verdict remains dated. Current-head validation and protected integration are independent.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

The filename/LOC advisory on exact head c8299d3aae8f2d347abe5da7db6c5de13dc41fd9 (run) flags the same16 upstream paths. Each maps to an existing result, and all506 original theorem contracts passed again on this source in17 local Lean batches. The table gives the actual declaration locations; filename counts are not the completeness argument.

Upstream path Committed declaration location Original theorem(s) rechecked
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean LeanPool/GoldbergSeymour/PositivePrefixNoRevisiting.lean P2971_T1_PositivePrefixNoRevisiting
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean LeanPool/GoldbergSeymour/ScheideOrderNineBlockCompletion.lean P2968_T2_ScheideOrderNineBlockCompletion
Tablet/P2940_T1_OneDividerRefresh.lean LeanPool/GoldbergSeymour/OneDividerRefresh.lean P2940_T1_OneDividerRefresh
Tablet/P2813_T1_BaseControl.lean LeanPool/GoldbergSeymour/BaseControl.lean P2813_T1_BaseControl
Tablet/P2940_T1_StarredPrefixPreparation.lean LeanPool/GoldbergSeymour/StarredPrefixPreparation.lean P2940_T1_StarredPrefixPreparation
Tablet/P2905_T2_AbsentOwnerReplacement.lean LeanPool/GoldbergSeymour/AbsentOwnerReplacement.lean P2905_T2_AbsentOwnerReplacement
Tablet/P2880_T1_OutsidePrefixBranch.lean LeanPool/GoldbergSeymour/OutsidePrefixBranch.lean P2880_T1_OutsidePrefixBranch
Tablet/P2905_T2_LateOwnerReplacement.lean LeanPool/GoldbergSeymour/LateOwnerReplacement.lean P2905_T2_LateOwnerReplacement
Tablet/ExtensionBase.lean LeanPool/GoldbergSeymour/ExtensionBase.lean ExtensionBase
Tablet/TdTerminalSEPERebuild.lean LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean TdTerminalSEPERebuild
Tablet/HierarchySituationTwoSubcaseThreeOne.lean LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne
Tablet/HierarchySituationThreeEligibleIndexBound.lean LeanPool/GoldbergSeymour/HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound
Tablet/HierarchySituationTwoCaseThreeNormalization.lean LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization
Tablet/StableChangeCaseThree.lean LeanPool/GoldbergSeymour/StableChangeCaseThree.lean StableChangeCaseThree
Tablet/ChangeLemmaBothOutside.lean LeanPool/GoldbergSeymour/ChangeLemmaBothOutside.lean ChangeLemmaBothOutside
Tablet/HierarchySituationTwoReorderedTreesCertified.lean LeanPool/GoldbergSeymour/HierarchySituationTwoReorderedTreesCertified.lean HierarchySituationTwoReorderedTreesCertified

Descriptive renames, imported preparation modules and shared proof facts account for the observations. The full775-module aggregate, native linters, style, quality, axiom/option audits and original contracts pass locally on matching source hashes. Fresh CI remains pending. No missing theorem was found and no waiver was added.

Remove the unused private helperRouteToY1012Conditions abbreviation after checking all 783 project modules. Preserve the published author repair, retained public statements, proof bodies and imports. This new revision requires its own hosted checks.
@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head cc2347e9818ada9a4734aabe71ba737f6f4eaf90 under all five configured rubrics. The PR description records the upstream source, license, scope, local checks and the completed current-head clean measurement. Current-head CI remains an independent requirement.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please run the configured five-rubric project review on exact current head 7ddd402ed8237857205a92e9e7ad8a039444ffe4.

This preserves the author's complete cc2347e tree/walk/series repair and removes one unused private condition helper. The new revision needs its own configured review and hosted build, lint, style, quality and other applicable checks. Earlier-head local measurements and CI remain dated evidence. Normal protected native integration is still separate.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed current head 7ddd402ed8237857205a92e9e7ad8a039444ffe4. The source verdict is favorable.

I reviewed the complete 31-path author repair at cc2347e, with independent reviews of the intrinsic tree/prefix facts, certificate transport, exit paths, confinement, stability and their callers. The repeated proof families now use proved data-level interfaces or the existing certified-coloring API. The distinct defective/nondefective no-departure arguments retain their separate justifications. Prefix/order/augmentation facts use the premises their proofs need. The newly shared adjoin fact strengthens the old construction-specific interface.

The retained declaration headers and definition values were checked against the preceding source. Supplemental public port-helper names are retired in this repair; this is not blanket preservation of every previous helper export. All 506 original upstream theorem names remain present, which is written-name coverage rather than a new compiled contract-equivalence claim. The complete 783-module public aggregate is closed and acyclic. The headline mathematics, graph bridge, card, attribution, license and provenance retain their reviewed scope.

I made one small follow-up on the published author commit: removal of the unused private helperRouteToY1012Conditions block and its adjacent blank line. A complete current-project scan found only its declaration. Every retained command, public header, proof body and import in that file is unchanged; the full repository tree change and its inverse were independently verified.

No further source-blocking finding remains from these repairs. The project still has substantial generated plumbing and compilation cost; this verdict is at the pool's competent-project bar, not a claim of Mathlib-level polish or a measured speedup.

This exact new head needs its own complete applicable hosted checks, configured five-rubric review and normal protected native integration. The author’s earlier local validation/timings and successful older-head CI are retained only as dated observations. No new local compiler result is claimed. The current-head configured review was requested once in comment6681345908.

@Vilin97

Vilin97 commented Nov 6, 2026 •

Copy link
Copy Markdown
Collaborator Author

Separate thorough review — exact head 7ddd402ed8237857205a92e9e7ad8a039444ffe4.

Conclusion: request changes. Hosted Lean CI found seven proof-length warnings in five imported modules under current main's compiler check. All three concrete findings in configured review2362 also need repair: repeated closure/cardinality/support/path-adjacency proofs, construction-only premises on elementary hierarchy facts, and two unused private condition interfaces. I inspected the reported source and will repair these directly; these historical observations do not establish merge readiness for later revisions.

The independent source audit covers the pinned licensed684-module original theorem closure, every783-module port inventory/dependency graph and endpoint, representative implementation slices, and all32 modules changed since fcc. It includes direct inspection of the six new generic proof modules and the unused-alias deletion. This does not claim manual line-by-line reading of393431 lines. All506 original theorem contracts still recheck in17 batches;154 of176 definition contracts normalize and22 changed/generalized interfaces were individually reviewed. The finite-loopless multigraph bound and high-index equality preserve their advertised assumptions, odd-set multiplicities and actual coloring semantics. The Mathlib bridge retains active/isolated vertices, incidence and independent parallel-edge identities. No algorithmic running-time claim is made.

Research significance, source fidelity, eligibility and license remain supported: Chen–Jing–Zang's paper states both results; Wesley Pegden's public Trellis page dates completion2026-10-12; source88d98c1d1a59d1f1bf7c4eb58e73f3945f6daf12 explicitly licenses Tablet/ under Apache-2.0. No paper/ material is included. AI provenance, operation and port attribution are recorded. Pool/history/PR, pinned Mathlib/Tau Ceti and supplementary public searches revealed no duplicate headline. Reusable partial coloring, Kempe-swap, critical-subgraph and Tashkinov infrastructure is preserved.

The783-module local public aggregate passes1928 jobs with zero diagnostics under the author-head configuration, as do15 native linters over21748 declarations, style/static/index/card checks, compiled axiom and option/backdoor audits, and original-contract validation on matching source hashes. Hosted test merge59685a9d4 includes current main906301d and its new proof-size compiler plugin; its seven warnings are actual source defects to fix, not a reason to alter any gate. No waiver or configuration change is proposed.

Controlled clean measurement at this head:1116.493174s wall,2184.572370s user,301.188318s system,3426772KiB maximum child RSS. Two threads, exact warm external dependencies, cleared private project artifacts and no concurrent acquisition-owned Lean work; shared-host load remains uncontrolled. The original compatibility baseline was1240.429533s/2165628KiB but had4341 warnings and source overrides. The observed final wall difference is−9.99%, peak child RSS+58.23%; this is not a causal speedup estimate. The parentcc checkpoint was1135.119s/3429048KiB. Twelve paired focused profiles include every regression; their after-source and complete owned dependency closures are byte-identical at this head.759 unchanged closures have median final/parent per-file ratio0.974. Compile cost and source volume remain reviewed maintenance tradeoffs.

Greptile's current-head advisory reports no blocking defect in the latest deletion and explicitly incomplete full-contribution coverage. Current-head advisory profiling failed during cache restoration with runner disk exhaustion and produced no profile; this is separate from required Lean validation. No queue, auto-merge or merge action has been taken. Approval requires completed source repairs and fresh exact-head checks/review/measurements.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Exact-head partial-port resolution — 053fbd6937d54972697a1cbaa5bb68072097e43a

The current filename/LOC advisory succeeds and flags16 paths. Every path maps to the actual preserved theorem below and a successful original-statement contract batch on this revision. All506 original theorem contracts recheck in17 batches on the787 current source hashes. This is completeness evidence beyond raw filename or line counts; it does not replace hosted CI or review.

Upstream path Current path Original theorem contract
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean LeanPool/GoldbergSeymour/PositivePrefixNoRevisiting.lean P2971_T1_PositivePrefixNoRevisiting
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean LeanPool/GoldbergSeymour/ScheideOrderNineBlockCompletion.lean P2968_T2_ScheideOrderNineBlockCompletion
Tablet/P2940_T1_OneDividerRefresh.lean LeanPool/GoldbergSeymour/OneDividerRefresh.lean P2940_T1_OneDividerRefresh
Tablet/P2813_T1_BaseControl.lean LeanPool/GoldbergSeymour/BaseControl.lean P2813_T1_BaseControl
Tablet/P2940_T1_StarredPrefixPreparation.lean LeanPool/GoldbergSeymour/StarredPrefixPreparation.lean P2940_T1_StarredPrefixPreparation
Tablet/P2905_T2_AbsentOwnerReplacement.lean LeanPool/GoldbergSeymour/AbsentOwnerReplacement.lean P2905_T2_AbsentOwnerReplacement
Tablet/P2880_T1_OutsidePrefixBranch.lean LeanPool/GoldbergSeymour/OutsidePrefixBranch.lean P2880_T1_OutsidePrefixBranch
Tablet/P2905_T2_LateOwnerReplacement.lean LeanPool/GoldbergSeymour/LateOwnerReplacement.lean P2905_T2_LateOwnerReplacement
Tablet/ExtensionBase.lean LeanPool/GoldbergSeymour/ExtensionBase.lean ExtensionBase
Tablet/TdTerminalSEPERebuild.lean LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean TdTerminalSEPERebuild
Tablet/HierarchySituationTwoSubcaseThreeOne.lean LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne
Tablet/HierarchySituationThreeEligibleIndexBound.lean LeanPool/GoldbergSeymour/HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound
Tablet/HierarchySituationTwoCaseThreeNormalization.lean LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization
Tablet/StableChangeCaseThree.lean LeanPool/GoldbergSeymour/StableChangeCaseThree.lean StableChangeCaseThree
Tablet/ChangeLemmaBothOutside.lean LeanPool/GoldbergSeymour/ChangeLemmaBothOutside.lean ChangeLemmaBothOutside
Tablet/Step1ZeroDividerAnchorNonPE.lean LeanPool/GoldbergSeymour/Step1ZeroDividerAnchorNonPE.lean Step1ZeroDividerAnchorNonPE

The current source also passes the full1932-job public build with zero warnings,15 native linters over21,682 declarations, style/static/index/card/axiom/option checks and the unchanged main compiler plugin over all787 modules. The new clean whole-project measurement and hosted validation are still running. No merge approval is implied.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Exact-head continuation: 053fbd6937d54972697a1cbaa5bb68072097e43a.

Verdict: request changes — two remaining proof-sharing repairs.

I reviewed the 24-file repair, including the four new modules, their callers, the six condition-value rewrites and the two proof-bearing abbreviation interfaces. The new closure, disjoint-family cardinality, degree-two path, elementary-set and hierarchy facts address the corresponding earlier findings. The removed private helpers have no remaining written references. I found no new mathematical defect in these changes; the retained theorem headers preserve the previously reviewed contracts.

Two concrete parts of the expanded quality review still remain:

  1. Nonparallel interchangeability is proved three times. See BaseControl, line 476, ChangeLemmaMixedClosedFinal, line 487, and ChangeLemmaMixedLargestClosed, line 1397. Each reconstructs predecessor stability through the certified SE/RE cases, uses CertifiedETTRestriction above one round, and falls back to TechnicalTheoremBase at one round. Extract one last-stage interchangeability lemma from the positive-round, maximum-property, lower-round and missing-color assumptions; keep the starred/core identifications as short adapters. The new closedOfNonParallel shares closure, but does not share this argument.

  2. The two boundary-return orientations still duplicate the same proof. In ScheideSymmetricOriginalBoundaryAvoidance, lines 110 and 242, helper_hreturn_one_242 and helper_hreturn_two_319 repeat the path-index/maximal-return contradiction with f1/u1/v1 and f2/u2/v2 exchanged. Parameterize the selected edges/endpoints and the outside/remainder facts, then call one proof from both orientations.

These are bounded maintenance repairs: future changes to the certified-step or return argument should have one proof to update. Please preserve the existing caller conclusions while extracting them.

The seven previously reported proof-length sites have been replaced by canonical APIs or short shared facts. That source change does not itself establish a clean compiler-plugin run: hosted validation of the actual current test merge a94cdcc419c2a47a3995a05d29fc85ffca116d37 remains independent, as do the other required checks and fresh configured review. Earlier-head failures and author-local validation claims are not assigned to this head.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 053fbd6937d54972697a1cbaa5bb68072097e43a under all five configured rubrics. The PR description records the upstream source, license, scope, local checks and the completed current-head clean measurement. Current-head CI remains an independent requirement.

@Vilin97

Vilin97 commented Nov 6, 2026 •

Copy link
Copy Markdown
Collaborator Author

Independent source and engineering review — exact head 053fbd6937d54972697a1cbaa5bb68072097e43a

Conclusion: request changes. Fresh configured review2365 and direct source inspection identify two further repairable engineering findings. The152-line shared-core calculation is recomputed in a branch despite an already available result; substantial outside-advancement, terminal-route and deleted-block proofs are also repeated. Situation/index/transitivity premises remain on five inside-advancement helpers, and two elementary equality helpers retain145-line construction interfaces. These need shared data-level proofs and smaller callers before approval.

I reviewed the pinned public upstream, licensed dependency closure, mathematical endpoints and definitions, native Mathlib bridge, complete owned import/declaration inventory, representative source slices and all24 latest changed/new modules. The four new generic proof modules were inspected directly, as were their actual callers and the new elementary-set/hierarchy facts. This is bounded source review of787 modules /390451 lines, not a claim of manual line-by-line reading.

The two headlines are faithful: the finite loopless multigraph bound chi' <= max(Delta+1,ceil Gamma), and chi'=ceil Gamma under chi'>=Delta+2. Odd-set density counts internal edge identities with multiplicity over odd sets of size>=3 and includes zero. Proper full colorings define the actual chromatic index. Critical cores and induction contexts are constructed internally, not supplied as extra endpoint premises. The Graph bridge preserves incidence/endpoints, active and isolated vertices and independent parallel-edge identities, including finite active sets with infinite ambient types. No executable or polynomial-time algorithm is claimed.

The research-level theorem and substantial partial-coloring/Kempe/Tashkinov infrastructure fit a completed Lean Pool project. The Chen–Jing–Zang source supports both mathematical claims. Wesley Pegden's public Trellis page dates completion2026-10-12 at day precision, within[2026-09-05T10:45:10Z,2026-10-29T10:45:10Z). Public source88d98c1d1a59d1f1bf7c4eb58e73f3945f6daf12 explicitly licenses Tablet/ under Apache-2.0 and excludes paper/, which is not copied. Copyright and formalization/port attribution remain, with accurate AI provenance. Pool cards/source/history/PRs/issues, pinned Mathlib/Tau Ceti and supplementary public searches revealed no matching headline; the public lexical searches are not an exhaustive absence proof.

The coherent684-module original theorem closure and useful supporting APIs remain. All506 original theorem contracts recheck in17 current batches. Of176 original definition contracts,154 normalize identically and22 changed/generalized interfaces were individually reviewed. The current filename/LOC advisory's16 paths all map to actual preserved theorems and successful original-contract batches, recorded at #761 (comment) . One card and a generated public wrapper are added; fixed LeanPool.lean is unchanged. The whole diff is content-only, with no gate/config change or waiver. Concurrent author work is retained in the history.

The reported substantive proof copies now use actual data-level closure, disjoint-family cardinality, degree-two path and path-number facts. Earlier exit-path, confinement, series stability, prefix/augmentation and hierarchy facts likewise have shared implementations. Construction-only premises are removed from the cited elementary helpers; orphan private condition interfaces and a cycle forwarder are deleted. Expanded proof fields use short canonical proofs rather than duplicated recursors. The latest repair removes2980 net source lines and66 compiled declarations while preserving all original contracts. Short parallel proof patterns and generated context scaffolding remain; this is not a blanket absence-of-duplication claim. Their retained scope is weighed against the new reusable boundaries, complete source/trust checks and measured cost.

All11 local check phases pass on787 identical source hashes: complete public aggregate1932jobs/0warnings,15 native linters over21682 declarations, compiler diagnostics/style/static/index/card resolution, complete compiled axiom/option audits and506 original contracts, plus the unchanged current-main compiler proof-size plugin across every owned module. The positive control reproduces the old218-line warning; the current source has zero diagnostics. Axiom closure covers public/private/generated declarations and aliases and allows only the pool's three permitted axioms. There is no sorry/admit, prohibited mechanism, source budget override, suppression or policy weakening.

Current clean root:1168.475616s wall,2192.557521s user,305.449157s system,3423920KiB maximum child RSS;779 root modules/1924jobs. Complete public support build:1932jobs/0warnings. Two Lean threads, cleared private artifacts, exact warm dependencies, frozen source and no concurrent acquisition-owned Lean work; other shared-host workloads remain uncontrolled. The parent7ddd checkpoint measured1116.493174s/2184.572370s user/3426772KiB. The original compatibility baseline measured1240.429533s/2165628KiB but emitted4341 warnings and retained source overrides, so was unacceptable content. Current observed wall differs−5.80% from that baseline and+4.66% from the parent; peak child RSS is+58.10% versus the raw baseline.369 unchanged complete dependency closures have median current/parent ratio1.000. No causal overall speedup is claimed.

All17 targeted profile pairs pass; every maximum-child-RSS observation falls, while15 wall and12 user-CPU observations rise. Sums80.475→100.803s wall and104.904→106.869s user are disclosed, alongside all individual regressions. The inspected profiles include substantial interpreter/linter work and blocked/unaccounted time. No additional material safe source change is supported by these particular profiles; no causal scheduling attribution is asserted. Direct profiles omit artifact/dependency compilation, unlike the complete root measurement. The local timing configuration is identical to the parent and excludes the new main plugin's overhead; the exact plugin separately passes all787 sources and hosted merged-revision CI enforces it.

Hosted test mergea94cdcc41 combines this author head with main775693e4 and the current compiler policy. All10 build shards, assembly, lint/style, repository quality and the Build project context pass. Required minimal-file validation is running after cancellation of only a superseded same-PR extraction; its current check remains required. Main775 merge-group and push Lean validation pass, with individual required contexts success/legitimate skip; refresh before queue entry. Daily asynchronous documentation is not a gate; Documentation preflight remains required.

Greptile's current-head advisory reports no blocking defect and explicitly partial full-contribution coverage, not complete merge approval. Advisory profiling42202392868/job127840809765 fails during cache restoration with confirmed runner disk exhaustion and produces no source profile. It is separate from protected validation and the complete local measurements.

The earlier repairs and measurements remain valid checkpoints; they do not settle these newly identified maintenance defects. The exact review output is preserved and source repairs are in progress. No queue, auto-merge or merge action has been taken.

FINAL CONCLUSION: request changes. Repair the copied core/advancement/route/block proofs and construction-only interfaces, then validate and review the resulting exact head. The current minimal-file check must still pass normally.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Partial-port advisory resolution at 606e50e891cb7da1ec943da61675e90bc780e46a.

Current advisory run completed successfully and reports16 filename/LOC flags. Each maps to a preserved declaration and a successful original-statement contract below. All506 original theorem contracts pass in17 batches on the same791 source hashes; the full public aggregate builds warning-free. No missing original result was found in this audit. Raw filename/LOC counts alone are not completeness evidence.

Upstream path Current module Successful original-contract batch
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean PositivePrefixNoRevisiting Batch09.lean
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean ScheideOrderNineBlockCompletion Batch09.lean
Tablet/P2940_T1_OneDividerRefresh.lean OneDividerRefresh Batch09.lean
Tablet/P2813_T1_BaseControl.lean BaseControl Batch08.lean
Tablet/P2940_T1_StarredPrefixPreparation.lean StarredPrefixPreparation Batch09.lean
Tablet/P2905_T2_AbsentOwnerReplacement.lean AbsentOwnerReplacement Batch08.lean
Tablet/P2880_T1_OutsidePrefixBranch.lean OutsidePrefixBranch Batch08.lean
Tablet/P2905_T2_LateOwnerReplacement.lean LateOwnerReplacement Batch09.lean
Tablet/ExtensionBase.lean ExtensionBase Batch02.lean
Tablet/TdTerminalSEPERebuild.lean TdTerminalSEPERebuild Batch16.lean
Tablet/HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne Batch06.lean
Tablet/HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound Batch05.lean
Tablet/HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization Batch05.lean
Tablet/StableChangeCaseThree.lean StableChangeCaseThree Batch13.lean
Tablet/ChangeLemmaBothOutside.lean ChangeLemmaBothOutside Batch01.lean
Tablet/Step1ZeroDividerAnchorNonPE.lean Step1ZeroDividerAnchorNonPE Batch14.lean

The changes comprise descriptive renames, proof decomposition, shared facts and verified cleanup. The current16-path resolution and source-hash receipts are retained as seventh-partial-port-resolution.json on the operator VM. This is an evidence-based resolution, without a waiver or gate change. Hosted required checks, the additional current-main compiler-policy audit, performance measurements and fresh reviews remain separate requirements.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Independent source continuation at 606e50e891cb7da1ec943da61675e90bc780e46a: changes still requested for the two proof-sharing repairs from my preceding review.

The 13-file revision addresses the separate configured-review findings. I checked the four new generic proof modules, their direct callers, the two generalized proposition interfaces, and the shorter equality proofs. The certified terminal-route, deleted-block and tail-swap facts derive the needed results from the existing data; callers do not gain an unproved endpoint assumption. Computing the PE core once and using interchangeability restriction/symmetry also removes the duplicated branch calculation. I found no new mathematical defect in these repairs.

Two independently requested groups remain unchanged and used:

  1. The nonparallel interchangeability argument still appears in BaseControl:476, MixedClosedFinal:489, and MixedLargestClosed:1399. Share the last-stage interchangeability proof, leaving short starred/core adapters. The new terminalRoute proves an augmentation route; it does not replace this predecessor-stability/interchangeability argument.
  2. ScheideSymmetricOriginalBoundaryAvoidance:110 and 242 still contains both complete boundary-return contradiction proofs. Parameterize the selected edge/endpoints and outside/remainder facts, then reuse one proof for the two orientations.

All five complete proof commands are byte-identical to the previously reviewed revision; the new helpers do not resolve these two groups indirectly. Preserve the caller conclusions while making those bounded repairs. Current-head hosted CI, configured review, final measurements and author integration custody remain separate; no earlier-head validation or author-local audit claim was assigned to this revision.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 606e50e891cb7da1ec943da61675e90bc780e46a under all five configured rubrics. The PR description records the upstream source, license, scope, local checks and the completed current-head clean measurement. Current-head CI remains an independent requirement.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Independent review of the new quality findings at 606e50e891cb7da1ec943da61675e90bc780e46a: I confirmed three additional repair groups in the published source.

  1. Reuse the existing component and advancement results. The local componentData in HierarchySituationThreeDisjointThetaUnstoredOutsideImpossible repeats P2905_T2_ElementaryTerminalComponent; TerminalKempeStageSwitch already demonstrates its adapter. The eligible-index helper_tailException_1151 repeats SharedFacts.InsideAdvancement.tailException. The two StoredException helper_htailEdges proofs also share the same long tail-color calculation. Extract that common calculation over its actual geometric and coloring inputs, preserving the branch-specific conclusions.
  2. Generalize the two first-missing-position interfaces in SharedFacts/MixedChangeTransport/Preparation1 and remove the duplicated calculations in ChangeLemmaMixedLargestClosed.helper_firstLe_1215 / helper_firstStrict_1224. Their proofs use only the already constructed tree and coloring. TreeSequenceFirstMissingPositionLe and TreeSequenceFirstMissingPositionMem already provide the required generic facts.
  3. Share the starred-counterexample construction used in the OneOne/TwoOne Nonexceptional helper contracts. Their repeated elaborated Eq.mpr constructions obscure the short five-field record already used by the callers. Preserve the exact HStar and goodStar data and the dependent result types; the whole counterexample record cannot be treated as proof-irrelevant.

The two proof-sharing repairs in my preceding review remain open independently. Please publish the repairs on the author-owned branch and validate the changed dependency cones. I verified these new findings against the current source; configured review2369's completed mathematical passes and the completed Lean CI do not resolve these maintenance requests. Minimal-file validation remains independently pending.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Independent source review of 606e50e891cb7da1ec943da61675e90bc780e46a: request changes.

Direct inspection confirms three remaining engineering issues in the published source:

  • HierarchySituationThreeDisjointThetaUnstoredOutsideImpossible.componentData repeats the elementary terminal-component argument although the project already proves that result. HierarchySituationThreeEligibleIndexBound.helper_tailException_1151 copies the existing inside-advancement fact. The two StoredException modules repeat the tail-edge color calculation and its incident/stored-color derivation. These need shared proofs over their actual colorings, trees and hierarchy data.
  • The first-missing-position helpers in ChangeLemmaMixedLargestClosed and the corresponding shared MixedChangeTransport interfaces carry counterexample, hierarchy and prefix-construction data that their calculations discard. TreeSequenceFirstMissingPositionLe and TreeSequenceFirstMissingPositionMem already handle arbitrary trees with only finite edge types.
  • Both Nonexceptional modules repeatedly construct the same starred counterexample in helper contracts, including fully elaborated Eq.mpr, instance and recursor terms. The caller already has short proofs of the rung and vertex-set identities. The same transported object should be used in contracts and consumers through one canonical construction.

The reported declarations, their callers and existing replacement APIs were inspected in bounded source output. The counterexample-record scan identifies 16 repeated constructions across the two files, including 11 expanded forms. The previously measured revision is frozen before repair; 15 additional before-profiles cover the targeted modules and consumers. These are actionable source repairs and are in progress on the isolated worktree.

The complete published source still has its own successful 11-phase local receipt, all 506 original theorem contracts, warning-free public build and completed clean measurement: 1,076.572s wall / 2,152.460s user / 3,433,004KiB maximum child RSS. Hosted Lean validation for this revision succeeded; the independent required minimal-file check is still extracting declarations. These facts do not resolve the maintenance findings above. The next edited revision will require fresh validation and measurements.

The mathematical headlines remain the finite loopless-multigraph bound and the disclosed high-index equality, with parallel-edge identities and odd-set density preserved. The Apache-2.0 source grant, attribution, AI provenance, October12 completion evidence and pinned upstream scope remain recorded in the PR. The latest edits have not changed the headline declarations, and their original contracts will be checked again.

An older discussion line has also been clarified to name its literal historical revision, preserving its original conclusion and evidence without ambiguous references to a later head. No queue, auto-merge or merge action has been taken.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed the published repair at 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb against the outstanding requests.

The three additional maintenance groups from my preceding review are addressed in this delta:

  • The elementary-terminal-component and tail-exception copies now use the existing shared facts. HierarchyTailColorFacts shares the actual stored-exception tail-color argument; both callers supply the same replacement coloring, hierarchy, last edge and stability hypotheses as before.
  • The mixed branches use the generic tree-sequence first-missing-position facts, with the unnecessary hierarchy/counterexample setup removed from the helper interfaces.
  • HierarchyCounterexample.transport replaces all 16 repeated constructions while retaining the exact HStar, goodStar (including its gamma data), and maximum certificate. The dependent stage/Fin/measure adapters remain in place. Only the proposition-valued positive/non-elementary witnesses are transported.

The two earlier proof-sharing requests still apply at this head. Their five complete helper declarations and proof bodies are unchanged:

  1. Share the nonparallel interchangeability argument in BaseControl.lean:476, ChangeLemmaMixedClosedFinal.lean:490 and ChangeLemmaMixedLargestClosed.lean:1400.
  2. Share the two boundary-return orientations in ScheideSymmetricOriginalBoundaryAvoidance.lean:110 and :242, retaining their existing hypotheses and conclusions.

This is a favorable review of the three repaired groups, with those two earlier requests still outstanding. The four retired MixedChangeTransport first-position helper names and the smaller InsideAdvancement.tailException application interface are deliberate interface changes, rather than a claim that every helper signature is identical. I found no weakened mathematical statement in the reviewed repair.

Fresh validation belongs to this new head. Its CI is still pending; the current plugin audit, clean-build measurements, affected-file profiles and configured review are also still pending in the published author update. Results for 606e50e do not qualify this revision.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb under all five configured rubrics. The PR description records the upstream source, license, scope, local checks and the completed current-head clean measurement. Current-head CI remains an independent requirement.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Completeness-advisory resolution for 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb. Current advisory run reports sixteen filename/LOC flags. Each maps below to the preserved result and its successful current-source original-signature check. All 506 original theorem contracts pass in seventeen batches on the same 793 source hashes as the eleven local validation phases.

Upstream flag Current module file Original contracts rechecked
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean LeanPool/GoldbergSeymour/PositivePrefixNoRevisiting.lean P2971_T1_PositivePrefixNoRevisiting
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean LeanPool/GoldbergSeymour/ScheideOrderNineBlockCompletion.lean P2968_T2_ScheideOrderNineBlockCompletion
Tablet/P2940_T1_OneDividerRefresh.lean LeanPool/GoldbergSeymour/OneDividerRefresh.lean P2940_T1_OneDividerRefresh
Tablet/P2813_T1_BaseControl.lean LeanPool/GoldbergSeymour/BaseControl.lean P2813_T1_BaseControl
Tablet/P2940_T1_StarredPrefixPreparation.lean LeanPool/GoldbergSeymour/StarredPrefixPreparation.lean P2940_T1_StarredPrefixPreparation
Tablet/P2905_T2_AbsentOwnerReplacement.lean LeanPool/GoldbergSeymour/AbsentOwnerReplacement.lean P2905_T2_AbsentOwnerReplacement
Tablet/P2880_T1_OutsidePrefixBranch.lean LeanPool/GoldbergSeymour/OutsidePrefixBranch.lean P2880_T1_OutsidePrefixBranch
Tablet/P2905_T2_LateOwnerReplacement.lean LeanPool/GoldbergSeymour/LateOwnerReplacement.lean P2905_T2_LateOwnerReplacement
Tablet/ExtensionBase.lean LeanPool/GoldbergSeymour/ExtensionBase.lean ExtensionBase
Tablet/TdTerminalSEPERebuild.lean LeanPool/GoldbergSeymour/TdTerminalSEPERebuild.lean TdTerminalSEPERebuild
Tablet/HierarchySituationTwoSubcaseThreeOne.lean LeanPool/GoldbergSeymour/HierarchySituationTwoSubcaseThreeOne.lean HierarchySituationTwoSubcaseThreeOne
Tablet/HierarchySituationThreeEligibleIndexBound.lean LeanPool/GoldbergSeymour/HierarchySituationThreeEligibleIndexBound.lean HierarchySituationThreeEligibleIndexBound
Tablet/HierarchySituationTwoCaseThreeNormalization.lean LeanPool/GoldbergSeymour/HierarchySituationTwoCaseThreeNormalization.lean HierarchySituationTwoCaseThreeNormalization
Tablet/StableChangeCaseThree.lean LeanPool/GoldbergSeymour/StableChangeCaseThree.lean StableChangeCaseThree
Tablet/ChangeLemmaBothOutside.lean LeanPool/GoldbergSeymour/ChangeLemmaBothOutside.lean ChangeLemmaBothOutside
Tablet/Step1ZeroDividerAnchorNonPE.lean LeanPool/GoldbergSeymour/Step1ZeroDividerAnchorNonPE.lean Step1ZeroDividerAnchorNonPE

The filename/LOC differences reflect descriptive renames, proof decomposition and reuse of shared facts. The eligible-index module is shorter because its copied tail-exception argument now uses the shared proof. The coherent 684-module upstream theorem closure is preserved. Raw file/line counts alone do not establish completeness; the current declaration, dependency and original-contract audits provide the independent evidence. Hosted validation and source reviews remain separate requirements.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed the new completeness and measurement update at 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb.

The official completeness advisory reports eight unmatched filenames and eight line-count gaps, exactly matching the sixteen rows in the author’s response. All sixteen map to current exported proof commands and their import/decomposition routes. The eight reported current/upstream line-count pairs also reproduce the advisory’s counts. In particular, the short ExtensionBase and HierarchySituationTwoSubcaseThreeOne files delegate to the preserved branch/preparation proofs; the eligible-index bound uses the reviewed shared tail argument. I found no new concrete omission from these sixteen heuristic flags. This is a static counterpart/proof-route review, not a fresh kernel audit of all 506 original contracts.

The displayed measurement arithmetic is correct: all fifteen direct wall/user-CPU pairs are lower, while peak child RSS is lower in ten and higher in five. The complete clean build still shows +24.51% wall and +6.71% user CPU against 606e50e. Direct profiles omit artifact generation/dependency compilation and exclude plugin overhead, so their improvements do not establish a whole-project speedup. The description appropriately records those limits and the shared-host uncertainty; the author’s confirmation run is still pending.

My two proof-sharing requests in the preceding source review remain outstanding. Configured review 2371 is running on this exact head, and the current assembler/Exposition checks remain pending. This follow-up adds no full-CI or merge acceptance.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Separate source review of 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb: request changes.

Direct bounded inspection confirms two remaining engineering families in this published source:

  • The PE anchor's exit-boundary proof repeats the existing ClosedColorExitPathBoundaryEdge. Its component-outside proof and the non-PE version repeat the same closed-color confinement calculation. The two penultimate-elementarity branches repeat the lower-round certified restriction argument. The two MixedChange replacement helpers also repeat the hierarchy construction and carry a counterexample/prefix construction context beyond their actual hierarchy, region, coloring and route data. These need canonical shared facts and direct callers.
  • The revisiting penultimate-tree/data-agreement/tree-agreement helpers forward return-walk, cycle, crossing and certificate assumptions absent from their calculations. Their statement interfaces alone occupy more than1500lines. The terminal reconstruction's final-tree/final-color helpers repeat elementary cast/append projections under similarly inflated interfaces. These need facts over the actual series, round equality and field agreements, followed by smaller contracts and callers.

The affected declarations, proof bodies, existing reusable facts and consumers were inspected directly, including the full replacement construction and the restriction branches. The793-module published source is frozen before repair; nine sequential before-profiles cover the affected modules, statement interfaces and the SE/PE consumer. Both clean measurements and all eleven local validation receipts remain preserved for this exact published revision, including506original theorem contracts. Hosted Lean validation42233901116 passes; the independent required minimal-file check42233901176 is still extracting declarations. Neither result resolves the maintenance findings above.

Source repairs are in progress in the isolated worktree. Existing boundary and restriction calculations are being shared over their actual inputs; the replacement and projection interfaces will be narrowed without weakening either headline or the original contracts. The next committed source will receive fresh validation, measurements and review.

Three older author-summary sentences repeating historical automated rubric endorsements have been removed; their original JSON is archived, and their exact-head source findings, request-changes conclusions and evidence remain. Actual automated review comments were not edited. No queue, auto-merge or merge action has been taken.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Independently reviewed the new findings from configured review 2371 against the published source 7c2452ab70a81e0d607ed8ed54dba80ead1d5bbb. Its four core rubrics pass; the advisory quality result identifies two concrete maintenance families that I also find need repair.

  • In Step1ZeroDividerAnchorPE.helper_exitBoundary_285 (line 27), the result is the existing ClosedColorExitPathBoundaryEdge instantiated at base.core; the non-PE branch already calls that theorem at lines 836/839. Reuse it. The PE/non-PE helper_componentOutside_422/_548 proofs should likewise call one confinement fact over the actual tree and two closed colors. Their hierarchy packaging does not change the graph argument.
  • HierarchyCounterexamplePenultimateElementary.helper_branch_111 and _216 repeat the same predecessor-tree elementarity calculation, including CertifiedETTRestriction ... (ett.rounds - 1). Share that calculation using the actual maximum/lower-round and index hypotheses, retaining the distinct SE selected-color and RE identity-color transports afterward.
  • ChangeLemmaMixedClosedFinal.helper_replacement_855 and ChangeLemmaMixedLargestClosed.helper_replacement_1032 contain a byte-identical 62-line nonparallel construction (lines 1109–1170 / 2306–2367). Share the correspondence-to-base/hierarchy construction and call it from both branches. Preserve the actual support-position cast and HB.dividerCount, HB.stage, and HB.dividerPosition: later SameHierarchyStages and gamma/goodness consumers depend on these data. The parallel closure-containment and later index-dependent arguments retain real differences. A proof-irrelevance shortcut would not establish the required data agreement.
  • The three revisiting projection/agreement helpers in TdTerminalRERebuild (5482/5518/5660) expose the large contracts in RevisitingTerminalStatements and forward return-walk/cycle/crossing assumptions at their callers. Yet the penultimate-tree calculation is castSeriesTree, hextendedData, append projection, and hreplacementCurrentTree; the data/tree agreements additionally use the corresponding actual prefix/field agreements. Extract those facts over their real series, rounds and field equalities and narrow the callers. The final-tree/final-color calculations in TerminalSeriesRebuildTransport (817–824 / 3597–3604 and 914–922 / 3695–3703) are also literal copies under larger construction contexts. Keep certificate validity at the construction boundary where it is needed, and preserve the seven existing public contracts as compatibility wrappers while routing downstream callers through the narrower shared facts.

These copies can drift independently when a transport or reconstruction changes, and the oversized projection contracts force unrelated construction details through every caller. The requested repair is shared proofs and smaller real interfaces, preserving the original mathematical contracts and selected hierarchy data. This scoped inspection found no mathematical counterexample.

The author's new source-review/repair update is consistent with this diagnosis; final source custody remains with that repair work. My two earlier outstanding proof-sharing requests also remain. The current core Lean workflow has passed, while the required minimal-file check was still pending at the inspected cut. This review grants neither full-CI nor merge acceptance.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Filename/LOC advisory resolution for exact head b2910bf5f87c1a28477584ae35646d2adb0e2d30 (run42257660493).

The advisory completed successfully with16heuristic flags. Every flagged upstream endpoint remains present under its recorded name mapping and rechecks against its original theorem contract. All506original theorem contracts pass on the identical797source hashes. Proof splitting, descriptive renames and shared facts explain the filename/LOC differences; file counts alone are not completeness evidence.

Upstream file Current module Original-contract batch
Tablet/P2971_T1_PositivePrefixNoRevisiting.lean LeanPool.GoldbergSeymour.PositivePrefixNoRevisiting Batch09.lean
Tablet/P2968_T2_ScheideOrderNineBlockCompletion.lean LeanPool.GoldbergSeymour.ScheideOrderNineBlockCompletion Batch09.lean
Tablet/P2940_T1_OneDividerRefresh.lean LeanPool.GoldbergSeymour.OneDividerRefresh Batch09.lean
Tablet/P2813_T1_BaseControl.lean LeanPool.GoldbergSeymour.BaseControl Batch08.lean
Tablet/P2940_T1_StarredPrefixPreparation.lean LeanPool.GoldbergSeymour.StarredPrefixPreparation Batch09.lean
Tablet/P2905_T2_AbsentOwnerReplacement.lean LeanPool.GoldbergSeymour.AbsentOwnerReplacement Batch08.lean
Tablet/P2880_T1_OutsidePrefixBranch.lean LeanPool.GoldbergSeymour.OutsidePrefixBranch Batch08.lean
Tablet/P2905_T2_LateOwnerReplacement.lean LeanPool.GoldbergSeymour.LateOwnerReplacement Batch09.lean
Tablet/ExtensionBase.lean LeanPool.GoldbergSeymour.ExtensionBase Batch02.lean
Tablet/TdTerminalSEPERebuild.lean LeanPool.GoldbergSeymour.TdTerminalSEPERebuild Batch16.lean
Tablet/HierarchySituationTwoSubcaseThreeOne.lean LeanPool.GoldbergSeymour.HierarchySituationTwoSubcaseThreeOne Batch06.lean
Tablet/HierarchySituationThreeEligibleIndexBound.lean LeanPool.GoldbergSeymour.HierarchySituationThreeEligibleIndexBound Batch05.lean
Tablet/HierarchySituationTwoCaseThreeNormalization.lean LeanPool.GoldbergSeymour.HierarchySituationTwoCaseThreeNormalization Batch05.lean
Tablet/StableChangeCaseThree.lean LeanPool.GoldbergSeymour.StableChangeCaseThree Batch13.lean
Tablet/ChangeLemmaBothOutside.lean LeanPool.GoldbergSeymour.ChangeLemmaBothOutside Batch01.lean
Tablet/Step1ZeroDividerAnchorNonPE.lean LeanPool.GoldbergSeymour.Step1ZeroDividerAnchorNonPE Batch14.lean

The required Lean and minimal-file workflows remain independent checks. No queue or merge action has been taken.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

/review

Please review exact current head b2910bf5f87c1a28477584ae35646d2adb0e2d30 under all five configured rubrics. The PR description records the upstream source, license, scope, local checks and the completed current-head clean measurement. Current-head CI remains an independent requirement.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Reviewed the published source at b2910bf5f87c1a28477584ae35646d2adb0e2d30, including all 17 changed/new files, the four new shared APIs, their actual consumers, and the unchanged sites of my earlier requests.

The repairs to the two maintenance families in my preceding review are favorable. The component-confinement and penultimate-elementarity proofs now use their actual graph/closed-color or maximum/lower-round hypotheses. StableHierarchyReplacement shares the construction while preserving the support-position cast, hierarchy stages/dividers and the gamma/goodness data used afterward. The cast/prefix APIs preserve the seven old mathematical conclusions from the same inputs and keep certification at the construction boundary. The retired plumbing names are not externally name-compatible wrappers; their current callers use the more general facts, and this inspection found no lost upstream declaration or mathematical counterexample.

Two earlier proof-sharing requests remain at this exact head:

  • Share the nonparallel interchangeability argument in BaseControl.helper_nonPEInter_586 (line 476), ChangeLemmaMixedClosedFinal.helper_branch_399 (492), and ChangeLemmaMixedLargestClosed.helper_branch_568 (1402). These complete proof copies remain unchanged and are still called at 1169, 1093 and 3040 respectively. The new hierarchy-replacement factory addresses a different construction.
  • Share the two boundary-return orientations in ScheideSymmetricOriginalBoundaryAvoidance.helper_hreturn_one_242 / helper_hreturn_two_319 (110/242), retaining their actual orientation and return hypotheses. Both proofs and their calls at 833/837 remain unchanged.

The 16 completeness-advisory flags still establish no concrete omission: the named endpoints and their current import routes are present. This is bounded source inspection, not an independent kernel equivalence check of all 506 claimed original theorem contracts or a line-by-line review of all 797 modules.

The description now correctly distinguishes the historical 606e50e89 measurement from both 7c2452ab70 observations. The new published clean result is 1677.046s wall / 2433.007s user CPU / 3,428,496KiB maximum child RSS; the reported 10 module pairs have lower wall/user/RSS observations in 4/7/9 cases. These shared-host observations warrant the author's ongoing parent-control investigation but do not establish a causal speedup or slowdown. I have not inspected private measurement or local-validation receipts.

The new source is bound to the actual CI checkout 516a0ac6 and its complete Plan; full current-head CI and the fresh configured review remain pending. No result from the previous head is substituted. Please complete the two remaining source-sharing repairs under the existing author custody; this review does not grant queue or merge acceptance.

@Vilin97

Vilin97 commented Nov 6, 2026

Copy link
Copy Markdown
Collaborator Author

Separate source review of b2910bf5f87c1a28477584ae35646d2adb0e2d30: request changes.

Direct source inspection confirms four engineering families requiring repair:

  • The path-number prefix bound repeats the same finite minimum-candidate and index-transport proof in MixedLargestClosed, BothOutside/Preparation1, and SharedFacts/MixedChangeTransport/Preparation2. It needs one theorem over the actual trees and hierarchies, with direct consumers.
  • The PE/non-PE anchor finishes repeat a missing-color neighbor proof already in TwoColorMissingVertexNeighborsSubsingleton, followed by the same three-leaf component argument. OneAdditionPositiveDividerImpossible repeats the neighbor fact too. The existing fact and one shared component contradiction should replace these copies; the PE-specific interchangeability construction stays in its caller.
  • FixedRootRefresh carries original-base and GoodHierarchy inputs through six helpers that only use hierarchy count/field agreements. The neighboring initial-segment calculation should use the existing transitivity theorem. Interfaces and callers need narrowing.
  • SE/PE continuations introduce unused stored/edge/kind cast callbacks and dead raw-index/final witnesses. Other terminal reconstruction blocks retain parallel cast/projection scaffolding. These should use canonical round casts and field projection facts, with dead premises, witnesses and caller constructions removed.

The complete hosted Lean validation42257660581 succeeds, and all11local phases, the complete zero-diagnostic root/public build,506original theorem contracts, source inventories and measurements are preserved for this exact head. The independent required minimal-file check remains in progress. These checks do not resolve the maintenance findings.

All797source files are frozen before the next repair. The primary current-head measurement and all paired profiles are retained, along with a byte-verified contemporaneous parent control. Eleven targeted before-profile baselines cover the next repair: seven observations from the identical complete source state and four fresh executions. Every regression remains recorded. A scratch-only record-assembly experiment failed compilation and was not applied.

Main has separately advanced to49bdad2b2 with warningAsError=true. Its policy changes have been read, its Lean validation is pending, and the author branch has not been updated merely to follow main. Source repairs will receive fresh current-head checks, measurements and reviews. No queue or merge action has been taken.

@Vilin97 Vilin97 left a comment

Copy link
Copy Markdown
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I independently checked the four quality findings in configured review2372 against the published source at b2910bf5f87c1a28477584ae35646d2adb0e2d30, including their actual callers. All four identify bounded maintenance repairs; none establishes a mathematical counterexample.

  • Path-number restriction: ChangeLemmaMixedLargestClosed.helper_pathLe_1383 (2871), ChangeLemmaBothOutside/Preparation1.helper_pathLe_1004 (1571), and SharedFacts/MixedChangeTransport/Preparation2.pathLengthUpperBound (724) repeat the same finite-candidate minimum argument and index transports. Extract one prefix-monotonicity fact over the actual trees/hierarchies and redirect all three entry points. Keep the real initial-segment, last-star equality and length hypotheses; the separate lexicographic/minimal-counterexample argument remains in the callers.
  • Missing-neighbor and component arguments: reuse TwoColorMissingVertexNeighborsSubsingleton in the two Step1ZeroDividerAnchor* finish proofs and HierarchyCounterexampleOneAdditionPositiveDividerImpossible.helper_missingLeaf_1742. The existing theorem needs proper coloring and the missing-color disjunction, without those construction-specific premises. Share the subsequent three-distinct-leaves/two-endpoints component contradiction between the anchors. Preserve the actual tree membership, exit paths and interchangeability; the PE-specific derivation of interchangeability stays with its real maximum/lower-round/stability hypotheses.
  • Fixed-root interfaces: narrow the six private helpers in AlgorithmFiveSixFixedRootRefresh (helper_hcarry_334, helper_hprecedingV_354, helper_hstarV_360, helper_hnewStoredV_366, helper_branch_397, helper_branch_404). Their introduced original base and good arguments are unused afterward. Keep the actual hierarchies, count equalities, field agreements and Fin transports. The caller's goodV/goodW gamma data are still used and must remain. The adjacent initial-segment proof can use TreeSequenceInitialSegment.trans.
  • Terminal cast scaffolding: TdTerminalSEPERebuild.helper_continuation_1015 and helper_continuation_1218 only introduce castSeriesStored/Edges/Kind, while their callers still construct and pass all three. Narrow the private Conditions and applications together, then remove the orphan constructions and unused raw-index/final-color/final-tree witnesses. Use the canonical cast/projection facts for the remaining adapters. In the RE and other transport adapters, some callbacks and final witnesses are actually passed onward: canonicalize their downstream interfaces before removing them. Preserve the distinct SE/PE/RE branch metadata, replacement input, prefix agreement and stability.

These four groups are separate from the two outstanding groups in my preceding review: the nonparallel-interchangeability copies in BaseControl/MixedClosed/MixedLargest, and the two boundary-return orientations. There are therefore six outstanding source-repair groups at this head. Subsidiary neighbor reuse/transitivity/dead-witness steps are included in the four groups above, rather than counted again.

The factory, certification and same-input cast conclusions accepted in my preceding review remain favorable. This update concerns current proof organization and interfaces; it does not reopen those repaired facts or claim a full independent kernel comparison of all imported theorem contracts.

The official five-rubric report is complete at this exact head, despite the description's older “running” wording. Its advisory score is not a separate human-policy gate. The author's published acknowledgment retains repair custody; please publish the bounded repairs and validate the resulting head. Current CI and protected integration remain independent requirements.

This branch has not been deployed

No deployments
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant