WickContraction.mem_uncontracted_iff_not_contracted
theoremverifiedformalizationimported Lean
WickContraction.mem_uncontracted_iff_not_contracted
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open WickContraction in variable {𝓕 : FieldSpecification} in variable {n : ℕ} (c : WickContraction n) in set_option backward.isDefEq.respectTransparency false in lemma WickContraction.mem_uncontracted_iff_not_contracted (i : Fin n) : i ∈ c.uncontracted ↔ ∀ p ∈ c.1, i ∉ p
- Formalizes
- Physlib, `WickContraction.mem_uncontracted_iff_not_contracted`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 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.WickContraction.mem_uncontracted_iff_not_contracted← WickContraction.mem_uncontracted_iff_not_contracted (Physlib/QFT/PerturbationTheory/WickContraction/Uncontracted.lean:52): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 29
- WickContraction.sndFieldOfContract_congrWickContraction.sndFieldOfContract_congr
- WickContraction.getDual?_get_self_neqWickContraction.getDual?_get_self_neq
- WickContraction.fstFieldOfContract_congrWickContraction.fstFieldOfContract_congr
- WickContractionGiven a natural number
n, which will correspond to the number of fields needing contracting, a Wick contraction is a finite set of pairs… - WickContraction.congr_trans_applyWickContraction.congr_trans_apply
- WickContraction.congr_transWickContraction.congr_trans
- WickContraction.uncontractedCongr_someWickContraction.uncontractedCongr_some
- WickContraction.uncontractedFor a Wick contraction
c,c.uncontractedis defined as the finset of elements ofFin nwhich are not in any contracted pair. - WickContraction.uncontractedCongr_noneWickContraction.uncontractedCongr_none
- WickContraction.card_congrWickContraction.card_congr
- WickContraction.sndFieldOfContract_memWickContraction.sndFieldOfContract_mem
- WickContraction.sndFieldOfContract_getDual?WickContraction.sndFieldOfContract_getDual?
- WickContraction.getDual?_get_self_memWickContraction.getDual?_get_self_mem
- WickContraction.getDual?For a contraction
c : WickContraction nandi : Fin nthejsuch that{i, j}is a contracted pair inc. If such anjdoes not… - WickContraction.getDual?_one_eq_noneWickContraction.getDual?_one_eq_none
- WickContraction.self_ne_getDual?_getWickContraction.self_ne_getDual?_get
- WickContraction.self_getDual?_get_memWickContraction.self_getDual?_get_mem
- WickContraction.congr_reflWickContraction.congr_refl
- WickContraction.instDecidableEqWick contractions are decidable.
- WickContraction.fstFieldOfContract_getDual?WickContraction.fstFieldOfContract_getDual?
- WickContraction.fstFieldOfContract_memWickContraction.fstFieldOfContract_mem
- WickContraction.getDual?_getDual?_get_getWickContraction.getDual?_getDual?_get_get
- WickContraction.congrLift_rflWickContraction.congrLift_rfl
- FieldSpecificationThe structure
FieldSpecificationis defined to have the following content: - A typeFieldwhose elements are the constituent fields of… - lxv_check_specUnpacked finite check: lxv_opt is EF1, no EF1 allocation is strictly leximin-better, and every EF1 allocation not strictly leximin-worse…
- catch_up_best_map_ne_loss_iffThe best outcome over a mapped list is not a loss if and only if some element maps to something other than a loss.
- perm_card_left_gt_leFor a permutation s of {0, ..., n-1} and a position x with x <= s(x), the number of i < x with s(i) > s(x) is at most the number of j > x…
- catch_up_value_triple_win_of_sum_ltFor any natural numbers x < y < z such that x + y < z, the game value of Catch-Up played on the three-element set {x, y, z} is…
- card_pauliStringsExactSupportNumber of Pauli strings with a prescribed support. Let $n$ be a natural number and let $S \subseteq \mathrm{Fin}\,n$ be a set of…
- Used by 2
- WickContraction.mem_uncontracted_emptyWickContraction.mem_uncontracted_empty
- WickContraction.mem_not_eq_erase_of_isNoneWickContraction.mem_not_eq_erase_of_isNone
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen WickContraction invariable {𝓕 : FieldSpecification} invariable {n : ℕ} (c : WickContraction n) inset_option backward.isDefEq.respectTransparency false inlemma WickContraction.mem_uncontracted_iff_not_contracted (i : Fin n) : i ∈ c.uncontracted ↔ ∀ p ∈ c.1, i ∉ p := by simp only [uncontracted, getDual?, Finset.mem_filter, Finset.mem_univ, true_and] apply Iff.intro · intro h p hp have hp := c.2.1 p hp rw [Finset.card_eq_two] at hp obtain ⟨a, b, ha, hb, hab⟩ := hp rw [Fin.find?_eq_none_iff] at h by_contra hn simp only [Finset.mem_insert, Finset.mem_singleton] at hn rcases hn with hn | hn · subst hn simp at h exact h b hp · subst hn rw [Finset.pair_comm] at hp simp at h exact h a hp · intro h rw [Fin.find?_eq_none_iff] by_contra hn simp only [decide_eq_false_iff_not, not_forall, Decidable.not_not] at hn obtain ⟨j, hj⟩ := hn apply h {i, j} hj simp