PureU1.permTwoInj
defimported Lean
Given two distinct elements, an embedding of Fin 2 into Fin n.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in open Finset in variable {i j i' j' : Fin n} (hij : i ≠ j) (hij' : i' ≠ j') in def PureU1.permTwoInj : Fin 2 ↪ Fin n
- Defined in
- Physlib, `PureU1.permTwoInj`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.PureU1.permTwoInj← PureU1.permTwoInj (Physlib/QFT/QED/AnomalyCancellation/Permutations.lean:101): verbatim
- Verified
- 10 Oct 2026
- Axioms
- none listed
- Built on 1
- MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See
MatrixGame.toStrategicGame_isZeroSumfor the proof that this…
- MatrixGame.toStrategicGameThe two-player zero-sum strategic game associated with a matrix game. See
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in open Finset in variable {i j i' j' : Fin n} (hij : i ≠ j) (hij' : i' ≠ j') in /-- Given two distinct elements, an embedding of `Fin 2` into `Fin n`. -/ def PureU1.permTwoInj : Fin 2 ↪ Fin n where toFun s := match s with | 0 => i | 1 => j inj' s1 s2 := by aesop