六元超图的 Property B:m(6) ≥ 67
任意有限简单六元超图,至多 66 条边必可二染色
目录 · 九节正文与分支证明
完整计算机辅助证明 · 独立数值复算 · 尚未 Lean
六元超图的 Property B 下界:
1. 原命题与证明结构
定义1.1。 有限简单六元超图是二元组
目标命题T67。 每个有限简单六元超图若满足
证明性质。 本文给出覆盖任意有限简单六元超图的计算机辅助证明。选点、度数分流与概率充分条件均有数学证明;有限计算仅用于完整局部迹类型的精确有理不等式,全部实际使用域另有独立重建与概率复算。本文尚无 Lean 形式化。数学与数值证据分别列于第9节,最终审阅另见审计记录。
定义1.2。 记
主定理1.3。 任意有限简单六元超图,若边数至多66,则具有 Property B。因此
证明先将假定反例归约为27–44点、恰66边的点对覆盖超图,再用第6、7节逐支建立全部
全文记
下文的点对覆盖、度数及锁点条件都在同一个实际反例内部推出,不作为原目标的附加条件。
2. 从任意原始反例到27–44点
引理2.1。 若T67为假,则存在一个不具有 Property B 的简单六元超图,满足
证明。 在边数至多66的所有反例中选顶点数最少者。若不同点
对每个点求共度和,得到
进而
当
完整十六个整数的精确值如下;每行同时适用于所列两个点数。
| 11,12 | |
| 13,14 | |
| 15,16 | |
| 17,18 | |
| 19,20 | |
| 21,22 | |
| 23,24 | |
| 25,26 |
各值小于一,故并集界给出没有单色边的染色,排除这些点数。上述直接有理计算由 base_domain_check.py 独立执行并保存在 BASE_DOMAIN_CHECK.json。
此时
3. 原染色算法及可计算的严格充分条件
本节复用并重述 六元66下界证明 第3节的机制;该机制本身不依赖总边数65。此处所有边重数之和一律为66。
定义3.1。 固定不同实际锁点
引理3.2(失败见证)。 按给定排列初始全部染红,依次处理顶点;当前点若是一条当前全红边的最后点,便改蓝。最终没有红色单色边。若存在蓝色单色边,则有不同原边
证明。 最终全红边的最后点在处理时必会改蓝,矛盾。若
定义3.3。 在位置
自由位置上的精确公式为
分别要求
要求
若
要求
要求
这些公式按“固定共同点占位,再放前方及后方互不相同顶点”的条件抽样直接得到,完整推导见所引第3节引理3.2。定义
引理3.4。 若锁点位置有合法非负扣除量
特别地,
证明。 位置
4. 同一实际坏对的三种扣除
引理4.1(链接配额及共同向量)。 固定锁
因为每点重数
令
其目标权为
证明。 实际向量同时满足全部容量与下界,所以其目标不小于共同最小值,也不小于每个单项最小值及其最大值。不同
引理4.2(组件加强)。 对
分量支撑至少
证明。 第一独立数界由随机排列独立集期望及Cauchy–Schwarz得到。第二界固定一棵生成树,删除至多
不同相交分量的支撑互不相交。设
给出至多
是合法相交对下界,可用于引理4.1中的每个实际避锁池。递推按一个实际分量归纳即证明;允许没有实现图的参数只会使下界更弱。完整证明与输入表分别见 small31_33/REPORT.md 和 CERTIFICATE.json,独立组件及配额核查见 independent31_33/REVIEW.md。
5. 实际选锁与迹覆盖工具
引理5.1(整数低度单位锁)。 令
若
证明。 在
分母为正,独立数为整数,故至少
本稿尾部调用为
引理5.2(实际最小邻点)。 取实际最小度点
令
证明。 第一实际单位池大小
引理5.3(指定单位边的弱楔)。 若实际
则有
证明。 若不存在,记
交换
引理5.4(三锁扩第四锁)。 对三个实际锁
若
其中
证明。 向外共度超额总和正是
引理5.5(实际迹分类)。 固定实际锁集及其全部点对的共度。每条至少含两锁的原边诱导一个锁子集块
全部非负整数解覆盖全部实际多锁迹;单锁迹由实际度数减去多锁贡献,空迹由66减去非空总数。扩锁时必须把新多重块限制到旧锁集后,恢复旧的完整多重块集。
证明。 每个实际点对恰被其共度条原边包含,故给上述等式;后两项由度数及边数定义给出。按剩余点对容量递归枚举允许团块,终点为零容量,按总剩余容量归纳覆盖每个非负解。共度全一时这是
6. 二十七至三十三点及三十六至四十四点
6.1 二十七至三十点:零锁
引理6.1。
证明。 记
第一步用不同六元边交至多五;最后一步用
四项完整精确结果为
| 27 | 64 | 4162 | |
| 28 | 62 | 4166 | |
| 29 | 59 | 4172 | |
| 30 | 56 | 4178 |
均严格小于一。新独立短程序及全部结果见 BASE_DOMAIN_CHECK.json。引理3.4产生原染色。∎
6.2 三十一至三十三点
引理6.2。
证明。 全文实际选点证明、每个完整度数区间及迹式见 small31_33/REPORT.md,本文说明覆盖接口。
31点实际最小度为6–12。6–11用一锁;最小度12时至少七名十二度点,固定其中一人,其余六人若共度均至少七就消耗至少36共度超额,超过实际30,故选十二度二锁且共度1–6。全部十二型严格。
32点最小度7–11按引理5.2选实际单位伙伴,全35型严格。最小度12时有至少20名十二度点;若有其中单位对直接用通过型,若有十二度点到十四至二十四度的单位伙伴,也用通过型。否则这些低点的全部单位邻点都是十三度,至多12人。若没有十三度中心、十二度端点且端点共度至多二的单位楔,单位二部图每条边
33点最小度7–12按引理5.2选最低度单位伙伴;除
完整143型保存在 CERTIFICATE.json,最大
6.3 三十六至三十八点
引理6.3。
证明。 完整证明见 PROOF36_38.md。36点最小度7–9用引理5.2,全部到严格二锁或三锁。最小度10时实际度至多12的点集至少24人;最低度点可选此集中一名单位伙伴,其度和至多22,满足引理5.3的
37、38点实际最小度均为8–10。引理5.2完整覆盖分别九、六个最低度/伙伴分支,所有所需共同池均正。已严格类型直接结束;余15及12个实际三锁迹用引理5.4扩成1452及855个四锁型,保留每个父迹,全部严格。
独立审阅及重放核对真实选点和完整域,并以独立注入概率、独立单项最大扣除/共同覆盖动态规划实际验证全部5604条保留与冗余通过行。36、37、38点整支最大界分别为
6.4 三十九至四十一点
引理6.4。
证明。 39点由引理5.1取三名度在8–10的单位锁。对其度和
40、41点由引理5.1分别取四、五名度在8–10的单位锁,原完整型数90、672。40点只需排除
41点只需排除度和
余下89、652型全部严格;独立复算最大值分别
6.5 四十二至四十四点
引理6.5。
证明。 最低度均为九。九度点至少有
42点若初选五锁全在边
43、44点在九名单位锁中,若无边含其中至少四点,任取五点即可;否则取一条含四至六名锁的边
完整32种五锁团划分中,42点保留31型;43、44点分别保留26型。全部83型严格,其最大值分别为
完整结构证明与原证书在 原诊断证明包 的新引理二;实际输入和独立注入复算保存在 TAIL_ARITHMETIC.json。因此三支全部到引理3.4。∎
7. 三十四、三十五点的完整结构分流
7.1 三十四点
引理7.1。
证明。 实际最小度只能为7–11。最小度7、8时引理5.2给伙伴范围分别为7–12、8–12,全部11个二锁输入由旧组件配额加共同整数扣除严格通过;独立重放保留原来的两项组件界及实际标签,没有换用未说明的概率公式。
最小度九。 固定九度点
矛盾。故有该边外的单位邻点
若
至少六名与
最小度十。 若有两名十度点,其共度为1–10;全部十种双锁型严格。故只需唯一十度点
选其中两名。三个点度数为
最小度十一。 总超额
若某
只对正度边求倒数和,得到
最后一步用
固定一名十二度外点,其十二条边将12名
三十四点全部最小度合计87个必要型,独立覆盖与精确重放见 independent34_min10/REVIEW.md、34_min9/CHECK.json 及 independent_new_branches/REVIEW.md。每个实际输入均到引理3.4,故
7.2 三十五点
引理7.2。
证明。 最小度同样为7–11。最小度7、8按引理5.2的完整二/三锁域处理,全部严格。下面覆盖其余三支。
最小度九。 固定九度点
令
若这些
当
最小度十。 以下三个完整数值域全部严格,见 PROOF35_MIN10.md 与 CERT35_MIN10.json:
- 两名十度点共度一时,存在实际第三共同单位点,其度数10–56;非负迹将两种三锁域分别限制为10–49、10–48,共79型。
- 十度点有两名十一度单位邻点时,剩余共度1–11、三重交0/1,非负迹留下21型。
- 十二度中心连接两名十度点,中心两臂单位、端点共度二,三重交0/1两型。
反设当前实际超图不可二染。前两个数值域意味着:每名十度点都没有十度单位邻点,且至多一名十一度单位邻点。固定十度点
若它们都至少十一度,总超额将至少
令
矛盾。因此有实际十二度共同单位中心,落在第三数值域,其两界为
最小度十一。 至少24名十一度点,因为其余点至少十二度而总度396。取其中一名
所得三名十一度点的点对共度全一或恰一个二,三重交0/1,带标签共八型,全部严格,最大
全部实际最小度现已覆盖,每支均通过引理3.4得到原超图染色,所以
8. 主定理与原染色
主定理1.3的证明。 若原命题为假,引理2.1给同一个实际简单、点对覆盖、恰66边反例,点数在27–44。引理6.1–6.5及7.1–7.2覆盖这一完整区间,并各自给出合法染色,矛盾。各概率分支的成功排列对当前全部66条边都合法,因此也染好补边前的原边;点对识别只用于最小反例归约。故任意有限简单六元、至多66边超图具有 Property B,亦即
9. 证据及范围
| 原始归约分支 | 完整证明/域 | 实际独立复算 |
|---|---|---|
| 本稿第2、6.1节 | BASE_DOMAIN_CHECK.json,完整16+4项新精确算术 | |
| 31–33 | small31_33/REPORT.md | independent31_33/CHECK.json,143型及125项配额 |
| 36–38 | mid34_38/PROOF36_38.md | independent36_38/RESULTS.json,完整必要域及5604行 |
| 39 | tail39_41/PROOF39.md | independent39/CHECK.json,全部999型 |
| 40–41 | tail39_41/PROOF40_41.md | root/INDEPENDENT40_41.json,完整762型、结构排除21型、余741行 |
| 42–44 | 原诊断证明包 | TAIL_ARITHMETIC.json,全部83型 |
| 34 | 第7.1节及三个完整最小度证明 | 87型完整覆盖与独立复算,见上述逐支报告 |
| 35 | 第7.2节及三个完整最小度证明 | 完整原参数域与最终配置,见 独立审阅 |
“独立”指本地不同实现及覆盖重建,不表示第二台机器或Lean内核认证。跨家族静态审阅的实际范围单列于 审阅处置。组件配额的作者与独核角色分别记录于具体报告,不把作者自审当独审。本总稿不替代各证书的精确行,也不把旧参数、试算菜单失败或历史说明写入最终数学假设。
分支证明全文
下列附录在本页内收入各实际分支的完整证明,不需跳转 Markdown 才能阅读。附录保留各稿形成时的状态说明;当前完整原题与验收范围以本卷首部及正文第9节为准。
A1 · 31–33点:完整分流与组件配额
A1 · M66: complete 31/32/33-point branches
The original target remains all finite simple six-uniform hypergraphs with at most 66 edges. The imported minimal-counterexample reduction gives pair-cover, exactly 66 edges, total degree 396 and minimum degree at least ceil((v−1)/5). This report establishes the complete v31, v32 and v33 branches. It does not claim the global target.
The probability engine is imported from propertyB_small_k/propertyB_m6_certificate.py, with its module constant explicitly reset to M=66. This is exact local finite verification, not an independent probability implementation. certificate.py generates every actual local type used below, together with its successful layout and exact upper bound. CERTIFICATE.json records the result. Root must independently verify this candidate and integrate it with the complete object domain.
A1 · Lemma 1: a stronger link bad-pair quota
Let F be a family of f distinct five-element sets on at most N points. Let G have these sets as vertices, adjacency meaning nonempty intersection, and q edges. Different connected components of G have disjoint supports.
For one component with t vertices and e edges, where t−1≤e≤C(t,2), define
Its independence number is at least a(t,e). The first term follows from the random-order independent-set expectation and Cauchy–Schwarz. For the second, fix a spanning tree. There are r=e−t+1 edges outside it. Delete at most one endpoint for each such edge, a total of at most r vertices. The remaining induced graph is a forest on at least t−r vertices, whose larger bipartition class is an independent set of size at least ceil((t−r)/2)=ceil((2t−e−1)/2). If this expression is nonpositive it is harmless.
Disjoint five-sets from an independent set imply component support at least 5a(t,e). A component with t≥2 also has support at least six, because its five-sets are distinct. A further valid strengthening is support at least eleven if
Indeed, if the component support had at most ten points, any five-set would have at most one distinct disjoint partner: on fewer than ten points there is none, and on exactly ten points the only possible partner is its complement. Thus the nonedge graph would have maximum degree at most one and at most floor(t/2) edges, contradicting the displayed condition.
Write u(1,0)=5. For t≥2 let u(t,e) be the maximum of 6, 5a(t,e), and eleven when the last condition holds. Define recursively
Then the union of F has at least S(f,q) points. To prove this, select an actual component (t,e), apply its valid support bound, and apply induction to the remaining actual components, whose supports are disjoint. The recurrence permits component parameters without a realizing graph; this only lowers S, hence preserves its necessary-bound direction. It also permits unused budget q, as needed for an at-most-q assertion.
Consequently define
Then F has at least q_*(f,N) intersecting pairs. The implementation starts from the older valid ceiling bound ceil((5f−N)/4), truncated at zero; since that lower bound is valid, this does not skip a possible actual q. Its finite search terminates whenever a family F exists, and all parameter inputs used here admit an accepted relaxed component partition.
Applied to the actual link at a lock vertex, F consists of the original edges containing that vertex with the vertex removed. These five-sets are distinct because the original hypergraph is simple. Their support is at most v−1. Therefore q_*(d,v−1) can replace the old quota in the existing nonnegative capacity/weight deletion argument. For an avoided-lock subfamily the same conclusion uses f equal to its actual number of edges and N=v−1−|R|. The script diagnose.py exports support_min(f,q) and quota(N+1,f) for this purpose.
All three strengthening components above are used by the current candidate. In particular, the final two-point delta11 cases use the feedback-vertex bound and the unique-complement bound. The full table for f=0,…,24 and support N=28,…,32 is in CERTIFICATE.json. No claim of novelty is made for these elementary graph bounds.
A1 · Lemma 2: complete v31 selection
The minimum degree d lies in 6,…,12. For d≤11 choose a vertex of degree d and one lock; the six exact bounds are strict.
If d=12, at least seven vertices have degree exactly twelve: otherwise at least 25 vertices would have degree at least thirteen, forcing total degree at least 31·12+25=397>396. Fix a twelve-degree vertex x among them. Pair-cover gives
If its six other twelve-degree partners all had codegree at least seven, the sum would be at least 36. Thus some second twelve-degree vertex y has 1≤λxy≤6. The complete trace multiplicities are
All six actual types have strict recorded bounds. Wider layouts are essential for λ=3 and λ=4; checking only central adjacent locks had missed these cases. This closes all v31 inputs.
A1 · Lemma 3: complete v32, minimum degree at most eleven
For a minimum-degree vertex x of degree d, there are at least
unit-codegree neighbors. This follows because the sum of λxy−1 is 5d−(v−1), and each nonunit neighbor contributes at least one. Here n>0 for d=7,…,11. If all unit neighbors had degree greater than
the total degree would exceed vd+n(t+1−d)>396. Choose a unit neighbor y with degree e in d,…,t. certificate.py enumerates this entire necessary interval separately for each d, uses the unique two-lock trace, and obtains strict bounds for every such type. This closes v32,d≤11.
A1 · Lemma 4: complete v32, minimum degree twelve
Let R be the twelve-degree vertices. The total excess above twelve is twelve, so |R|≥20. All vertices outside R have degree at most 24. Each r∈R has at least two unit neighbors because its pair-excess is 29 among 31 partners.
If there is a unit pair inside R, its two-lock type (12,12,1) is strict. If there is a unit pair from R to a vertex of degree e∈{14,…,24}, the complete eleven-type two-lock certificate is strict. Hence assume every unit neighbor of every r∈R has degree thirteen. Let B be the set of these neighbors. Since each costs at least one of the twelve excess units, |B|≤12. The unit pairs between R and B form a bipartite graph with every r nonisolated.
Write u_r for r's degree in this bipartite graph and t_b for b's degree. Suppose there is no b-centered wedge r–b–r′ whose endpoint codegree is at most two. Then every such r′ has λrr′≥3. For every edge rb, all t_b−1 other R-neighbors of b are among these partners. Relative to baseline codegree two on all 31 partners of r, exactly u_r unit partners decrease its row sum by one each; the t_b−1 identified partners increase it by at least one each. Thus
so t_b≤u_r−1 and therefore 1/t_b>1/u_r. Summing over all bipartite edges gives
contradicting |B|≤12<20≤|R|. Hence there is an actual wedge with center degree13, endpoints degree12, both center–endpoint codegrees one and endpoint codegree l∈{1,2}.
The triple intersection τ is zero or one. These four complete actual trace types are
where vertex1 is the degree13 center. All four certificate bounds are strict. This closes v32,d12.
A1 · Lemma 5: complete v33 selection
The same actual minimum/unit-partner selection covers d=7,…,12. With the stronger link quota every two-lock type is strict except e14 at d9,d10,d11. In particular d12 is handled directly, and the earlier max-unit-degree wedge idea is unnecessary.
Here take y to be a minimum-degree unit neighbor of the minimum-degree x. If e=d(y)≠14, the corresponding passing type applies. In the exceptional three cases e=14, all unit neighbors of x have degree at least fourteen.
If d=9, x has at least 19 unit neighbors. The total excess above nine is 99. Nineteen vertices of degree at least fourteen cost at least 95 of those excess units; twenty would cost 100, so x has exactly nineteen unit neighbors. Its other thirteen partners are nonunit. Since
every one of those thirteen partners has codegree exactly two with x. The nineteen unit neighbors leave only four excess degree units among the other fourteen vertices (including x), so at least ten vertices have degree nine. Thus another degree9 vertex y exists, is a nonunit partner, and has λxy=2. Its two-lock type has exact upper bound
at positions (16,18). This closes d9 entirely, including the previous failed three-lock λ=3 profiles.
If d=10 or d=11, let n=64−5d, respectively 14 or 9. The total excess above d is 396−33d, and n unit neighbors cost at least n(14−d). The respective remaining slacks are ten or six. Among at least n unit neighbors, therefore at least n−slack have degree exactly fourteen: respectively four or three. This count is still valid if there are more than n unit neighbors: each additional one costs at least 14−d≥3 extra units and cannot reduce the lower bound. More directly, if u≥n actual unit neighbors and h of them have degree above fourteen, then
so the number u−h of degree14 unit neighbors is at least (15−d)u−(396−33d)≥(15−d)n−(396−33d)=n−slack.
Choose two degree14 unit neighbors. Their mutual codegree l ranges from one to fourteen. Their triple intersection τ with x is zero or one; nonnegative single traces require 13−l+τ≥0. The actual trace multiplicities are
For each d=10,11 the complete 27 actual (l,τ) types have strict bounds in the certificate. This closes v33.
A1 · Exact verification and status
certificate.py enumerates every necessary type in these selection branches, without enumeration of original hypergraphs. It records all multiplicities, positions and exact rational upper bounds in CERTIFICATE.json. Every final certificate row is strict. DIAGNOSTIC.json, FOUR.json and the exploratory files preserve failed older menus; those failed menus are not assumptions or components of the final proof.
The arithmetic imports the existing conditional random-greedy probability formulas and replaces only the justified link quota. It is not an independent reimplementation. No Lean, external model review or global m(6)≥67 conclusion is claimed by this local delivery.
A2 · 34点:最小度九
A2 · 34点、最小度九的完整分支证明候选
定理34.9。 设
以下给出覆盖全部实际输入的选点证明,以及全部27个必要局部型的精确证书。主代理提出的选点推导已经独立核查;所有最终布局也已用既有独立下降阶乘注入计数和独立 component DP 完整复算。状态为 same-family / provisional;本文只处理34点最小度九,不单独宣称完整
A2 · 1. 实际单位伙伴的完整分流
引理34.9.1。 可以选定实际九度点
证明。 最小度九保证实际点
当
A2 · 2. 最小单位伙伴为十二时的实际双臂选点
引理34.9.2。 若
证明。 取
点对覆盖给
将
A2 · 3. 最小单位伙伴为十三时的双九度点
引理34.9.3。 若
证明。 全部
两种完整双锁型是
A2 · 4. 精确证书、独立复算与结论
复用 ../small31_33/REPORT.md 引理1和已核 ../independent31_33/REVIEW.md 的 component 支撑界:任何
每个锁处,按精确非负双向权重从低到高填充无序迹型格的实际容量,填至
check.py 先从上述三个选点引理独立重建完整27型,再读取主代理原始试算中的相应实际成功布局;没有导入试算生成器或原概率模块。它使用已经独立审计的下降阶乘注入概率和 bottom-up component 精确边数 DP,自行重建全部迹重数及实际度数/共度边际,并逐项与主代理原二项式概率结果作精确比较。
| 完整分支 | 型数 | 独立复算最大值 |
|---|---|---|
| 3 | 1643881/1654160 | |
| 22 | 156204893/156318120 | |
| 2 | 37169069/37218600 | |
| 合计 | 27 | 156204893/156318120 |
全部27行均与原有理值精确相等,并严格小于一。由引理34.9.1,每个实际超图都落入这三个完整分支之一;引理34.9.2或34.9.3保证所用局部型来自同一实际超图。故每个实际输入均有失败概率严格小于一的合法条件排列,因而存在成功二染色,得定理34.9。
完整实际迹、位置和独立上界保存在 CERTIFICATE.json,核查摘要为 CHECK.json。实际运行约0.126 CPU秒。复现命令:
python3 context/propertyb-m6-67-progress-20261029/34_min9/check.py
原值来源为 ../root/PAIRS_PROBE.json 和 ../root/TWO_ARM_PROBE.json。这些探索文件中的其他失败型不进入本证明;这里并未假设所有三锁型都严格,而是先由实际选点强制三重交为零,再覆盖其全部22型。
A3 · 34点:最小度十
A3 · 34点、实际最小度十的完整分支
命题。 设同一实际有限简单六元超图H有34个顶点、66条边、覆盖每个点对,实际最小度为十,则H具有Property B。
状态。 完整计算机辅助证明候选;40型精确证书已全部严格。概率计算复用原核,尚待独立算术复算。它只关闭34点最小度十分支,不声称整个34点或m(6)≥67已经完成。
使用总证明草稿第3–4节的实际条件排列概率及坏对扣除机制。完整池相交链接配额为已证组件配额q*(f,N);仅三个型需要最大避锁扣除max_R,其余用完整池即可。所有配额对应同一个实际坏对对象,max_R不相加。
A3 · 引理一:重复十度点直接闭合
若有两个不同十度点x,y,实际共度λ在1–10之间。实际二锁迹为
这十种完整实际类型的完整池概率界全部严格,记录在CERTIFICATE.json。所以只需考虑唯一十度点x。此后其余33点度数均至少十一。∎
A3 · 引理二:唯一十度点的低度伙伴
若x有十一度单位共度邻点y,二锁实际型(10,11,1)在位置(16,17)有完整池界
于是该支闭合。否则x的全部实际单位共度邻点度数至少十二。
记这些单位邻点数为u。点对覆盖给
因此非单位邻点至多17人,u≥16。唯一十度点和其余点最低十一度的总基线为373;每个单位邻点还需至少一个度数单位,因此
所有非单位邻点中,至少十名度数恰为十一。证明是:基线外总度超额23,其中单位邻点已经消耗至少u,非单位邻点数为33−u,其中度超过十一的人数至多23−u;相减至少十名十一度点。
在33−u个非单位邻点上,基线共度二已经消耗33−u单位共度超额,剩余只有
所以共度至少三的非单位邻点总数至多七。这十名十一度点中,至少三名与x共度恰二。可选其中两个不同点y,z,满足
全部推导均来自同一实际H,没有把必要整数见证当作可实现超图。∎
A3 · 引理三:全部实际三锁迹严格
令l=λyz,τ为含x,y,z三点的原边数。完整实际区间为1≤l≤11,0≤τ≤min(2,l),并要求以下迹重数非负:
这些公式完全确定实际重数。其必要局部域恰有29型,全部记录于CERTIFICATE.json。其中26型用完整池组件配额严格;l=2的三个型用组件配额的最大避锁扣除,在统一位置(16,17,19)分别得到
| τ | 严格上界 |
|---|---|
| 0 | 742709/744372 |
| 1 | 7433509/7443720 |
| 2 | 927532/930465 |
maxr.py只针对这三个原失败型完成有界布局查找,6.80CPU秒;certificate.py按保留位置重建全部十个十度二锁型、一个十一度单位伙伴型、29个三锁型,共40型,不再搜索。每行含实际迹、实际位置和精确分数,最大413127/413540<1。∎
A3 · 原染色结论
若有第二名十度点,用引理一。否则唯一十度点若有十一度单位邻点,用引理二的首支;若没有,引理二保证一组实际三锁,其迹属于引理三的完整29型。因此任何输入都到达严格条件排列失败概率界。有限实际排列空间中必有一次贪心过程成功,其输出对H的全部原边都是合法二染色,证明命题。∎
A3 · 复算入口及进口范围
运行python3 context/propertyb-m6-67-progress-20261029/34_min10/certificate.py。它导入已有概率核和已证组件配额;不是独立概率实现。原40型由root/NONUNIT_LOW_PROBE.json、本目录MAXR.json及单独重算的(10,11,1)型组成,最终入口为本目录CERTIFICATE.json。
组件配额的三个基础界及完整池/避锁最大扣除已经在各自通用引理中证明;本分支新增的实质选点义务是引理二的唯一十度点预算。这里只使用至多三个锁,没有扩展泛四锁域、整图枚举、Lean或外部模型调用。
A4 · 34点:最小度十一
A4 · 34点、最小度十一的完整分支候选
结论。 固定有限简单六元超图
这不是完整
A4 · 1. 预算与辅助图
记
若
对每个
A4 · 2. 低中心楔形或唯一刚性结构
引理34.11.1。 在上述假设下,至少有以下一种实际结构:
, 为不同点, 、 ; ,其余22个点的度数全为十二, 与其余点之间全部共度一,且 内全部共度三。
证明。 在
固定单位边
因为
此时 (4) 及其后的界首尾相等。由于
这个论证不要求事先选定某个最小度点的最小单位伙伴,也不要求所有高于十一的点具有相同度数。
A4 · 3. 刚性结构的实际四锁选择与完整迹
引理34.11.2。 在引理34.11.1的第二种结构中,可以选三名
证明。 固定任一外点
将三名
在引理34.11.1第一种结构中,将中心标为0、两个十一度端点标为1、2。中心度数
A4 · 4. 同一实际坏对上的 component 配额与精确证书
复用 ../small31_33/REPORT.md 引理1及 ../independent31_33/REVIEW.md 第1节已经证明/核查的 component 支撑下界,记其必要相交边对数为
对这个单项配额,按精确非负权重从低到高填充格容量,得到下界
| 必要型 | 参数 | 实际位置 | 精确失败概率上界 |
|---|---|---|---|
| 十一度单位对 | 309781/310155 | ||
| 十二度中心楔形 | 29629/30015 | ||
| 十二度中心楔形 | 3671143/3721860 | ||
| 十三度中心楔形 | 3701201/3721860 | ||
| 十三度中心楔形 | 1419/1426 | ||
| 刚性四锁 | 9856/10005 | ||
| 刚性四锁 | 118679/120060 | ||
| 刚性四锁 | 29804/30015 | ||
| 刚性四锁 | 39961/40020 |
九型全部严格。最大值为
A4 · 5. 实际复现与状态
最终证书 CERTIFICATE.json 由 certificate.py 产生,使用既有独立下降阶乘注入计数、独立 bottom-up component 精确边数 DP 和逐项避点配额最大值扣除。九型实际约0.078 CPU秒。
第二脚本 replay_original.py 使用原二项式概率核和原递归 component DP,九型全部复算,21个实际配额输入逐项一致,约0.028 CPU秒。结果保存于 REPLAY_ORIGINAL.json。两套概率计数和两套 component 实现给出相同精确有理数。可分别执行:
python3 context/propertyb-m6-67-progress-20261029/34_min11/certificate.py
python3 context/propertyb-m6-67-progress-20261029/34_min11/replay_original.py
PAIR_PROBE.json、TRIPLE_PROBE.json、SPECIAL_PROBE.json 及其脚本仅为保留的有界诊断记录,不是最终完整域。最终证明只依赖上述九型和实际选点引理,不依赖未通过的其他试探型,也没有扩大整图枚举。
A5 · 35点:最小度九
A5 · 35 vertices, minimum degree nine: a complete candidate
Let H be the same simple six-uniform pair-covering hypergraph, with
A5 · Lemma: a low nonunit partner of codegree two exists
There are n=34−u nonunit partners of x. Their total sum of lambda(x,z)−1 is11. Let l be the number with lambda exactly two. The other n−l partners each contribute at least two, so11≥l+2(n−l), or l≥57−2u.
If all these l partners had degree at least11, their degree excess above9, together with A, would be at least
contradiction. Hence an actual y outside A∪{x} has degree e∈{9,10} and lambda(x,y)=2.
A5 · Lemma: an actual low common unit neighbor exists
The number of nonunit partners of y is at most5e−34. One of them is x, which does not belong to A. Thus the common unit pool C=A∩{z:lambda(y,z)=1} has size
All A vertices have degree at least12. After charging3u excess units to A and e−9 units to y, the remaining degree excess is at most81−3u−(e−9). Therefore C contains z of degree at most
If e=9, u≥23 makes the numerator at most12 and denominator at least13; hence d(z)=12. If e=10, numerator at most11 and denominator at least8, so d(z)≤13 (and at least12). The denominator is positive in both cases. The three selected vertices are distinct; their codegrees are lambda(z,x)=lambda(z,y)=1, lambda(x,y)=2.
A5 · Complete actual traces and arithmetic
Label z as0, x as1, y as2. The only degree triples are (12,9,9), (12,9,10), (13,9,10). Let tau∈{0,1} be the actual triple intersection multiplicity. Their complete trace counts are
All six complete local types have a strict conditional failure bound using the proven component quota separately for each avoided pool, taking the maximum valid deduction against the same actual bad-pair vector. The submitted exact values and layouts are in LOW_PAIR_CENTER35.json, produced by low_pair_center35.py using component_kernel.py. The largest submitted value is14882237/14887440<1. Together with the imported adaptive cases e≤11 this covers the entire v35, minimum-degree9 branch.
Status: primary-agent paper derivation and exact arithmetic; independent replay and cross-family review pending. This is one internal branch, not the whole m(6)≥67 theorem.
A6 · 35点:最小度十
A6 · 35 vertices, minimum degree ten: complete candidate
Theorem. Every finite simple six-uniform pair-covering hypergraph with exactly
Status. Complete computer-assisted proof candidate. Independent replay and cross-family review of this final branch are pending. This proof uses the same exact conditional permutation failure mechanism and valid bad-pair deletion imported in PROOF36_38.md. It adds no assumption to the original Property B target: pair coverage and the vertex/degree case are internal counterexample branches.
Let
The total degree excess above ten is
A6 · 1. Complete accepted numerical configurations
CERT35_MIN10.json contains only the 102 successful records used in this proof; finalize_min10_35.py extracts them from the actual completed calculations and fixes their successful labels, positions, multiplicities and exact rational bounds. These are three complete input domains.
A. A unit pair of degree-ten vertices. Suppose
B. A degree-ten vertex with two degree-eleven unit neighbors. Here the degrees are
C. A degree-twelve common unit center of a codegree-two pair of degree-ten points. Label the degree-twelve center as zero and the degree-ten points as one and two. The codegrees are
The actual completed calculation LOW_PAIR_MIN10_35.json gives
The lock positions are indexed by the stated labels. These two rows also appear in the final certificate. Each strict configuration produces an actual coloring, regardless of how those actual locks were selected.
A6 · 2. Low codegree-two partner
Assume for contradiction that
Fix any degree-ten point
Let
If all these
contradiction. Hence there is an actual degree-ten point
A6 · 3. An actual degree-twelve common unit center
Let
The actual degree-ten points
common unit neighbors in
contradiction. Hence there is an actual common unit neighbor
This is precisely accepted numerical domain C. It gives an actual valid coloring of
A6 · Reproducibility and scope
The exact final certificate has 79+21+2=102 rows, all with nonnegative actual multiplicities and strict rational upper bounds. Each row records the deletion method it actually used: the first group uses the common integer avoided-subset vector with the previously proved component-support quota; the other groups use the maximum of the valid single-subset component-quota deductions. Neither method adds overlapping deductions.
finalize_min10_35.py regenerates the final certificate from the completed source JSON files. The probability kernel is reused from the project; this is not an independent implementation. The final proof uses none of the non-strict or interrupted fourth-lock exploratory domains documented in STATUS35.md.
A7 · 35点:最小度十一
A7 · The minimum-eleven case is complete
Assume
so
Consequently there is an actual three-lock weak wedge with all degrees eleven, two unit pairs and the remaining pair of codegree one or two. Its triple intersection multiplicity is zero or one. min11_35.py generates all eight labelled codegree/trace possibilities (all-unit traces are repeated under the irrelevant doubled-pair label; this redundancy is harmless). Every row in MIN11_35.json is strict. Thus every actual hypergraph in this minimum-degree case is colorable. ∎
A8 · 36–38点:完整实际分支
A8 · Complete conditional closure at 36,37,38 vertices
A8 · Theorem and imports
Theorem. Every finite simple six-uniform pair-covering hypergraph with exactly
Status. Complete computer-assisted proof candidate, conditional only on the explicitly imported probability mechanism below; independent numerical verification pending. This closes these three internal vertex branches of the original
Write
The imported conditional random-greedy failure bound, exact endpoint and ordered-pair weights, valid bad-pair deletion, and full actual edge-trace recovery are those in context/propertyb-m6-66-20261029/PROOF_M6_GE66.md, §§3–4, with the budget
REPORT.md, Lemma 1, proves the successive minimum-unit-neighbor selection used below. Its statement and proof are part of this package. The component-support quota and avoided-subset joint vector used in ADAPTIVE_COMPONENT.json are explained and proved there. Their use is a valid strengthening of the original probability bound. The four-lock calculations use the weaker, cheaper deduction
A8 · Lemma 2: a weak wedge through one specified actual unit edge
Let
then there exists
Thus the three actual locks have either all three codegrees one, or exactly one codegree two and the other two one.
Proof. For
Every vertex outside
Interchanging
A8 · Lemma 3: an additional lock with total codegree excess at most one
Let
Then at least
outside vertices
Proof. Sum the three rows in (1), and remove their internal terms. Every internal excess is counted twice, leaving exactly
A8 · Lemma 4: complete actual trace generation
For four labelled locks, let
Conversely, all nonnegative solutions are generated by the function parts(target) in four_repair.py. It orders the eleven possible blocks (six pairs, four triples, one quadruple), recursively removes one block only when all its pair capacities are still positive, and allows repetition of the same block. The sorted-index restriction selects one order for every multiset. Every nonempty target solution contains some allowable block, and induction on the total remaining pair capacity proves completeness.
The restriction
A8 · The 37- and 38-vertex branches
The full minimum-degree domains from (1) and the degree sum are respectively
Every branch whose two-lock bound is strict is finished there. Otherwise both actual triple traces and the complete degree interval from Lemma 1 are tested. The selected success layouts give strict bounds except for exactly fifteen labelled triple types at 37 vertices and twelve at 38 vertices. No failure is dropped: they are the failures records of the corresponding branches.
For each of those twenty-seven types, apply Lemma 3 with
| parent triple types requiring extension | complete four-lock types | largest bound | |
|---|---|---|---|
| 37 | 15 | 1452 | |
| 38 | 12 | 855 |
All fractions and actual lock positions are in FOUR_REPAIR.json. Its coverage records contain every parent, complete=true and no non-strict row. Therefore every original hypergraph at either vertex count reaches a strict probability bound. ∎
A8 · The 36-vertex branch
Here the actual minimum degree ranges over
For
Suppose
so
Lemma 2 produces an actual weak unit wedge containing
Twenty-nine have a strict triple bound. For each of the nineteen others, Lemma 3 applies with
MIN10_36.json contains all 48 triple records, all 3048 fourth-lock records, and every completed parent degree interval. It has complete=true and no non-strict fourth-lock record.
Finally suppose
All outside degrees are eleven, so the fourth lock has degree eleven. The complete four-lock classification consists of 31 types, all strict with maximum
These cases cover every actual minimum degree. Every input therefore reaches a strict conditional failure bound, yielding a valid coloring. This completes the 36-vertex branch and hence the theorem. ∎
A8 · Certificate and reproduction map
- adaptive_component.py / ADAPTIVE_COMPONENT.json: minimum-unit-neighbor selection; only the strict two-lock rows or complete strict conditional-three branches are used directly.
- four_repair.py / FOUR_REPAIR.json: every remaining actual triple at 37 and 38 vertices, fully extended and strict.
- min10_36.py / MIN10_36.json: the complete fixed-edge weak-wedge domain at minimum degree ten.
- wedge36.py / WEDGE36.json: the two successful unit traces in the regular-eleven branch; its two non-strict rows are continued rather than claimed strict.
- wedge_four36.py / WEDGE_FOUR36.json: those two remaining weak-wedge traces, fully extended and strict.
Every successful row fixes its actual positions, degrees, trace and exact rational upper bound. The Python scripts reuse the original probability kernel; this package does not claim independent arithmetic replay or Lean verification.
A9 · 39点:弱四锁分支
A9 · M66:39点完整纸面分支候选
本节固定同一实际有限简单六元超图H,恰66边、39点、点对覆盖、总度396。点对覆盖给最低度至少8。沿用上层条件排列失败概率公式,并用PROOF40_41.md§2的同一实际坏对向量最大避点配额扣除;本文不增加原目标的假设。
A9 · 引理1:实际弱四锁的选择
存在三个两两共度1的锁x0,x1,x2,每点度数在8…10。设其度数和为t。还能选第四个不同锁y,使其度数在8…D(t),且它到原三锁的三个共度均为1,或恰有一个共度为2、另两个为1。其中
具体为t24,25,26时D10;t27,28,29时D11;t30时D12。
证明:前三锁存在性由整数Q引理在v39、D10给Z33,Q16,33>2·16。对每个S外点y,令 e_y=Σ_{x∈S}(
于是至多floor(E(t)/2)名外点有e_y≥2;至少p(t)名有e_y≤1。外点的总度数超出最低度8的部分为396−t−36·8=108−t。若这至少p(t)名点的度数全部大于D(t),超额就严格大于108−t,矛盾。因此其中有y度数至多D(t)。整数非负的三个
A9 · 引理2:完整实际迹分类
将前三锁按度数排列并标为0、1、2,第四锁标为3。任一至少二点迹消耗其包含的全部点对共度单位。引理1给完整K4的六个点对各有一个单位,并允许(0,3)、(1,3)、(2,3)中恰一个点对再有一个单位。至少三点迹的重数不可能超过1,因为其中含有原三锁中的点对,或至少两个到原锁的共度1点对;唯一可重复的至少二点迹就是被加倍的二点迹本身。
因此实际至少二点迹完全对应于上述六维点对重数向量的多重团分解:全单位型有6个带标签分解;每个指定加倍点对各有7个。parts(target,idx)按非递减团序递归扣除一个团的各点对单位,当且仅当余向量为零时接收。这枚举每个多重团分解恰一次,覆盖全部实际情况;无整图枚举。剩余单点迹重数由实际度数减去已经列出的含点迹重数决定,空迹为66减去总数。
A9 · 定理:39点分支可二染
引理1允许前三度数的全部非递减三元组8…10。对每组,以D(t)作为第四度数完整上限,逐项取第四度数8…D(t),并列引理2的6+3·7=27种多重团分解,共999个必要局部型。每型的所有实际迹重数均已确定。
对999型,使用同一实际坏对向量最大避点配额扣除后,全有严格失败概率上界小于1,详见CERT39.json。每行保存前三/第四度数、加倍点对、实际多重迹、迹重数、条件排列布局和精确有理上界。初次使用七种连续四锁布局时965型严格,剩余34型在把加倍点对置于四个连续位置两端后全部严格。最大最终界为113467943/113476275<1。
这些布局允许锁的标签在排列中以任意顺序出现;概率核接收positions[j]作为锁j的位置。将加倍点对放在两端只是选择另一个合法条件排列,不改变实际超图、迹或坏对对象。
由原条件排列/贪心失败上界,严格小于1给至少一个成功二染色。因此本节覆盖完整39点实际分支。∎
A9 · 复现与范围
先运行python3 context/propertyb-m6-67-progress-20261029/tail39_41/weak_four39.py,再运行同目录weak_repair39.py。初次999型17.208 CPU秒,34型修复0.706 CPU秒,共17.914 CPU秒。CERT39.json合并两次的成功行;原始失败保留于WEAK_FOUR39.json,但已由WEAK_REPAIR39.json逐项严格替代。
计算复用原条件排列权重。它是实际精确运行,并非独立第二实现;本分支仍待主代理核验、独立算术及全目标整合,不把局部候选升级为完整m(6)≥67结果。
A10 · 40–41点:重选锁与完整分流
A10 · M66:40、41点完整纸面分支候选
令 H 是同一实际有限简单六元超图,恰66边、点对覆盖,总度396。本文只处理
A10 · 1. 选锁及完整迹
对
A10 · 2. 同一坏对向量上的避点配额
固定锁j及其条件位置h。对每个
从而
所有R使用同一个实际坏对计数向量 z_{T,U},其坐标是同时含j的无序迹型格,容量是 binom(ell_T,2) 或 ell_T ell_U,非负权 w_{T,U} 为两种有向条件排列权重之和。给定R,把所有满足
于是失败概率至多
A10 · 3. 排除40点唯一失败迹
完整90型中,只有度数(8,8,8,10)、四锁同在一条原边E的型不严格。设其中三名八度锁为a,b,c。每名八度点冲突度至多1。L至少ceil(44/3)=15点,故E外至少9名L点;三名八度点总共至多3个冲突邻点。可取y∈L\E,与a,b,c均共度1。新四锁a,b,c,y不能同在一条原边F:a,b在E中的共边唯一,若F含它们则F=E,但y∉E。因此重选后仍属于同一完整90型域,并已排除唯一失败型。所有其他型的确切布局和严格有理界见证书。
A10 · 4. 排除41点所需的五点同边迹
可进一步要求:五个锁若同在一条边E,则其度数总和t必须为50。
证明:若原五锁S位于E且t≤49,首先,若有八度点y∉E,由于其冲突度至多0,它与任意四名S点构成新五个单位锁,且不全在一条原边内。否则E外的L点度数均为9或10。S的总低度权为55−t,E的第六点低度权至多3;故E外L点低度权至少55−(55−t)−3=t−3,每点权至多2,所以其人数至少ceil((t−3)/2)。S到外部的冲突关联总数至多Σ_{x∈S}(5d(x)−40)=5t−200。对40≤t≤49,
因此有E外低度点y至多与S中一人冲突,取四名非邻点加y。新五锁两两共度1,并不能同在一条原边:所选四名原锁中任一对的唯一共边是E。这个重选同时排除所有t≤49的五点同边迹。t=50的单一型由概率证书严格处理。∎
完整672型的概率表中,所有非严格型均是t≤49的五点同边迹,故全部由该结构重选覆盖。所有非五点同边迹均严格,不依赖度数和。
A10 · 5. 精确证书和结论
执行 python3 context/propertyb-m6-67-progress-20261029/tail39_41/cert40_41.py。CERT40_41.json保存90+672型的实际迹重数、成功/最佳布局、精确概率界及结构排除标识。完整运行实际CPU约25.303秒;无未闭型。脚本复用原概率原语,尚不是第二实现或独立核验。原始五锁试算和残余最大配额试算分别保留为FIVE41.json和QUOTA_PROBE.json。
由上层实际概率判据,这给出v40、41两支的完整纸面候选。它不单独证明m(6)≥67;原始全域其余分支仍由主代理整合。
A11 · 42–44点:尾部锁选择及完整迹
A11 · Tail lock-selection review: 42, 43 and 44 vertices
PASS (same-family / provisional). The proposed structural selection arguments are valid. They remove every failing pattern recorded in ../pilot/FIVE.json at
Throughout,
Lemma A (42 vertices: exclude a common five-point trace). There are five degree-nine unit-codegree locks not contained together in any hyperedge.
Proof. Choose an independent five-set
Lemma B (nine unit-codegree vertices: exclude every trace of size four or five). If
Proof. If every edge already meets
At
A11 · Exact correspondence with the existing table
For a labelled five-lock set, a multi-lock trace is encoded by a mask in
A separate short recursive exact-pair-cover calculation rebuilt all 32 labelled partitions and confirmed equality with the 32 distinct masks lists at each of the three vertex counts. This was a classification check, not a new probability calculation. Every stored strict flag was checked against Fraction(U)<1.
The stored non-strict rows are exactly:
| Masks | Stored | |
|---|---|---|
| 42 | [31] | 2607524/2561251 |
| 43 | [31] | 2607524/2561251 |
| 44 | [5,6,12,20,27] | 166491788/166481315 |
| 44 | [31] | 102923518/99888789 |
Mask 31 is a five-point trace, excluded by Lemma A and Lemma B. Mask 27 has four set bits; the other four masks pair the omitted label with the four labels in 27. Thus the second
| Structural restriction | Retained labelled patterns | Maximum stored | |
|---|---|---|---|
| 42 | Every trace has size at most 4 | 31 | 1382147533/1383075540 |
| 43 | Every trace has size at most 3 | 26 | 48389416/48663769 |
| 44 | Every trace has size at most 3 | 26 | 132269531/133185052 |
Every retained value is strictly below one. These are exact rational comparisons of the stored numerical output, not a second probability implementation.
Scope of acceptance. Both short structural lemmas and their application to the recorded tail patterns pass. This justifies the proposed