File size: 18,903 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 | import OAI.AlgebraicGeometry.HodgeConjecture.NegRealization
import OAI.AlgebraicGeometry.HodgeConjecture.Elementary
/-! # Normalize -/
namespace OAI.AlgebraicGeometry.HodgeConjecture.Normalize.CM.SurfaceConstruction
noncomputable section
/-! Exhaustive normalization of the six possible identity-sign patterns.
Negated types retain the actual abelian varieties with conjugated rational
markings. Only even cup permutations are used. -/
open _root_.CategoryTheory
open scoped TensorProduct
variable (E : IntermediateField β β)
[NumberField E] [IsGalois β E] [NumberField.IsCMField E]
/-- The normalized statement used only as a proved intermediate reduction. -/
def NormalizedSwitchAlgebraicity : Prop :=
β (v : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g))
(_hbalance : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((v 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((v 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((v 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((v 3).val g))
(_hid : β i, (v i).val 1 = true)
(R : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (v i)))
(X : Foundations.Scheme.IntegralProjective.IntegralProjectiveVariety) [PathConnectedSpace X.analyticSpace]
(_hX : 2 β€ X.complexDimension)
(Ο : β i, X.toOver βΆ (R i).abelianVariety.toOver),
β a : E β[β] X.rationalCohomology 4,
a β Coefficients.CM.SurfaceConstruction.coefficientAlgebraicClasses E X 2 β§
Coefficients.CM.SurfaceConstruction.realizeCoefficient E X 4 a = SurfaceConstructionQ.CM.fourCup X (fun i =>
Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((R i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E)))))
theorem switch_algebraic_of_normalized (hN : NormalizedSwitchAlgebraicity E)
(v : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g))
(hbalance : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((v 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((v 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((v 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((v 3).val g))
(R : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (v i)))
(X : Foundations.Scheme.IntegralProjective.IntegralProjectiveVariety) [PathConnectedSpace X.analyticSpace]
(hX : 2 β€ X.complexDimension)
(Ο : β i, X.toOver βΆ (R i).abelianVariety.toOver) :
β a : E β[β] X.rationalCohomology 4,
a β Coefficients.CM.SurfaceConstruction.coefficientAlgebraicClasses E X 2 β§
Coefficients.CM.SurfaceConstruction.realizeCoefficient E X 4 a = SurfaceConstructionQ.CM.fourCup X (fun i =>
Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((R i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) := by
let u : Fin 4 β X.complexCohomology 1 := fun i =>
Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((R i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))
have hb1 := hbalance 1
cases h0 : (v 0).val 1 <;> cases h1 : (v 1).val 1 <;>
cases h2 : (v 2).val 1 <;> cases h3 : (v 3).val 1 <;>
try (norm_num [ComplexMultiplication.SignSwitch.CM.signValue, h0, h1, h2, h3] at hb1)
Β· let w : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g) := ![(v 2).neg, (v 3).neg, (v 0).neg, (v 1).neg]
let T : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (w i)) :=
(Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 2) (R 2)) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 3) (R 3)) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 0) (R 0)) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 1) (R 1)) (fun i => i.elim0)))))
let Ο : β i, X.toOver βΆ (T i).abelianVariety.toOver :=
(Fin.cons (Ο 2) (Fin.cons (Ο 3) (Fin.cons (Ο 0) (Fin.cons (Ο 1) (fun i => i.elim0)))))
have hwid : β i, (w i).val 1 = true := by
intro i
fin_cases i <;> norm_num [w, h0, h1, h2, h3]
have hwbal : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((w 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((w 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 3).val g) := by
intro g
have hb := hbalance g
change ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 2).val g)) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 3).val g)) = ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 0).val g)) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 1).val g))
simp only [ComplexMultiplication.SignSwitch.CM.signValue_not]
linarith
obtain β¨a, ha, harβ© := hN w hwbal hwid T X hX Ο
refine β¨a, ha, har.trans ?_β©
have he : (fun i : Fin 4 => Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((T i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) =
![u 2, u 3, u 0, u 1] := by
funext i
fin_cases i
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 2))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 2) (R 2))
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 3))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 3) (R 3))
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 0))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 0) (R 0))
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 1))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 1) (R 1))
refine (congrArg (SurfaceConstructionQ.CM.fourCup X) he).trans ?_
exact CupRegrouping.CM.SurfaceConstruction.cup22_comm (Betti.Scheme.schemePointSpace X.toOver) _ _
Β· let w : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g) := ![v 1, (v 2).neg, (v 0).neg, v 3]
let T : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (w i)) :=
(Fin.cons (R 1) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 2) (R 2)) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 0) (R 0)) (Fin.cons (R 3) (fun i => i.elim0)))))
let Ο : β i, X.toOver βΆ (T i).abelianVariety.toOver :=
(Fin.cons (Ο 1) (Fin.cons (Ο 2) (Fin.cons (Ο 0) (Fin.cons (Ο 3) (fun i => i.elim0)))))
have hwid : β i, (w i).val 1 = true := by
intro i
fin_cases i <;> norm_num [w, h0, h1, h2, h3]
have hwbal : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((w 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((w 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 3).val g) := by
intro g
have hb := hbalance g
change ComplexMultiplication.SignSwitch.CM.signValue ((v 1).val g) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 2).val g)) = ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 0).val g)) + ComplexMultiplication.SignSwitch.CM.signValue ((v 3).val g)
simp only [ComplexMultiplication.SignSwitch.CM.signValue_not]
linarith
obtain β¨a, ha, harβ© := hN w hwbal hwid T X hX Ο
refine β¨a, ha, har.trans ?_β©
have he : (fun i : Fin 4 => Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((T i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) =
![u 1, u 2, u 0, u 3] := by
funext i
fin_cases i
Β· rfl
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 2))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 2) (R 2))
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 0))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 0) (R 0))
Β· rfl
refine (congrArg (SurfaceConstructionQ.CM.fourCup X) he).trans ?_
exact (CupRegrouping.CM.SurfaceConstruction.cup22_comm (Betti.Scheme.schemePointSpace X.toOver) _ _).trans
(CupRegrouping.CM.SurfaceConstruction.cup1111_cycle_twice (Betti.Scheme.schemePointSpace X.toOver) (u 0) (u 1) (u 2) (u 3)).symm
Β· let w : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g) := ![(v 3).neg, v 1, (v 0).neg, v 2]
let T : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (w i)) :=
(Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 3) (R 3)) (Fin.cons (R 1) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 0) (R 0)) (Fin.cons (R 2) (fun i => i.elim0)))))
let Ο : β i, X.toOver βΆ (T i).abelianVariety.toOver :=
(Fin.cons (Ο 3) (Fin.cons (Ο 1) (Fin.cons (Ο 0) (Fin.cons (Ο 2) (fun i => i.elim0)))))
have hwid : β i, (w i).val 1 = true := by
intro i
fin_cases i <;> norm_num [w, h0, h1, h2, h3]
have hwbal : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((w 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((w 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 3).val g) := by
intro g
have hb := hbalance g
change ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 3).val g)) + ComplexMultiplication.SignSwitch.CM.signValue ((v 1).val g) = ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 0).val g)) + ComplexMultiplication.SignSwitch.CM.signValue ((v 2).val g)
simp only [ComplexMultiplication.SignSwitch.CM.signValue_not]
linarith
obtain β¨a, ha, harβ© := hN w hwbal hwid T X hX Ο
refine β¨a, ha, har.trans ?_β©
have he : (fun i : Fin 4 => Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((T i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) =
![u 3, u 1, u 0, u 2] := by
funext i
fin_cases i
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 3))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 3) (R 3))
Β· rfl
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 0))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 0) (R 0))
Β· rfl
refine (congrArg (SurfaceConstructionQ.CM.fourCup X) he).trans ?_
exact (CupRegrouping.CM.SurfaceConstruction.cup22_comm (Betti.Scheme.schemePointSpace X.toOver) _ _).trans
(CupRegrouping.CM.SurfaceConstruction.cup1111_cycle (Betti.Scheme.schemePointSpace X.toOver) (u 0) (u 1) (u 2) (u 3)).symm
Β· let w : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g) := ![v 0, (v 2).neg, v 3, (v 1).neg]
let T : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (w i)) :=
(Fin.cons (R 0) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 2) (R 2)) (Fin.cons (R 3) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 1) (R 1)) (fun i => i.elim0)))))
let Ο : β i, X.toOver βΆ (T i).abelianVariety.toOver :=
(Fin.cons (Ο 0) (Fin.cons (Ο 2) (Fin.cons (Ο 3) (Fin.cons (Ο 1) (fun i => i.elim0)))))
have hwid : β i, (w i).val 1 = true := by
intro i
fin_cases i <;> norm_num [w, h0, h1, h2, h3]
have hwbal : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((w 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((w 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 3).val g) := by
intro g
have hb := hbalance g
change ComplexMultiplication.SignSwitch.CM.signValue ((v 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 2).val g)) = ComplexMultiplication.SignSwitch.CM.signValue ((v 3).val g) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 1).val g))
simp only [ComplexMultiplication.SignSwitch.CM.signValue_not]
linarith
obtain β¨a, ha, harβ© := hN w hwbal hwid T X hX Ο
refine β¨a, ha, har.trans ?_β©
have he : (fun i : Fin 4 => Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((T i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) =
![u 0, u 2, u 3, u 1] := by
funext i
fin_cases i
Β· rfl
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 2))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 2) (R 2))
Β· rfl
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 1))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 1) (R 1))
refine (congrArg (SurfaceConstructionQ.CM.fourCup X) he).trans ?_
exact (CupRegrouping.CM.SurfaceConstruction.cup1111_cycle (Betti.Scheme.schemePointSpace X.toOver) (u 0) (u 1) (u 2) (u 3)).symm
Β· let w : Fin 4 β ComplexMultiplication.OddSignSwitch.CM.OddSignPattern
(fun g : Gal(E/β) => ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E * g) := ![v 0, (v 3).neg, (v 1).neg, v 2]
let T : β i, ComplexMultiplication.CMKnownResults.CM.HodgeRealization (ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.hodgeStructure E (w i)) :=
(Fin.cons (R 0) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 3) (R 3)) (Fin.cons (NegRealization.CM.SurfaceConstruction.negRealization E (v 1) (R 1)) (Fin.cons (R 2) (fun i => i.elim0)))))
let Ο : β i, X.toOver βΆ (T i).abelianVariety.toOver :=
(Fin.cons (Ο 0) (Fin.cons (Ο 3) (Fin.cons (Ο 1) (Fin.cons (Ο 2) (fun i => i.elim0)))))
have hwid : β i, (w i).val 1 = true := by
intro i
fin_cases i <;> norm_num [w, h0, h1, h2, h3]
have hwbal : β g : Gal(E/β),
ComplexMultiplication.SignSwitch.CM.signValue ((w 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 1).val g) =
ComplexMultiplication.SignSwitch.CM.signValue ((w 2).val g) + ComplexMultiplication.SignSwitch.CM.signValue ((w 3).val g) := by
intro g
have hb := hbalance g
change ComplexMultiplication.SignSwitch.CM.signValue ((v 0).val g) + ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 3).val g)) = ComplexMultiplication.SignSwitch.CM.signValue (Bool.not ((v 1).val g)) + ComplexMultiplication.SignSwitch.CM.signValue ((v 2).val g)
simp only [ComplexMultiplication.SignSwitch.CM.signValue_not]
linarith
obtain β¨a, ha, harβ© := hN w hwbal hwid T X hX Ο
refine β¨a, ha, har.trans ?_β©
have he : (fun i : Fin 4 => Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο i)
((T i).complexComparison (ComplexMultiplication.EmbeddingDecomposition.CM.embeddingVector E
(ComplexMultiplication.GaloisCMType.CM.CMCoefficientField.galoisEmbeddingEquiv E
(if i.val < 2 then 1 else ComplexMultiplication.GaloisSigns.CM.CMCoefficientField.conjugation E))))) =
![u 0, u 3, u 1, u 2] := by
funext i
fin_cases i
Β· rfl
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 3))
(NegRealization.CM.SurfaceConstruction.negRealization_at_one E (v 3) (R 3))
Β· exact congrArg (Betti.Scheme.schemeBettiMap (ModuleCat.of β β) 1 (Ο 1))
(NegRealization.CM.SurfaceConstruction.negRealization_at_conjugation E (v 1) (R 1))
Β· rfl
refine (congrArg (SurfaceConstructionQ.CM.fourCup X) he).trans ?_
exact (CupRegrouping.CM.SurfaceConstruction.cup1111_cycle_twice (Betti.Scheme.schemePointSpace X.toOver) (u 0) (u 1) (u 2) (u 3)).symm
Β· exact hN v hbalance (by intro i; fin_cases i <;> assumption) R X hX Ο
end
end OAI.AlgebraicGeometry.HodgeConjecture.Normalize.CM.SurfaceConstruction
|