Documentation

LeanPool.Erdos97ConvexOctagon.CoverageCertificateFacts89

Bounded coverage-certificate computation facts #

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

Root audit for fixed branch (4, 13).

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchRoot_6_28 :
branchClaimRootValidB 6 28 (BranchClaim.search branchClaims6Row28) = true

Root audit for fixed branch (6, 28).

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_28_00000 :
nodeClaimChunkValidB branchClaims6Row28 0 64 = true

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

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_28_00064 :
nodeClaimChunkValidB branchClaims6Row28 64 64 = true

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

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_28_00128 :
nodeClaimChunkValidB branchClaims6Row28 128 64 = true

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

source
theorem Erdos97Octagon.RawIncidence.StaticDirectCoverage.coverageBranchNodes_6_28_00192 :
nodeClaimChunkValidB branchClaims6Row28 192 13 = true

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