Documentation

LeanPool.Erdos97ConvexOctagon.CoverageCertificateFacts85

Bounded coverage-certificate computation facts #

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_4_09 :
branchClaimRootValidB 4 9 (BranchClaim.patternTwo 0) = true

Root audit for fixed branch (4, 9).

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_6_24 :
branchClaimRootValidB 6 24 (BranchClaim.search branchClaims6Row24) = true

Root audit for fixed branch (6, 24).

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_24_00000 :
nodeClaimChunkValidB branchClaims6Row24 0 64 = true

Node audit for fixed branch (6, 24), starting at 0.

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_24_00064 :
nodeClaimChunkValidB branchClaims6Row24 64 64 = true

Node audit for fixed branch (6, 24), starting at 64.

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_24_00128 :
nodeClaimChunkValidB branchClaims6Row24 128 64 = true

Node audit for fixed branch (6, 24), starting at 128.

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_24_00192 :
nodeClaimChunkValidB branchClaims6Row24 192 43 = true

Node audit for fixed branch (6, 24), starting at 192.