Uniform injective frames and channel transpose failure
Lax342547.InjectiveFrames · concepts/Lax342547/InjectiveFrames.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Injectivity of an h-column frame has probability at least one half when N≥h+1, so conditioning costs at most a factor of two on every event. The transpose evaluation on any prescribed independent q-tuple is therefore noninjective with probability at most 2^(q+1-h), as in (4.2).
Concept map
Evidence
This concept declares 5 statements. Each proof establishes one of them relative to its assumptions.
1 injection_event_bound proven
2 injective_mass_half proven
3 raw_transpose_failures proven
4 transpose_failure proven
5 transpose_uniform proven
Lean source view on GitHub
| 1 | import Lax342547.FrameSymmetry |
| 2 | import Lax342547.GramNormalization |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Uniform injective frames and channel transpose failure |
| 7 | type: theorem |
| 8 | --- |
| 9 | Injectivity of an h-column frame has probability at least one half when |
| 10 | N≥h+1, so conditioning costs at most a factor of two on every event. |
| 11 | The transpose evaluation on any prescribed independent q-tuple is |
| 12 | therefore noninjective with probability at most 2^(q+1-h), as in (4.2). |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax342547.InjectiveFrames |
| 16 | |
| 17 | open Lax342547.MomentSpace Lax342547.FrameSymmetry |
| 18 | open scoped ENNReal |
| 19 | |
| 20 | axiom injective_mass_half {H N : Type} [Fintype H] [Fintype N] |
| 21 | [DecidableEq H] [DecidableEq N] (hN : Fintype.card H + 1 ≤ Fintype.card N) : |
| 22 | (1 / 2 : ℝ≥0∞) ≤ (PMF.uniformOfFintype (Matrix N H Binary)).toOuterMeasure |
| 23 | {A | Function.Injective A.mulVec} |
| 24 | |
| 25 | axiom injection_event_bound {H N : Type} [Fintype H] [Fintype N] |
| 26 | [DecidableEq H] [DecidableEq N] [Nonempty (Injection H N)] |
| 27 | (hN : Fintype.card H + 1 ≤ Fintype.card N) (S : Set (Matrix N H Binary)) : |
| 28 | (PMF.uniformOfFintype (Injection H N)).toOuterMeasure {A | A.val ∈ S} ≤ |
| 29 | 2 * (PMF.uniformOfFintype (Matrix N H Binary)).toOuterMeasure S |
| 30 | |
| 31 | axiom transpose_uniform {I H N : Type} [Fintype I] [Fintype H] [Fintype N] |
| 32 | [DecidableEq I] [DecidableEq H] [DecidableEq N] |
| 33 | (D : Matrix N I Binary) (hD : Function.Injective D.mulVec) : |
| 34 | (PMF.uniformOfFintype (Matrix N H Binary)).map (fun X => X.transpose * D) = |
| 35 | PMF.uniformOfFintype (Matrix H I Binary) |
| 36 | |
| 37 | axiom transpose_failure {I H N : Type} [Fintype I] [Fintype H] [Fintype N] |
| 38 | [DecidableEq I] [DecidableEq H] [DecidableEq N] [Nonempty (Injection H N)] |
| 39 | (D : Matrix N I Binary) (hD : Function.Injective D.mulVec) |
| 40 | (hN : Fintype.card H + 1 ≤ Fintype.card N) : |
| 41 | (PMF.uniformOfFintype (Injection H N)).toOuterMeasure |
| 42 | {X | ¬ Function.Injective (X.val.transpose * D).mulVec} ≤ |
| 43 | (2 : ℝ≥0∞) ^ (Fintype.card I + 1) / 2 ^ Fintype.card H |
| 44 | |
| 45 | axiom raw_transpose_failures {B I H N : Type} |
| 46 | [Fintype B] [Fintype I] [Fintype H] [Fintype N] |
| 47 | [DecidableEq I] [DecidableEq H] [DecidableEq N] |
| 48 | {E : Matrix B B Binary} [Nonempty (RawFrames.Frame B H N E)] |
| 49 | (D : Matrix N I Binary) (hD : Function.Injective D.mulVec) |
| 50 | (hN : Fintype.card H + 1 ≤ Fintype.card N) : |
| 51 | (PMF.uniformOfFintype (RawFrames.Frame B H N E)).toOuterMeasure |
| 52 | {F | ¬ Function.Injective (F.X.transpose * D).mulVec} ≤ |
| 53 | (2 : ℝ≥0∞) ^ (Fintype.card I + 1) / 2 ^ Fintype.card H ∧ |
| 54 | (PMF.uniformOfFintype (RawFrames.Frame B H N E)).toOuterMeasure |
| 55 | {F | ¬ Function.Injective (F.Y.transpose * D).mulVec} ≤ |
| 56 | (2 : ℝ≥0∞) ^ (Fintype.card I + 1) / 2 ^ Fintype.card H |
| 57 | |
| 58 | end Lax342547.InjectiveFrames |
| 59 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments