WickContraction.exists_pair_of_not_eq_empty
theoremverifiedformalizationimported Lean
WickContraction.exists_pair_of_not_eq_empty
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open WickContraction in variable {𝓕 : FieldSpecification} in variable {n : ℕ} (c : WickContraction n) in lemma WickContraction.exists_pair_of_not_eq_empty (c : WickContraction n) (h : c ≠ empty) : ∃ i j, {i, j} ∈ c.1
- Formalizes
- Physlib, `WickContraction.exists_pair_of_not_eq_empty`
- 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.exists_pair_of_not_eq_empty← WickContraction.exists_pair_of_not_eq_empty (Physlib/QFT/PerturbationTheory/WickContraction/Basic.lean:46): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- 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.emptyThe contraction consisting of no contracted pairs.
- WickContraction.instDecidableEqWick contractions are decidable.
- FieldSpecificationThe structure
FieldSpecificationis defined to have the following content: - A typeFieldwhose elements are the constituent fields of…
- WickContractionGiven a natural number
- Used by 1
- WickContraction.uncontracted_card_eq_iffWickContraction.uncontracted_card_eq_iff
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) inlemma WickContraction.exists_pair_of_not_eq_empty (c : WickContraction n) (h : c ≠ empty) : ∃ i j, {i, j} ∈ c.1 := by obtain ⟨a, ha⟩ := Finset.nonempty_iff_ne_empty.mpr fun hc => h (Subtype.ext hc) obtain ⟨i, j, -, rfl⟩ := Finset.card_eq_two.mp (c.2.1 a ha) exact ⟨i, j, ha⟩