Aether Catalog definitions — Bridges_LongestCommonValuedPrefix
DefinitionBridges_LongestCommonValuedPrefixaether-catalogbridges
Definition bundle for the Aether Catalog module Bridges.LongestCommonValuedPrefix, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.
Definition code
-- Def bundle generated from Bridges/LongestCommonValuedPrefix.lean by skeleton subtraction
import Mathlib
/-
# Longest Common Valued Prefix — Foundational Combinatorics
Bridge: connects ultrametric valuation geometry to prefix-agreement
combinatorics on finite lists. Defines `lcvpLen` and proves its core
algebraic properties including the min-prefix (ultrametric valuation)
inequality.
Keywords: ultrametric, valuation, prefix_agreement, non_archimedean
-/
open List Finset
namespace OracleTrace
/-! ## Core Definitions -/
/-- `lcvpLen u v` is the length of the longest common prefix of lists
`u` and `v`. Acts as a discrete non-Archimedean valuation on list space.
Bridge: connects algebra (valuation theory) to speculative oracle
semantics (trace agreement depth). -/
def lcvpLen {α : Type*} [DecidableEq α] : List α → List α → Nat
| [], _ => 0
| _, [] => 0
| a :: u, b :: v => if a = b then Nat.succ (lcvpLen u v) else 0
/-- Prefix injectivity: an encoding is injective on list traces.
Bridge: connects to post_quantum_security (collision resistance). -/
def PrefixInjective {β α : Type*} (encode : β → List α) : Prop :=
Function.Injective encode
variable {α : Type*} [DecidableEq α]
/-! ## Foundational Recursion -/
/-! ## Symmetry -/
/-! ## Length Bounds -/
/-! ## Self-agreement -/
/-! ## Prefix Agreement Characterization -/
/-! ## Maximality -/
/-! ## Equality Detection -/
/-! ## The Ultrametric Valuation Inequality -/
/-! ## Concatenation Principle -/
end OracleTrace