File size: 2,416 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import OAI.Combinatorics.EditApproximation.AlmostLinearConditional
import OAI.Combinatorics.EditApproximation.Probability.BernsteinFinite

namespace OAI

/-! A uniform binary approximation scheme for edit distance.
The finite Bernstein inequality supplies the concentration bounds for the
initial estimator and the refinement samples. -/

namespace EditApproximation
open MeasureTheory Filter

/-- Finite product-measure concentration for the initial estimator and refinement. -/
theorem computedBernsteinInputs (N : β„•) : ComputedBernsteinInputs N := by
  constructor
  Β· exact finiteBernsteinInput _
  Β· intro b h
    exact finiteBernsteinInput _

/-- A uniform almost-linear approximation scheme. The same binary algorithm
satisfies the approximation, equality, expected-work and space bounds. -/
theorem almostLinearEditDistance (epsilon : BinaryFraction)
    (hepsilon : 0 < epsilon.value) (_hepsilonOne : epsilon.value < 1)
    :
    (βˆ€ (source target : List β„€) (N : β„•), source.length + target.length ≀ N β†’
      (2 / 3 : ℝ) ≀ (computedFullLaw (source.map integerSymbolCode) (target.map integerSymbolCode) N epsilon).real
        {outcome | EditDistortion.edit source target ≀ integerBinaryAnswer source target N epsilon outcome ∧
          (integerBinaryAnswer source target N epsilon outcome : ℝ) ≀
            (1 + (epsilon.value : ℝ)) * EditDistortion.edit source target}) ∧
    (βˆ€ (source target : List β„€) (N : β„•), source = target β†’ βˆ€ outcome,
      integerBinaryAnswer source target N epsilon outcome = 0) ∧
    (βˆ€ (C : β„•) (eta : ℝ), 0 < eta β†’ βˆ€αΆ  N : β„• in atTop,
      βˆ€ source target : List β„€, source.length + target.length ≀ N β†’
        (βˆ€ z ∈ source ++ target, z.natAbs ≀ (N + 2) ^ C) β†’
        (∫ outcome, integerBinaryWork source target N epsilon outcome
          βˆ‚computedFullLaw (source.map integerSymbolCode) (target.map integerSymbolCode) N epsilon) ≀
            (N + 2 : ℝ) ^ (1 + eta)) ∧
    (βˆ€ C : β„•, βˆ€αΆ  N : β„• in atTop, βˆ€ source target : List β„€,
      source.length + target.length ≀ N β†’
        (βˆ€ z ∈ source ++ target, z.natAbs ≀ (N + 2) ^ C) β†’
        βˆ€ outcome, integerBinarySpace source target N epsilon outcome ≀ (N + 2) ^ (C + 65564)) := by
  exact almostLinearEditDistance_conditional epsilon hepsilon _hepsilonOne computedBernsteinInputs

end EditApproximation

end OAI