Lemma 6.2 — probability of a good configuration
ProvedZhangTangLabelCut.LP2.configuration_probabilityLet and be integers in the shutter construction, in either orientation. Fix a nonempty label subset , set , and assume . Let be its light ground set and its configuration. For independent uniform permutations,
The originating is fixed before the random draw. This is the configuration probability bound.
Differences from the source:
- encoding: one-based finite label and chain indices → zero-based Fin indices; reason: reindexing preserves every instance and cardinality
- encoding: Section 4 and Section 6 standing positive integer parameters and d > 8a → the same positive regime, enforced by hypotheses and inhabited chain indices, with d > 8a; reason: these are the source construction regime and p. 17 condition; redundant positivity binders are omitted, and 4a stays real
- encoding: undirected construction, with the directed extension in Section 7 → a Boolean orientation quantified over both cases; reason: both source graph orientations are preserved
- encoding: independent uniform permutations → finite counting probability on the full product of permutation groups; reason: the sample space has cardinality (d!) to the number of chains
- encoding: F and its associated light ground set from L′ → the event is indexed by the original fixed candidate S; reason: keeps zero-count light elements and does not assume that F alone determines its light ground set
import Definitions.Def_ZhangTangLabelCut_LP2_FiniteGraph import Definitions.Def_ZhangTangLabelCut_LP2_CoveringLP import Definitions.Def_ZhangTangLabelCut_LP2_LabelCut import Definitions.Def_ZhangTangLabelCut_LP2_Shutter import Definitions.Def_ZhangTangLabelCut_LP2_Configurations
namespace ZhangTangLabelCut.LP2
theorem configuration_probability (k d h : ℕ) (hk : 2 ≤ k) (hh : 0 < h)
(directed : Bool) (S : Finset (Fin k × Fin d)) (hc : 0 < S.card)
(hreg : 8 * average k S.card < (d : ℝ)) :
probability k d h (good directed S) ≤ configurationBound k h (average k S.card) d := by sorry
end ZhangTangLabelCut.LP2
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Data. Let and a directed/undirected flag.
Hypotheses.
- and ;
- with ;
- with , .
Light rows and configuration.
- is light when . Rows with zero elements count as light.
- .
The graph. It is built from a sample , which assigns a permutation of to each chain with , :
- terminals ;
- per chain, junctions , , , and middles ;
- edges for and , one-way if directed and two-way if not;
- the edges through are labelled , and those through are labelled .
Good. is good when every simple – path, all of whose edges lie in chains whose and are both light, contains an edge labelled in .
Claim. With uniform over all samples,
Degenerate cases:
- forces and .
- So the inner base lies in and the bracket lies in .
- The outer exponent is positive, since .
- If no simple – path uses only allowed edges, every is good, the left side is , and the claim asserts a number below .
- No division by zero or junk power arises.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.