Skip to main content

Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 2,569 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 505 to 510 of 2,569 results.

Project-declaredLean 4.31.0

Exists rel Closest codeword of Nonempty Code

Code.exists_relClosest_codeword_of_Nonempty_Code

Mathematical statement

This follows proof strategy from exists_closest_codeword_of_Nonempty_Code. However, it's NOT used to construct pickRelClosestCodeword_of_Nonempty_Code.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Finite rel Hamming Dist Range

Code.finite_relHammingDistRange

Mathematical statement

The range of the relative Hamming distance function is finite.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Joint Agreement iff joint Proximity

Code.jointAgreement_iff_jointProximity

Mathematical statement

Equivalence between the agreement-based definition jointAgreement and the distance/proximity-based definition jointProximity (the latter is represented in upperbound of interleaved-code distance).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Pair Rel Dist le iff pair Dist le

Code.pairRelDist_le_iff_pairDist_le

Mathematical statement

Equivalence between relative and natural distance bounds.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rel Close To Code iff rel Close To Codeword of min Dist

Code.relCloseToCode_iff_relCloseToCodeword_of_minDist

Mathematical statement

Relative distance version of closeToCode_iff_closeToCodeword_of_minDist. If the distance to a code is at most δ, then there exists a codeword within distance δ. NOTE: can we make this shorter using relDistFromCode_eq_distFromCode_div?

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Rel Dist floor bound iff complement bound

Code.relDist_floor_bound_iff_complement_bound

Project documentation

The equivalence between the two lowerbound of upperBound in Nat and NNReal context. In which, upperBound is viewed as the size of an agreement set S (e.g. between two words, or between a word to a code, ...). Specifically, n - ⌊δ * n⌋ ≤ (upperBound : ℕ) ↔ (1 - δ) * n ≤ (upperBound : ℝ≥0). This lemma is useful for jumping back-and-forth between...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record