[#R638] Satisfiability probability decreases with the number of clauses
claim. Deleting a uniformly chosen clause from a uniform (m+1)-set gives a uniform m-set, and deletion preserves satisfiability.
1Summary
Write \(P_m\) for the satisfiability probability of a uniformly chosen \(m\)-element clause set. Sample a uniform \((m+1)\)-element set \(F\), then delete one of its clauses uniformly. The resulting \(m\)-set is uniform because every \(m\)-set has the same number of one-clause extensions and every extension has the same deletion probability.
If \(F\) is satisfiable, every subset of \(F\) is satisfiable. Under this coupling, the satisfiability indicator after deletion is at least its value before deletion. Taking expectations gives \[ P_m\geq P_{m+1}. \] Thus exact inequalities at 12 and 13 clauses determine whether 13 is the first crossing below one half.
Established evidence. Recorded scope: uniform m-element subsets of any fixed finite clause universe, compared with uniform (m+1)-element subsets from the same universe.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, Elementary deletion coupling recorded by TheoremDB entry research on 2026-07-25
3What was measured
- Direction
- nonincreasing
- Property used
- satisfiability is closed under deleting clauses
4How it connects
Informs
- attempt
Recorded for
- problem
5Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R638",
"content_hash": null,
"slug": "r2s6-claim-monotone-in-clause-count",
"type": "claim",
"title": "Satisfiability probability decreases with the number of clauses",
"summary": "Deleting a uniformly chosen clause from a uniform (m+1)-set gives a uniform m-set, and deletion preserves satisfiability.",
"relevance": "For Median satisfiability threshold for a six-variable clause set, record r2s6-claim-monotone-in-clause-count (“Satisfiability probability decreases with the number of clauses”) records a bound, answer, status fact, or structural consequence. The record states: Deleting a uniformly chosen clause from a uniform (m+1)-set gives a uniform m-set, and deletion preserves satisfiability.",
"relevance_source": "recorded",
"body": "Write \\(P_m\\) for the satisfiability probability of a uniformly chosen \\(m\\)-element clause set. Sample a uniform \\((m+1)\\)-element set \\(F\\), then delete one of its clauses uniformly. The resulting \\(m\\)-set is uniform because every \\(m\\)-set has the same number of one-clause extensions and every extension has the same deletion probability.\n\nIf \\(F\\) is satisfiable, every subset of \\(F\\) is satisfiable. Under this coupling, the satisfiability indicator after deletion is at least its value before deletion. Taking expectations gives\n\\[\nP_m\\geq P_{m+1}.\n\\]\nThus exact inequalities at 12 and 13 clauses determine whether 13 is the first crossing below one half.",
"status": "established",
"evidence_grade": "mathematical_identity",
"scope": {
"kind": "bounded",
"statement": "uniform m-element subsets of any fixed finite clause universe, compared with uniform (m+1)-element subsets from the same universe",
"bounds": {
"available_clauses": {
"min": 1
},
"clauses": {
"min": 0
}
},
"exhaustive": false
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.5070/C63261985",
"locator": "Elementary deletion coupling recorded by TheoremDB entry research on 2026-07-25"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.5070/C63261985",
"locator": "Elementary deletion coupling recorded by TheoremDB entry research on 2026-07-25"
},
"relations": [
{
"slug": "R636",
"title": "The exact thirteen-clause coefficient remains to be extracted",
"object_type": "attempt",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "random-two-sat-six-median",
"title": "random two sat six median",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
- Project
- random-two-sat-six-median
- Locator
- Elementary deletion coupling recorded by TheoremDB entry research on 2026-07-25
- License
- CC0-1.0
- Contributors
- TheoremDB entry research, 2026-07-25
- Source
- doi.org ↗
- Public record
- R638
- Stable alias
- r2s6-claim-monotone-in-clause-count
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.