WickContraction.mem_erase_uncontracted_iff
theoremverifiedformalizationimported Lean
WickContraction.mem_erase_uncontracted_iff
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_erase_uncontracted_iff (c : WickContraction n.succ) (i : Fin n.succ) (j : Fin n) : j ∈ (c.erase i).uncontracted ↔ i.succAbove j ∈ c.uncontracted ∨ c.getDual? (i.succAbove j) = some i
- Formalizes
- Physlib, `WickContraction.mem_erase_uncontracted_iff`
- 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_erase_uncontracted_iff← WickContraction.mem_erase_uncontracted_iff (Physlib/QFT/PerturbationTheory/WickContraction/Erase.lean:39): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 30
- WickContraction.sndFieldOfContract_congrWickContraction.sndFieldOfContract_congr
- WickContraction.getDual?_get_self_neqWickContraction.getDual?_get_self_neq
- WickContraction.fstFieldOfContract_congrWickContraction.fstFieldOfContract_congr
- WickContraction.getDual?_eq_some_iff_memWickContraction.getDual?_eq_some_iff_mem
- 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.uncontracted_emptyWickContraction.uncontracted_empty
- 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.getDual?_empty_eq_noneWickContraction.getDual?_empty_eq_none
- 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.eraseGiven a Wick contraction
WickContraction n.succand ai : Fin n.succthe Wick contraction associated withnobtained by removing… - WickContraction.congrLift_rflWickContraction.congrLift_rfl
- FieldSpecificationThe structure
FieldSpecificationis defined to have the following content: - A typeFieldwhose elements are the constituent fields of… - 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…
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_erase_uncontracted_iff (c : WickContraction n.succ) (i : Fin n.succ) (j : Fin n) : j ∈ (c.erase i).uncontracted ↔ i.succAbove j ∈ c.uncontracted ∨ c.getDual? (i.succAbove j) = some i := by rw [getDual?_eq_some_iff_mem] simp only [uncontracted, getDual?, erase, Nat.succ_eq_add_one, Finset.mem_filter, Finset.mem_univ, Finset.map_insert, Fin.succAboveEmb_apply, Finset.map_singleton, true_and] rw [Fin.find?_eq_none_iff, Fin.find?_eq_none_iff] apply Iff.intro · intro h by_cases hi : {i.succAbove j, i} ∈ c.1 · simp [hi] · apply Or.inl intro k by_cases hi' : k = i · subst hi' simpa using hi · simp only [← Fin.exists_succAbove_eq_iff] at hi' obtain ⟨z, hz⟩ := hi' subst hz exact h z · intro h k rcases h with h | h · exact h (i.succAbove k) · by_contra hn have hc := c.2.2 _ h _ (by simpa using hn) simp only [Nat.succ_eq_add_one, Finset.disjoint_insert_right, Finset.mem_insert, Finset.mem_singleton, true_or, not_true_eq_false, Finset.disjoint_singleton_right, not_or, false_and, or_false] at hc have hi : i ∈ ({i.succAbove j, i.succAbove k} : Finset (Fin n.succ)) := by simp [← hc] simp only [Nat.succ_eq_add_one, Finset.mem_insert, Finset.mem_singleton] at hi rcases hi with hi | hi · exact False.elim (Fin.succAbove_ne _ _ hi.symm) · exact False.elim (Fin.succAbove_ne _ _ hi.symm)