Skip to content

refactor: #70 — dissolve CaiGovorov/SimpleOrbitRank into Lovasz + fill legacy sorries (Lovász sorry-free, axiom-clean) #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
cameronfreer wants to merge 8 commits into
base: master
Choose a base branch
from
Open

refactor: #70 — dissolve CaiGovorov/SimpleOrbitRank into Lovasz + fill legacy sorries (Lovász sorry-free, axiom-clean) #3

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
8 commits
Select commit Hold shift + click to select a range
94305b2
refactor: #70 — R1: move out_pair_eq' upstream into Lovasz; add CaiGo…
cameronfreer Jul 2, 2026
062509c
refactor: #70 — R2: dissolve CaiGovorovOrbit.lean into Lovasz.lean (§…
cameronfreer Jul 2, 2026
07f0193
feat: #70 — R3: FILL tupleEquivSimple_implies_orbit + orbit_separatio…
cameronfreer Jul 2, 2026
dc7f577
refactor: #70 — R4: move submodule block + rank skeleton into Lovasz …
cameronfreer Jul 2, 2026
b6e654c
feat: #70 — R5: FILL toSimple, InTupleSimpleEvalSpan.mul, orbitIndica…
cameronfreer Jul 2, 2026
8311c18
feat: #70 — F3: FILL private Lemma 2.4 tupleEquiv_implies_tupleOrbitR…
cameronfreer Jul 2, 2026
3cb5a9b
feat: #70/#86 — F3: FILL the three multigraph descents; Lovász has ZE…
cameronfreer Jul 2, 2026
68ac1c1
feat: #70 — F3: CLOSE the σ-sum parallel-edge frontier Dtr.eval_tuple…
cameronfreer Jul 2, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 1 addition & 5 deletions Graphon.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,8 +22,6 @@ import Graphon.Lovasz
import Graphon.SimpleRank
import Graphon.CycleKrylov
import Graphon.MatrixDetermination
import Graphon.CaiGovorovOrbit
import Graphon.SimpleOrbitRank
import Graphon.InverseCounting
import Graphon.Convergence

Expand All @@ -46,12 +44,10 @@ in Lean 4 using Mathlib.
* `Graphon.Counting` — Homomorphism density, counting lemma
* `Graphon.Compactness` — Total boundedness, completeness
* `Graphon.CaiGovorov` — Graph-free Vandermonde argument (Cai–Govorov §4), for #70 orbit separation
* `Graphon.Lovasz` — Connection-matrix algebra scaffolding (Lovász §3)
* `Graphon.Lovasz` — Connection-matrix algebra scaffolding (Lovász §3), incl. the Cai–Govorov #70 orbit theorem and rank theorem
* `Graphon.SimpleRank` — K=1 simple-graph rank theorem, algebra-atom framing (#70)
* `Graphon.CycleKrylov` — spectral slice of the cycle–Krylov square-moment proof (#70)
* `Graphon.MatrixDetermination` — Algebraic determination of step graphons
* `Graphon.CaiGovorovOrbit` — Cai–Govorov test graphs, super-surjective orbit theorem, eq. (10) (#70)
* `Graphon.SimpleOrbitRank` — #70 rank theorem: simple-eval span = orbit-invariant functions
* `Graphon.InverseCounting` — Inverse counting lemma, convergence equivalence
* `Graphon.Convergence` — Top-level convergence characterization

Expand Down
Loading
Loading