MathRSI · Research Case

Property B

Stronger lower bounds, reusable proof methods

Source: case-studies/property-b/README.md SHA256: fdc959e233b6 Rendered: 2026-11-02 06:44 UTC

Property B: stronger lower bounds, reusable proof methods

Individual bounds for k = 5–12, a uniform theorem for every k ≥ 12, and the research experience behind MathRSI's Property B plugin.

Let m(k) be the minimum number of edges in a finite simple k-uniform hypergraph that admits no red/blue vertex coloring in which every edge contains both colors. This case studies lower bounds for this classical hypergraph two-coloring problem.

These studies were carried out with ARIS. Their proofs, failed routes, verification practices, and accumulated wiki were then distilled into MathRSI's workflows and Property B plugin. New tasks will evaluate MathRSI v1 itself.

Property B: individual and uniform lower-bound improvements, with separate axes and verification scopes

The red points show individual improvements over the specified reference values; the blue curve shows a certified lower estimate of the uniform theorem's gain. The purple points evaluate our stronger criterion C.2 at particular parameters. Axis definitions and full baseline citations are in the complete reader below.

Read the results

Clone or download the repository and open index.html locally. GitHub displays HTML source rather than hosting these pages as a website. The case overview is in English; the full mathematical readers are in Chinese, with offline SVG formulas and figures.

A uniform improvement for every k ≥ 12

B_RS(k) is the maximum positive integer edge budget accepted by an explicit combination of the Radhakrishnan–Srinivasan positive-association estimate and exact single-overlap integral. This combined budget is defined in our proof; it is not a separately named theorem in the original paper. The complete reader identifies the original claims and their use.

For every integer k ≥ 12, define

Δ(k) = floor( sqrt(B_RS(k)) / (8 (1 + ln k)) ) ≥ 2.

Every finite simple k-uniform hypergraph with at most B_RS(k) + Δ(k) edges has Property B. Therefore

m(k) ≥ B_RS(k) + Δ(k) + 1,    for every k ≥ 12.

The theorem has an analytic proof and end-to-end Lean formalization. The formal statement starts from an arbitrary finite vertex type and the original edge set; it returns a Boolean coloring with both colors in every edge. The maximal budget, structural reductions, and probability criterion are proved internally. The audited transitive axioms are propext, Classical.choice, and Quot.sound.

Start with Twelve.lean, the independent original-statement restatement ReviewAuditGeneralGrowth12.lean, and the recorded verification. The C.2 numerical evaluations and comparison theorems D/E have their own evidence; they are outside this Lean export's scope.

Individual results and their evidence

The reference values below match the comparison figure, including a common RS baseline from k = 12. They are specified comparison points, rather than a survey of every current record. Here the gain is L_new − L_ref; for the uniform theorem, L_ref = B_RS + 1 and the gain is Δ.

kReference L_refReported lower bound L_newGainProof and verification scope
53235+3Complete natural-language candidate and local certificates; full Lean for 35 remains unfinished. The earlier bounds 33 and 34 have complete Lean proofs.
66467+3Complete computer-assisted proof, independent exact arithmetic for all used branches, and Grok/Gemini static final reviews; no Lean for this parameter.
7128131+3Complete candidate and full independent exact replay of 424 types; no parameter-specific cross-family final review or Lean.
8263267+4Complete computer-assisted proof, independent exact replay of all 2,094 types and separate quota checks, and Grok/Gemini static final reviews; no Lean.
9538543+5Complete computer-assisted proof, independent exact replay of all 3,450 types and decision-tree coverage, and Grok/Gemini static final reviews; no Lean.
1010851112+27Collaborator proof and certificates; documented original-table replays and a separate tight-case exact check; no Lean.
1122452275+30Collaborator proof and certificates; documented original-table replays and a separate tight-case exact check; no Lean.
1246334664+31All 664,355 author parameter instances pass; independent complete parameter/trace coverage and 20 exact probability checks. This is not a second full-table probability implementation; no Lean for this individual bound.

The small-parameter evidence guide records each scope. Model reviews cited here were static mathematical/source reviews, not executions of the arithmetic programs or Lean.

What changed the research

Connect every local computation to the original hypergraph. A table of strict rational bounds becomes useful only after an arbitrary original input has been reduced to its actual local data, the classification is proved exhaustive, and the result returns a coloring of that same input. This connection became the central proof obligation, rather than treating a successful table as the theorem.

Use constraints shared by the same object. Several locally worst configurations cannot coexist in one hypergraph. Shared bad pairs, degree budgets, and repair capacities strengthened the small-parameter arguments. For general k, a clique bound on the actual single-overlap graph reduced the bad-pair count inside the same RS probability witness. The general-k tools give the precise statements and callers.

Reconsider the representation when local progress stops helping. During the still-open m(5) ≥ 36 investigation, changing from positional lock bounds to a labeled-swap count produced a whole small-vertex result. It did not solve the full problem. The recorded remaining obligations preserved that distinction, and the accumulated structural tools subsequently supported the general-k work. The actual research transitions retain the detailed examples.

Test a real Lean caller before scaling certificates. One nontrivial branch was connected from the actual hypergraph through multiplicities and quotas to its coloring conclusion before expanding the formal tables. This exposed interface requirements early. The final audit then named the new main module explicitly and restated the theorem in the original vocabulary.

How this experience enters MathRSI

SubworkflowPractice distilled from the research
PrepareSearch problem aliases, citations, counterexamples and errata; read the primary theorem before importing its assumptions or defining a comparison baseline.
Route iterationChallenge candidate routes across models, run informative probes, and revisit the global obstruction when local refinements stop reducing it.
ProveCombine derivation, proof writing and bounded parallel work; immediately connect returned lemmas and certificates to their actual callers.
VerifySeparate coverage from arithmetic, use independent exact or rigorously rounded calculations, repair real gaps, and audit the original statement when Lean is used.
HandoffDeliver the full readable proof and reproducible evidence; preserve useful conditional lemmas, failed-route boundaries, and precise resumption notes in the wiki.

The Property B plugin supplies the domain methods at these stages: a 117-item lemma inventory, failure map, computation lessons, and Lean practice, with links to the original evidence.

Inspect or reproduce

The pages need no network or math renderer. Their local links can be checked from a clone:

python3 tools/check_links.py
python3 case-studies/property-b/tools/package_readers.py --check

For Lean, install elan and use the archived lean-toolchain and lake-manifest.json. From the clone root, copy the formal project to a separate build directory; the archive remains a source snapshot:

propertyb_replay_dir=$(mktemp -d)
cp -R plugins/propertyb/knowledge/archive/formal "$propertyb_replay_dir/formal"
cd "$propertyb_replay_dir/formal"

# Uniform theorem for every k >= 12 and original-statement audit
lake build Aris4Math.General.Growth.Twelve
lake env lean ReviewAuditGeneralGrowth12.lean

# Earlier five-uniform bound m(5) >= 34 and original-statement audit
lake build Aris4Math.ThirtyThree.Main
lake env lean ReviewAudit33.lean

A bare lake build targets the older five-uniform theorem. Toolchains, downloaded dependencies and compilation caches are not bundled. The case preserves the original build records; this publication did not run a new Lean build. For arithmetic replay, start with the plugin's checker capabilities and runnable examples, whose input and coverage requirements are explicit.

The six promoted readers retain their complete content, formulas and figures; only local links were adapted. Their direct dependencies are included or reuse the existing archive. Historical documents beyond those direct links retain their source context. See packaging and display checks for the exact publication checks and reader provenance for the archive boundary.

MathRSI · GitHub ↗