Documentation

Complexitylib.DescriptiveComplexity.Encoding.Positions.Internal

Correctness of encoded table positions #

The site enumeration is complete, has the expected length, and reproduces the existing encoder when mapped to table values. These facts justify direct reads.

theorem Complexity.DescriptiveComplexity.encodeStruct_eq_of_values_internal {V : Vocabulary} (A : DecFinStruct V) (bits : List Bool) (hlen : bits.length = encodingLength V A.card) (hheader : ∀ (i : Fin (A.card + 1)), bits[↑i]? = some (decide (↑i < A.card))) (hsites : ∀ (site : InputSite V A.card), bits[encodingPosition V A.card site]? = some (inputSiteValue A site)) :